Give an unambiguous, context-free grammar which generatesarithmetic expressions using the operators given below.
The operators are listed in order of decreasing precedence.
The only operand is id, and only the operators shown below arevalid.
= and += These right-associativity binary operators have thesame highest precedence.
* This is a left-associative binary operator.
+ This is a left-associative binary operator.
^ This right-associative binary operator has the lowestprecedence.
Solution