Newsgroups: comp.lang.scheme
Path: cantaloupe.srv.cs.cmu.edu!rochester!udel!delmarva.com!internetMCI!newsfeed.internetmci.com!howland.reston.ans.net!ix.netcom.com!netcom.com!NewsWatcher!user
From: hbaker@netcom.com (Henry Baker)
Subject: Re: Is Garbage Collection faster?
Message-ID: <hbaker-1710950804080001@10.0.2.15>
Sender: hbaker@netcom16.netcom.com
Organization: nil organization
References: <44uskp$4g6@news.inc.net> <450m7f$77h@camelot.ccs.neu.edu> <DFzHB6.654@cogsci.ed.ac.uk> <KANDERSO.95Oct7105511@lager.bbn.com> <45h1g6$g37@news.parc.xerox.com> <DGI23o.vr@cogsci.ed.ac.uk> <s5gvipp5sdz.fsf@eiffel.lcs.mit.edu>
Date: Tue, 17 Oct 1995 16:04:08 GMT
Lines: 16

In article <s5gvipp5sdz.fsf@eiffel.lcs.mit.edu>, patl@lcs.mit.edu wrote:

> GCC does tail recursion, but only for self-calls, I believe.  This is
> because the stack layout for each target is defined by C macros in a
> mostly ad-hoc way.  As a result, it is hard to put general tail
> recursion into the compiler in a portable way.  (I could be wrong
> about some of this; it has been a while since I looked at GCC, and I
> never understood it completely.)

There _is_ a way to do tail-recursion in C, portably.  See

ftp://ftp.netcom.com/pub/hb/hbaker/CheneyMTA.html  (also .ps.Z)

-- 
www/ftp directory:
ftp://ftp.netcom.com/pub/hb/hbaker/home.html
