Operators are #, @ and % where

# has the highest precedence

% has the lowest.

No parenthesized parts.

They are all RIGHT associative.

a) Using non-terminals E for expression, T for term and F for factor

and the only other terminal is a, please write production rules

for E, T and F.

b) Using the set of rules from #1, please draw the parse tree for

a # a # a

c) Using the set of rules from #1, please draw the parse tree for

a # a % a @ a