Paging Mr. Rettig [ws Re: Explanation of macros; Haskell macros]

[james anderson]

Duane Rettig wrote:
> 
> james anderson <james.anderson at setf.de> writes:
> 
> > Marcin 'Qrczak' Kowalczyk wrote:
> > >
> > > On Sun, 02 Nov 2003 02:01:58 -0800, Duane Rettig wrote:
> > >
> > > > With this much openness, it doesn't seem unreasonable
> > > > to expect a debugger to be able to use such information to make macros
> > > > and the forms they expand into completely debuggable and steppable at
> > > > any desired level.
> > >
> > > Does any debugger do this?
> >
> > ? you mean like this? wrt evaluating
> >
> > (defun testf (x)
> >   (dotimes (i x)
> >     (print i)))
> >
> > (step (testf 2))
> 
> I've reproduced the whole code below so that readers can see it
> when they contemplate this comment and a question (I have no time
> now, but I'll explain tonight if nobody gets it, although it should
> be easy):  James did not say what lisp he was using, but presumably
> it is a Common Lisp.  The following example was obviously not
> compiled.  Can you explain why?
> 
> > ==>
> >...
> >
> > v/s
> >
> > ...
> >
> > depending on whether one stepped into or over the macro form?

yes. whereby the first transcript is the result of successive "steps into".

...