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

From Wiki**3

< Bottom-Up Parsing


Consider the following grammar, where S is the initial symbol and { e, i, x } is the set of terminal symbols:

S -> i S | i S e S | x
  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 completa