View source for Bottom-Up Parsing/Exercise 17: LALR(1)

== Problema ==

Consider the following grammar, where '''R''' is the initial symbol and '''{ a, b, c }''' is the set of terminal symbols: 
<source lang="text">
X -> X Y c | X a | a
Y -> a | b
</source>
# Compute the set of LALR(1) states for the grammar. Build the corresponding LALR(1) parse table.
# Compact the parse table, eliminating and propagating reductions.
# Show the parsing process for input '''aabc''' (including the actions/gotos and the input and stack states). In case of conflict, assume YACC's behavior.

== Solução ==
Note-se que a solução apresentada é para SLR(1) e LALR(1) (a vermelho).

{{CollapsedCode|Solução completa|
[[Image:XYc.jpg|768px]]
}}

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