Bottom-Up Parsing/LALR(1) Example 1

From Wiki**3

< Bottom-Up Parsing

Consider the following grammar (A is the start symbol):

A -> C x A | ε
B -> x C y | x C
C -> x B x | z
  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 reductions.
  4. Show the stack and input states, as well as the parser actions, for the sequence xxzxx.
  • Solution
    There is a "bug" in this solution: in the compacted table, L3 in state 10 should be in the column corresponding to y (corresponding to the shift to state 11 in the uncompacted table).