(→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 → B x y | x y x | x B y |
− | B | + | B → 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 → B x y | x y x | x B y
B → z | ε
Solução (sem compactação) para SLR(1) |
---|
Solução completa para LALR(1) |
---|