The following grammar is an ambiguous grammar for expressions. The terminals in the grammar are enclosed in single quotes. Write a new grammar for the same language that is not ambiguous. Construct the grammar so that it enforces correct operator precedence and associativity. The precedence of the operators is given by the precedence table. (Each row in the table is a different level of precedence.) All binary operators are left-associative except for '^' which is right-associative. E -> '!' E E -> E '==' E E -> E '!=' E E -> E '^' E E -> '(' E ')' E -> 'x'

Precedence Table
highest	!
	^
lowest	== !=