This is the mail archive of the
gcc@gcc.gnu.org
mailing list for the GCC project.
Re: New Regalloc development stalled?
- From: dewar at gnat dot com (Robert Dewar)
- To: matz at suse dot de, neroden at twcny dot rr dot com
- Cc: gcc at gcc dot gnu dot org
- Date: Thu, 5 Dec 2002 14:04:03 -0500 (EST)
- Subject: Re: New Regalloc development stalled?
> Not exactly true. LISP is pure-functional, and as such has much deeper
> 'nesting' (stack depth) than most procedural programs. True, you *can*
> write equally deeply nested procedural programs, but as a matter of
> fact, people usually don't.
Well this is off topic, but I really hate to see such misinformation
posted.
First: LISP of course has assignments, what on earth makes you think that
it is a pure functional language (scheme also has assignments). Please be
sure you know a language before criticizing it :-)
Second: Even if you avoid assignments and use only recursion, it is of course
the case that any loop translates into tail recursion which in any acceptale
implementation does not result in deep nesting on the stack.