Re: Detecting endless recursion?

Joachim Durchholz <joachim.durchholz@web.de>
8 Feb 2004 21:55:03 -0500

          From comp.compilers
Related articles
[20 earlier articles]
Re: Detecting endless recursion? nmm1@cus.cam.ac.uk (2004-02-01)
Re: Detecting endless recursion? derkgwen@HotPOP.com (Derk Gwen) (2004-02-01)
Re: Detecting endless recursion? lex@cc.gatech.edu (Lex Spoon) (2004-02-01)
Re: Detecting endless recursion? bear@sonic.net (Ray Dillinger) (2004-02-04)
Re: Detecting endless recursion? nmm1@cus.cam.ac.uk (2004-02-04)
Re: Detecting endless recursion? witness@t-online.de (Uli Kusterer) (2004-02-04)
Re: Detecting endless recursion? joachim.durchholz@web.de (Joachim Durchholz) (2004-02-08)
Re: Detecting endless recursion? alexc@std.com (Alex Colvin) (2004-02-08)
Re: Detecting endless recursion? cymric73@hotmail.com (Maarten D. de Jong) (2004-02-08)
Re: Detecting endless recursion? kenrose@tfb.com (Ken Rose) (2004-02-12)
Re: Detecting endless recursion? witness@t-online.de (Uli Kusterer) (2004-02-13)
Re: Detecting endless recursion? joachim.durchholz@web.de (Joachim Durchholz) (2004-02-26)
Re: Detecting endless recursion? lex@cc.gatech.edu (Lex Spoon) (2004-02-26)
| List of all articles for this month |
From: Joachim Durchholz <joachim.durchholz@web.de>
Newsgroups: comp.compilers
Date: 8 Feb 2004 21:55:03 -0500
Organization: Oberberg Online Infosysteme
References: 04-01-050 04-01-086 04-01-119 04-01-123 04-02-015 04-02-056 04-02-056
Keywords: debug, optimize
Posted-Date: 08 Feb 2004 21:55:03 EST

Nick Maclaren wrote:
>> Joachim Durchholz <joachim.durchholz@web.de> writes: Like
>> many advanced optimisations, Tail recursion removal is as far
>> from advanced as I can imagine. Actually I have seen it taught in
>> undergraduate courses.
>
> I wasn't meaning advanced in that sense. I was using it in the sense
> that it is an optimisation which has effects that may be visible to
> the programmer.


Well, that's not the same as "advanced" :-)


> In this, it is like converting multiplication to division, the use of
> associativity for the reordering of operations and so on, and unlike
> register allocation, simple common expression removal and strength
> reduction in for-loops.


On the contrary. Tail call optimization allows programmers to use
tail-recursive idioms that would be prohibitively expensive otherwise.


Regards,
Jo
--
Currently looking for a new job.

Post a followup to this message

Return to the comp.compilers page.
Search the comp.compilers archives again.