Consider the following expression grammar. The semantic rules for expression calculation are stated next to each grammar production.
E→number E.val=numbe.val
∣∣ E'+'E E(1).val=E(2).val+E(3).val∣∣E '×'E E(1).val=E(2).val×E(3).val;
Assume the conflicts in Part (a) of this question are resolved and an LALR(1) parser is generated for parsing arithmetic expressions as per the given grammar. Consider an expression 3 × 2 + 1. What precedence and associativity properties does the generated parser realize?