Recursive Descent vs. LALR

John Resler <JohnMResler@netscape.net>
20 Jun 2003 00:17:22 -0400

          From comp.compilers
Related articles
Recursive Descent vs. LALR JohnMResler@netscape.net (John Resler) (2003-06-20)
Re: Recursive Descent vs. LALR bear@sonic.net (2003-06-25)
Re: Recursive Descent vs. LALR cfc@shell01.TheWorld.com (Chris F Clark) (2003-07-02)
Re: Recursive Descent vs. LALR kamalpr@yahoo.com (2003-07-03)
Re: Recursive Descent vs. LALR John.M.Resler@Boeing.com (Boeing) (2003-07-04)
Re: Recursive Descent vs. LALR bear@sonic.net (2003-07-04)
| List of all articles for this month |
From: John Resler <JohnMResler@netscape.net>
Newsgroups: comp.compilers
Date: 20 Jun 2003 00:17:22 -0400
Organization: Cox Communications
Keywords: parse, question, comment
Posted-Date: 20 Jun 2003 00:17:22 EDT

I got halfway through a compiler theory course a few years back and
finances required dropping out of school. Since then I've been messing
around with Parsing tools and the like and have been using JavaCC. It is
a recursive descent parser and I understand a bit of the way a Recursive
Descent Parser works versus bottom up parsing. I seem to recall a
theorem that said any LALR(K) grammar could be rewritten to an LALR(1)
grammar and another theorem that said Recursive Descent versus LALR(1)
were equally capable. Can anyone shed some light on this? I am also
curious if anyone knows anything about the JJTree tool? I subscribe to
the JavaCC mailing list but even there, few individuals are aware of
JJTree's capabilities and thus its uses. I'd appreciate any information
anybody could give me. Thanks in advance.


-John

Post a followup to this message

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