inling/tail recursion, recursive decent parser

"Lefteris Keftedopoulos" <spam@disney.com>
21 Jun 2005 13:56:08 -0400

          From comp.compilers
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)
| List of all articles for this month |
From: "Lefteris Keftedopoulos" <spam@disney.com>
Newsgroups: comp.compilers
Date: 21 Jun 2005 13:56:08 -0400
Organization: Compilers Central
Keywords: parse, question, performance, comment
Posted-Date: 21 Jun 2005 13:56:08 EDT

1)
Would inlining / tail recursion have significant effect on the amount
of call stack space used by a recursive decent parser?


2)
would a generated parser (javaCC) compiled by javac, automatically
be inlined / and tail recursionified by javac, and would it have any
significant effect.


Lefteris
[The grammars I've seen don't nest very deeply except for top level
rules for lists of statements. -John]

Post a followup to this message

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