Difference between revisions of "Bottom-Up Parsing/Exercise 15: LALR(1)"

From Wiki**3

< Bottom-Up Parsing
(Created page with "== Problema == Consider the following grammar, where A is the initial symbol and '''{ x, y, z }''' is the set of terminal symbols: <source lang="text"> A -> A M | z R -> x |...")
(No difference)

Revision as of 19:10, 24 May 2023

Problema

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

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

Solução

Solução completa

AM1.jpg AM2.jpg

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