(→Problem) |
|||
Line 5: | Line 5: | ||
X → c | X → c | ||
A → a A | B x | X | A → a A | B x | X | ||
− | B → b | | + | B → b B | A y |
# Examine the grammar and rewrite it so that an LL(1) predictive parser can be built for the corresponding language. | # Examine the grammar and rewrite it so that an LL(1) predictive parser can be built for the corresponding language. |
Consider the following grammar, where A is the initial symbol and {a, b, c, x, y} is the set of terminal symbols:
X → c A → a A | B x | X B → b B | A y
Solução completa |
---|