roioeil: Consider the follwin ambiguous BNramnar: Rewrite the grammar so that it is no longer ambiguous and has the following properties: The operators have the following precedence, from highest to lowest: ( ), !, &&, I l' ?:, =. The !' ?:, and = operators are right associative, and the && and I l operators are left associative. roioeil: Consider the follwin ambiguous BNramnar: Rewrite the grammar so that it is no longer ambiguous and has the following properties: The operators have the following precedence, from highest to lowest: ( ), !, &&, I l' ?:, =. The !' ?:, and = operators are right associative, and the && and I l operators are left associative