Assume the following rules of associativity and precedence for expressions:

Precedence Highest *, /, not +, –, &, mod – (unary) =, /=, < , <=, >=, > and Lowest or, xor

Associativity Left to right

Show the order of evaluation of the following expressions by parenthesizing all subexpressions and placing a superscript on the right parenthesis to indicate order.

For example, for the expression a + b * c + d

the order of evaluation would be represented as ((a + (b * c)^1 )^2 + d)^3

Draw parse trees for the following expressions in exercise 9: a., d., and f.

a. a * b - 1 + c
d. -a or c = d
f. -a + b