Question: 3. Given the following grammar in BNF: -> = -> A | B | C -> + | -> * | -> ( ) |
3. Given the following grammar in BNF:
a. In the grammar above, find FIRST and FOLLOW for
b. Rewrite the given grammar to give + precedence over * (+ done before *) and force + to be right associative (so that a+b+c does second + first).
Step by Step Solution
There are 3 Steps involved in it
Get step-by-step solutions from verified subject matter experts
