Return to the
comp.compilers page.
Search the
comp.compilers archives again.
| From: | SLK Mail <slkpg@cox.net> |
| Newsgroups: | comp.compilers |
| Date: | Sat, 6 Feb 2010 14:44:00 -0500 |
| Organization: | Compilers Central |
| References: | 10-02-009 10-02-015 10-02-018 |
| Keywords: | parse, LL(1) |
| Posted-Date: | 10 Feb 2010 11:00:59 EST |
S -> a A a
S -> b A b a
A -> b
A ->
The example grammar I gave is the classic example from the literature
of a grammar that is LL(2), but not strong LL(2). Since it is not
strong LL(2), it clearly is not LL(1).
Your grammar is in fact strong LL(3):
S: aa | aba | bba | bbba;
If you think it is LL(1), provide the parse table.
If you think it is a language rather than a grammar, provide an LL(1)
grammar that recognizes it.
Return to the
comp.compilers page.
Search the
comp.compilers archives again.