write an expression BNF grammar using the followin partial table of binary operators in C:

= (assignment)

|| (logical or)

&& (logical and)

| (inclusive or)

^ (exclusive or)

& (and)

== != (equality)

< <= >= > (relational)

<< >> (shift)

+ - (additive)

* / % (multiplicative)

operators are in order of increasing precedence, that is, the assignment operator = has the lowest precedence and the multiplicative operators *, /, and % have the highest precedence. All operators on the same line have the same precedence and associativity. The assignment operator is right associative; all other operators are left associative.