Re: Detailed algorithms on inline optimization

Tony Finch <dot@dotat.at>
02 Feb 2010 01:08:31 +0000 (GMT)

          From comp.compilers
Related articles
[12 earlier articles]
Re: Detailed algorithms on inline optimization mcrodgers@gmail.com (Martin Rodgers) (2010-01-24)
Re: Detailed algorithms on inline optimization anton@mips.complang.tuwien.ac.at (2010-01-25)
Re: Detailed algorithms on inline optimization monnier@iro.umontreal.ca (Stefan Monnier) (2010-01-25)
Re: Detailed algorithms on inline optimization kkylheku@gmail.com (Kaz Kylheku) (2010-01-28)
Re: Detailed algorithms on inline optimization martin@gkc.org.uk (Martin Ward) (2010-01-28)
Re: Detailed algorithms on inline optimization anton@mips.complang.tuwien.ac.at (2010-01-31)
Re: Detailed algorithms on inline optimization dot@dotat.at (Tony Finch) (2010-02-02)
Re: Detailed algorithms on inline optimization anton@mips.complang.tuwien.ac.at (2010-02-02)
| List of all articles for this month |
From: Tony Finch <dot@dotat.at>
Newsgroups: comp.compilers
Date: 02 Feb 2010 01:08:31 +0000 (GMT)
Organization: dotat labs
References: 10-01-058 10-01-079 10-01-085 10-01-094
Keywords: optimize
Posted-Date: 02 Feb 2010 23:07:47 EST

Martin Ward <martin@gkc.org.uk> wrote:
>
>Any fucntion with one or more calls at the end is tail-recursive and
>the tail calls can be replaced by branches to the top of the function
>body.


Is your recursion elimination related to the CPS transformation?


Tony.
--
f.anthony.n.finch <dot@dotat.at> http://dotat.at/
BISCAY FITZROY: VARIABLE BECOMING SOUTHWESTERLY 3 OR 4, INCREASING 5 TO 7 IN
NORTH. SLIGHT OR MODERATE, OCCASIONALLY ROUGH IN NORTH. MAINLY FAIR. MODERATE
OR GOOD.


Post a followup to this message

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