Re: tail call reduction

[Stefan Monnier <monnier@iro.umontreal.ca>]

> My main pet Emacs Lisp programming project involves both a lot of
> parsing and recursively descending of tree-like data structures.

Can you give a short description of one such case where you've bumped
into problems.  After all, the lack of tail-recursion should only be
a problem when you implement loops by recursive calls, but unless your tree
data-structures are very deep, normal recursion should fine.

> But, alas, unless I am much mistaken, proper tail recursion is simply
> impossible in a dynamically scoped environment.  I could reduce byte

I recommend you check out the lexbind branch which introduces static scoping
(it still provides dynamic scoping as well, but it should allow tail-call
elimination in most simple cases).


        Stefan