(Created page with "{{TOCright}} = Problem = 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: F -> G b |...") |
(→Solution) |
||
Line 13: | Line 13: | ||
== Solution == | == Solution == | ||
+ | |||
+ | === Semantic tree and dependency graph === | ||
+ | |||
+ | "x" is an inherited attribute (propagation in blue); "val" is a synthesized attribute (propagration in red). | ||
+ | |||
+ | Temporary handwritten solution. | ||
+ | |||
+ | [[Image:Top-Down Parsing/Exercise 6.png]] | ||
+ | |||
+ | === Attribute grammar using only synthesized attributes === | ||
+ | |||
+ | |||
[[category:Teaching]] | [[category:Teaching]] | ||
[[category:Compilers]] | [[category:Compilers]] |
Consider the following grammar, where F is the initial symbol and {a,b,c,d,e} is the set of terminal symbols:
F -> G b | O c F e O -> a G -> F c | O c d | (eps)
"x" is an inherited attribute (propagation in blue); "val" is a synthesized attribute (propagration in red).
Temporary handwritten solution.
File:Top-Down Parsing/Exercise 6.png