Path: utzoo!news-server.csri.toronto.edu!cs.utexas.edu!sdd.hp.com!think.com!mintaka!spdcc!iecc!compilers-sender From: reidmp@maine.maine.edu (Reid M. Pinchback) Newsgroups: comp.compilers Subject: Full LL(1) versus Strong LL(1)... what's the diff? Keywords: LL(1), question Message-ID: Date: 13 Mar 91 18:20:41 GMT Sender: compilers-sender@iecc.cambridge.ma.us Reply-To: reidmp@maine.maine.edu (Reid M. Pinchback) Organization: Compilers Central Lines: 14 Approved: compilers@iecc.cambridge.ma.us 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 -- Send compilers articles to compilers@iecc.cambridge.ma.us or {ima | spdcc | world}!iecc!compilers. Meta-mail to compilers-request.