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

From Wiki**3

< Bottom-Up Parsing
No edit summary
No edit summary
Line 1: Line 1:
Consider the following grammar.
Consider the following grammar.
<text>
<text>
A -> C x A | ϵ
A -> C x A | ε
B -> x C y | x C
B -> x C y | x C
C -> x B x | z
C -> x B x | z

Revision as of 20:23, 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://www.hlt.inesc-id.pt/~david/wiki/pt/index.php?title=Bottom-Up_Parsing/LALR(1)_Example_1&oldid=2496"