BNF

Suppose we are designing a new Programming Language called NPL2017. One task is to formally specify the languages grammar in BNF. We want the following operators of various precedence and associativity:

where higher precedence operators are executed first, and associativity determines which operators of equal precedence are executed first.

Complete the following BNF definition to enforce these operator precedence and associativity rules. Assume that the nonterminals and are already defined for you and represent variables and numeric values. You do not have to handle parentheses.

|

you fill in the rest...

Precedence Operators Operator type Associativity highest prefix unary right to left (i.e., right associative) infix binary none infix binary left associative lowest & infix binary left associative