(→Solution) |
(→Problem) |
||
(6 intermediate revisions by the same user not shown) | |||
Line 4: | Line 4: | ||
Consider the following grammar, where '''<tt>F</tt>''' is the initial symbol and '''<tt>{a,b,c,d,e}</tt>''' is the set of terminal symbols: | Consider the following grammar, where '''<tt>F</tt>''' is the initial symbol and '''<tt>{a,b,c,d,e}</tt>''' is the set of terminal symbols: | ||
+ | O -> a | ||
+ | G -> F c | O c d | ε | ||
F -> G b | O c F e | F -> G b | O c F e | ||
− | |||
− | |||
# 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:Top-Down Parsing-exercise-06.jpg|800px|Temporary handwritten solution]] | |
− | |||
− | |||
− | |||
− | |||
− | |||
− | [[Image:Top-Down Parsing | ||
− | |||
− | |||
− | |||
− | |||
− | [[category: | + | [[category:Compiladores]] |
− | [[category: | + | [[category:Ensino]] |
Contents |
Consider the following grammar, where F is the initial symbol and {a,b,c,d,e} is the set of terminal symbols:
O -> a G -> F c | O c d | ε F -> G b | O c F e