Path: utzoo!utgpu!news-server.csri.toronto.edu!rpi!zaphod.mps.ohio-state.edu!think.com!mintaka!spdcc!iecc!compilers-sender
From: VM1!MAINE!REIDMP.BITNET@gatech.edu (Reid M. Pinchback)
Newsgroups: comp.compilers
Subject: Re: Full LL(1) versus Strong LL(1)... what's the diff?
Keywords: LL(1), parse
Message-ID: <91074.224422REIDMP@MAINE.BITNET>
Date: 16 Mar 91 03:44:22 GMT
References: <REIDMP.910313132041@maine.maine.EDU> <1991Mar14.234735.24401@jato.jpl.nasa.gov>
Sender: compilers-sender@iecc.cambridge.ma.us
Reply-To: Reid M. Pinchback <VM1!MAINE!REIDMP.BITNET@gatech.edu>
Organization: University of Maine System
Lines: 8
Approved: compilers@iecc.cambridge.ma.us

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.
-- 
Send compilers articles to compilers@iecc.cambridge.ma.us or
{ima | spdcc | world}!iecc!compilers.  Meta-mail to compilers-request.