Re: Compiling a recursive macro

[Douglas Lewan]

I managed to lose the last response to my original question, the one 
with the case_ macro. Here it is for reference:

(defmacro case_ (val &rest list)
  "(case value
        ((<items>) result1)
        ((<items>) result2)
        [else result3])

   Macro for switch case statement. It test if value is any of the item. If
   item match the value it will return coresponding result expression value.
   If no value match and there is else it will return that result."
  (if (listp list)
      (let* ((item (car list))
             (first (car item))
             (result (cadr item))
             (rest (cdr list))
             (value (gensym)))
        `(let ((,value ,val))
           (if (member ,value ',first)
               ,result
             ,(if (and (listp rest)
                       (eq (caar rest) 'else))
                  'xxx
                (if (not (null rest))
                    `(case_ ,value ,@rest))))))
      nil))

I did, however, manage to save the macro and, indeed, it compiles 
without the max-depth-exceeded. There's an insightful difference from 
what I was attempting: Instead of invoking the macro directly, here the 
recursive call is inside a back-tick.

Sorry to have lost the mail. My keyboard stutters on occasion and I'm 
guessing I wound up doing something distructive twice. The point is that 
I'd like to thank that author.

--
,Doug
d.lewan2000@gmail.com
(908) 720 7908

If this is what winning looks like, I'd hate to see what losing is.