Bottom-Up Parsing/Exercise 13: LALR(1)

From Wiki**3

< Bottom-Up Parsing
Revision as of 14:55, 24 April 2018 by Root (talk | contribs)

Problema

Consider the following grammar, where A is the initial symbol and { x, y, z } is the set of terminal symbols: <text> A -> A B A x | A y | z B -> x | z B </text>

  1. Compute the set of LALR(1) states for the grammar. Build the corresponding LALR(1) parse table.
  2. Compact the parse table, eliminating and propagating reductions.
  3. Show the parsing process for input zzxzyx (including the actions/gotos and the input and stack states). In case of conflict, assume YACC's behavior.

Solução

Solução completa

ABAx.jpg

Retrieved from "https://www.hlt.inesc-id.pt/~david/wiki/pt/index.php?title=Bottom-Up_Parsing/Exercise_13:_LALR(1)&oldid=9817"