Related articles |
---|
inling/tail recursion, recursive decent parser spam@disney.com (Lefteris Keftedopoulos) (2005-06-21) |
Re: inling/tail recursion, recursive decent parser henry@spsystems.net (2005-06-23) |
Re: inling/tail recursion, recursive decent parser diablovision@yahoo.com (2005-06-30) |
Re: inling/tail recursion, recursive decent parser ronny@cs.ru.nl (Ronny Wichers Schreur) (2005-07-02) |
Re: inling/tail recursion, recursive decent parser cfc@shell01.TheWorld.com (Chris F Clark) (2005-07-02) |
From: | Ronny Wichers Schreur <ronny@cs.ru.nl> |
Newsgroups: | comp.compilers |
Date: | 2 Jul 2005 20:24:46 -0400 |
Organization: | Radboud University Nijmegen |
References: | 05-06-100 05-06-144 |
Keywords: | Java, optimize |
Posted-Date: | 02 Jul 2005 20:24:46 EDT |
diablovision writes (to comp.compilers):
> [..] Java's exception model (i.e. the availability of a stack trace)
> makes it basically impossible to do tail recursion elimination,
> either by Javac or by the VM.
But see "A Tail-Recursive Machine with Stack Inspection", Clements,
Felleisen, Transactions on Programming Langugages and Systems (TOPLAS,
November 2004), available from
<http://www.brinckerhoff.org/JBCsite/papers/index.html>
Cheers,
Ronny Wichers Schreur
Return to the
comp.compilers page.
Search the
comp.compilers archives again.