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

From Wiki**3

< Bottom-Up Parsing
The printable version is no longer supported and may have rendering errors. Please update your browser bookmarks and please use the default browser print function instead.

Problema

Consider the following grammar, where A is the initial symbol and { x, y, z } is the set of terminal symbols: 

A → B y y | z z x | x B x
B → z | ε
  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 xx (including the actions/gotos and the input and stack states). In case of conflict, assume YACC's behavior.

Solução

Solução completa

Retrieved from "https://web.tecnico.ulisboa.pt/~david.matos/w/pt/index.php?title=Bottom-Up_Parsing/Exercise_11:_LALR(1)&oldid=16336"