Line 14: | Line 14: | ||
== Solution == | == Solution == | ||
− | The terminal symbols are all the symbols not defined by a rule: '''<tt>or</tt>''', '''<tt>and</tt>''', '''<tt>not</tt>''', '''<tt>(</tt>''', '''<tt>)</tt>''', '''<tt>true</tt>''', '''<tt>false</tt>'''. | + | 1. The terminal symbols are all the symbols not defined by a rule: '''<tt>or</tt>''', '''<tt>and</tt>''', '''<tt>not</tt>''', '''<tt>(</tt>''', '''<tt>)</tt>''', '''<tt>true</tt>''', '''<tt>false</tt>'''. |
+ | |||
+ | 2. The following trees are possible for true and false and true (an analogous analysis could be done for '''or''') | ||
+ | |||
+ | 3. The following grammar selects left associativity for the binary operators ('''and''' and '''or'''): | ||
+ | |||
+ | bexpr -> bexpr or bterm | bterm | ||
+ | bterm -> bterm and bfactor | bfactor | ||
+ | bfactor -> not bfactor | ( bexpr ) | true | false | ||
+ | |||
+ | 4. The analysis considers the grammar defined in 3. | ||
+ | |||
+ | |||
[[category:Compilers]] | [[category:Compilers]] | ||
[[category:Teaching]] | [[category:Teaching]] |
Consider the following grammar:
bexpr -> bexpr or bexpr | bterm bterm -> bterm and bterm | bfactor bfactor -> not bfactor | ( bexpr ) | true | false
1. The terminal symbols are all the symbols not defined by a rule: or, and, not, (, ), true, false.
2. The following trees are possible for true and false and true (an analogous analysis could be done for or)
3. The following grammar selects left associativity for the binary operators (and and or):
bexpr -> bexpr or bterm | bterm bterm -> bterm and bfactor | bfactor bfactor -> not bfactor | ( bexpr ) | true | false
4. The analysis considers the grammar defined in 3.