Related articles |
---|
Full LL(1) versus Strong LL(1)... what's the diff? reidmp@maine.maine.edu (1991-03-13) |
Re: Full LL(1) versus Strong LL(1)... what's the diff? vsnyder@jato.jpl.nasa.gov (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) |
Newsgroups: | comp.compilers |
From: | reidmp@maine.maine.edu (Reid M. Pinchback) |
Keywords: | LL(1), question |
Organization: | Compilers Central |
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
comp.compilers page.
Search the
comp.compilers archives again.