Assume the conflicts 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?

• 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? a) Equal precedence and left associativity; expression is evaluated to 7
• B. Equal precedence and right associativity, expression is evaluated to 9
• C. Precedence of ‘x’ is higher than that of ‘+’, and both operators are left associative; expression is evaluated to 7
• D. Precedence of ‘ # ‘ is higher than that of ‘#’, and both operators are left associative; expression is evaluated to 9View Answer