(→Solução) |
(→Problema) |
||
Line 3: | Line 3: | ||
Consider the following grammar, where A is the initial symbol and '''{ x, y, z }''' is the set of terminal symbols: | Consider the following grammar, where A is the initial symbol and '''{ x, y, z }''' is the set of terminal symbols: | ||
<source lang="text"> | <source lang="text"> | ||
− | A | + | A → A M | z |
− | R | + | R → x | z |
− | M | + | M → R y | z |
</source> | </source> | ||
# Compute the set of LALR(1) states for the grammar. Build the corresponding LALR(1) parse table. | # Compute the set of LALR(1) states for the grammar. Build the corresponding LALR(1) parse table. |
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
Note-se que a solução apresentada é para SLR(1) e LALR(1) (a vermelho).
Solução completa |
---|