Re: Tail recursion syntactic sugar faked with TAGBODY-based construct?
- From: Marco Antoniotti <marcoxa@xxxxxxxxx>
- Date: Thu, 31 Jan 2008 05:55:50 -0800 (PST)
On Jan 31, 2:40 am, Gene <gene.ress...@xxxxxxxxx> wrote:
On Jan 30, 4:09 am, Kaz Kylheku <kkylh...@xxxxxxxxx> wrote:
Anyone have any interesting mutual tail recursion examples? I'd like
to try rewriting them using ARGTAGS.
How about implementing a finite state machine e.g. for an input
scanner? There was a recent discussion in comp.programming about
using tail-recursive functions in C to this effect.
http://groups.google.com/group/comp.programming/browse_thread/thread/...
Standard practice here and elsewhere. You just use LABELS and let the
compiler do the optimizing (if it implements it).
Cheers
--
Marco
.
- References:
- Prev by Date: Re: Order of macroexpansion
- Next by Date: Re: Order of macroexpansion
- Previous by thread: Re: Tail recursion syntactic sugar faked with TAGBODY-based construct?
- Next by thread: Re: Announcing a new release of Lisp1 #2
- Index(es):
Relevant Pages
|
