Programming
October 4, 2023Time-Complexity
October 4, 2023GATE 2018
| Question 41 |
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?
| $ has higher precedence and is left associative; # is right associative | |
| # has higher precedence and is left associative; $ is right associative
| |
| $ has higher precedence and is left associative; # is left associative | |
| # has higher precedence and is right associative; $ is left associative
|
Question 41 Explanation:
Since $ will be evaluated before # so $ has higher precedence and the left $ i.e., in b$c$d the left “$” (i.e., b$c) will be evaluated first so it is left associative, whereas # is right associative (as in d#e#f) , the right one (i.e., e#f) will be evaluated first.
Correct Answer: A
Question 41 Explanation:
Since $ will be evaluated before # so $ has higher precedence and the left $ i.e., in b$c$d the left “$” (i.e., b$c) will be evaluated first so it is left associative, whereas # is right associative (as in d#e#f) , the right one (i.e., e#f) will be evaluated first.