(→Solution) |
(→Problem) |
||
(4 intermediate revisions by the same user not shown) | |||
Line 2: | Line 2: | ||
= Problem = | = Problem = | ||
− | Consider the following grammar, where '''<tt>A</tt>''' is the initial symbol and '''<tt>{x, y, z}</tt>''' is the set of terminal symbols: | + | Consider the following grammar, where '''<tt>A</tt>''' is the initial symbol and '''<tt>{v,x,y,z}</tt>''' is the set of terminal symbols: |
C -> v | C -> v | ||
A -> B x | z C A y | A -> B x | z C A y | ||
− | B -> A v | z C w | | + | B -> A v | z C w | ε |
# 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. | ||
Line 14: | Line 14: | ||
== Solution == | == Solution == | ||
− | [[Image:CompilersTopDownParsingExercise9.jpg]] | + | [[Image:CompilersTopDownParsingExercise9.jpg|700px]] |
− | [[category: | + | [[category:Compiladores]] |
− | [[category: | + | [[category:Ensino]] |
Contents |
Consider the following grammar, where A is the initial symbol and {v,x,y,z} is the set of terminal symbols:
C -> v A -> B x | z C A y B -> A v | z C w | ε