LALR(1) differences to LR(1)

"aegis" <aegis@scientist.com>
1 Nov 2005 00:19:02 -0500

          From comp.compilers
Related articles
LALR(1) differences to LR(1) aegis@scientist.com (aegis) (2005-11-01)
Re: LALR(1) differences to LR(1) haberg@math.su.se (2005-11-01)
Re: LALR(1) differences to LR(1) branco.medeiros@gmail.com (2005-11-08)
Re: LALR(1) differences to LR(1) parsersinc@earthlink.net (SLK Parsers) (2005-11-12)
| List of all articles for this month |
From: "aegis" <aegis@scientist.com>
Newsgroups: comp.compilers
Date: 1 Nov 2005 00:19:02 -0500
Organization: http://groups.google.com
Keywords: parse, question
Posted-Date: 01 Nov 2005 00:19:02 EST

In what regard is LALR(1) more strict than LR(1)? From what I have
read they both perform lookaheads when parsing. What are the other
additional restrictions associated with LALR(1)? Also, what is
considered a follow set in contrast with a lookahead set?


The book I am reading is lex and yacc and also reading the bison
manual.
--
aegis

Post a followup to this message

Return to the comp.compilers page.
Search the comp.compilers archives again.