Difference between revisions of "Bottom-Up Parsing/LALR(1) Example 1"

From Wiki**3

< Bottom-Up Parsing
m
Line 12: Line 12:
  
 
* [http://www.l2f.inesc-id.pt/~david/ist/docencia/compiladores/2007-2008/lalr-ex-1.pdf Solution]
 
* [http://www.l2f.inesc-id.pt/~david/ist/docencia/compiladores/2007-2008/lalr-ex-1.pdf Solution]
 +
 +
[[category:Compilers]]
 +
[[category:IST]]

Revision as of 18:58, 5 May 2008

Consider the following grammar. <text> A -> C x A | ϵ B -> x C y | x C C -> x B x | z </text>

  1. Build the LALR(1) parser table. If conflicts exist, assume YACC's behavior.
  2. Show the differences to LR(0) and SLR(1) parsers.
  3. Compact the parse table, eliminating and propagating reductins.
  4. Show the stack and input states, as well as the parser actions, for the sequence xxzxx.
Retrieved from "https://web.tecnico.ulisboa.pt/~david.matos/w/pt/index.php?title=Bottom-Up_Parsing/LALR(1)_Example_1&oldid=2495"