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

From Wiki**3

< Bottom-Up Parsing
(Created page with "== Problema == Consider the following grammar, where S is the initial symbol and { e, i, x } is the set of terminal symbols: <text> S -> i S | i S e S | x </text> # Compute...")
 
Line 11: Line 11:


== Solução ==
== Solução ==
{{CollapsedCode|Solução completa|
[[image:sis.png]]
}}


[[category:Compiladores]]
[[category:Compiladores]]
[[category:Ensino]]
[[category:Ensino]]

Revision as of 14:10, 21 April 2016

Problema

Consider the following grammar, where S is the initial symbol and { e, i, x } is the set of terminal symbols: <text> S -> i S | i S e S | x </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 ixixex (including the actions/gotos and the input and stack states). In case of conflict, assume YACC's behavior.
  4. Is this an SLR(1) grammar? Why?

Solução

Solução completa

Sis.png

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