Question: PROBLEM QUESTION 1 (10 points) Consider the following BNF grammar for expressions: expr? id expr op expr id > a) Show that this grammar is

PROBLEM QUESTION 1 (10 points) Consider the following BNF grammar for expressions: expr? id expr op expr id > a) Show that this grammar is ambiguous. (5 points) b) Rewrite the grammar so that it is no longer ambiguous, and so that it uses the precedence rules shown in table (where all operators associate left to right). (5 points) Precedence High Medium *,/, mod Low
Step by Step Solution
There are 3 Steps involved in it
Get step-by-step solutions from verified subject matter experts
