Recursive Descent Parsers only with LL(1)-grammars?

Gilbert Mirenque <formatzeh@gmx.de>
Wed, 20 Aug 2008 10:33:54 -0700 (PDT)

          From comp.compilers
Related articles
Recursive Descent Parsers only with LL(1)-grammars? formatzeh@gmx.de (Gilbert Mirenque) (2008-08-20)
Re: Recursive Descent Parsers only with LL(1)-grammars? parsersinc@earthlink.net (SLK Mail) (2008-08-20)
Re: Recursive Descent Parsers only with LL(1)-grammars? torbenm@pc-003.diku.dk (2008-08-21)
Re: Recursive Descent Parsers only with LL(1)-grammars? jaluber@gmail.com (Johannes) (2008-08-21)
| List of all articles for this month |
From: Gilbert Mirenque <formatzeh@gmx.de>
Newsgroups: comp.compilers
Date: Wed, 20 Aug 2008 10:33:54 -0700 (PDT)
Organization: Compilers Central
Keywords: parse, LL(1)
Posted-Date: 20 Aug 2008 14:01:53 EDT

Hello NG,


I'm not so familiar with compiler construction just interested in it.
What appears curious is that I have heard that it is only possible to
implement recursive descent parsers for LL(1)-grammars. But I imagine
that it isn't a problem to look ahead more than just one symbol. So my
question is why it is only possible for LL(1)-grammars?


greets
Gilbert

Post a followup to this message

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