engineering recuitment NIELIT Scientific Assistant Mock Test 2025 Compiler Design Parser Operator Precedence
Consider the following parse tree for the expression a # b $ c $ d # e # f, involving two binary operators $ and #.
Which one of the following is correct for the given parse tree?
1
$ has higher precedence and is left associative; # is right associative.
2
# has higher precedence and is left associative; $ is right associative
3
$ has higher precedence and is left associative; # is left associative
4
# has higher precedence and is right associative; $ is left associative