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: | Reid M. Pinchback <VM1!MAINE!REIDMP.BITNET@gatech.edu> |
Keywords: | LL(1), parse |
Organization: | University of Maine System |
References: | <REIDMP.910313132041@maine.maine.EDU> <1991Mar14.234735.24401@jato.jpl.nasa.gov> |
Date: | Friday, 15 Mar 1991 22:44:22 EST |
According to Fischer and LeBlanc, the language described by
strong LL(1) and full LL(1) is the same, but the actual parsers
themselves differ. One direct email reply stated that the difference
had to do with strong LL(1) being used in cases where you had
controlled ambiguity.
--
Return to the
comp.compilers page.
Search the
comp.compilers archives again.