|Full LL(1) versus Strong LL(1)... what's the diff? firstname.lastname@example.org (1991-03-13)|
|Re: Full LL(1) versus Strong LL(1)... what's the diff? email@example.com (1991-03-14)|
|Re: Full LL(1) versus Strong LL(1)... what's the diff? VM1!MAINE!REIDMP.BITNET@gatech.edu (Reid M. Pinchback) (1991-03-15)|
|From:||firstname.lastname@example.org (Reid M. Pinchback)|
|Date:||Wed, 13 Mar 91 13:20:41 EST|
In "Crafting a Compiler" (Fischer & LeBlanc), the pros and cons
of a strong LL(1) versus a full LL(1) parser are discussed. The
text implies that the example code in the book is for a strong LL(1)
parser. It doesn't clearly mention how the actual construction of
the parser differs for the two cases.
Here is the question: How does *construction* of a full LL(1) parser
differ from construction of a strong LL(1) parser? How could you tell
the difference when looking at sample code?
Thanx in advance
Return to the
Search the comp.compilers archives again.