Consider two binary operators ‘
‘ and ‘
‘ with the precedence of operator being lower than that of the operator. Operator is right associative while operator is left associative. Which one of the following represents the parse tree for expression (7 3 4 3 2)? (GATE CS 2011)
(A) A
(B) B
(C) C
(D) D
Answer: (B)
Explanation: Let us consider the given expression (
).
Since the precedence of is higher, the sub-expression (
) will be evaluated first. In this sub-expression, 
would be evaluated first because is right to left associative. So the expression is evaluated as 
. Also, note that among the two 
operators, first one is evaluated before the second one because the associativity of is left to right.
Quiz of this Question
Feeling lost in the world of random DSA topics, wasting time without progress? It’s time for a change! Join our DSA course, where we’ll guide you on an exciting journey to master DSA efficiently and on schedule.
Ready to dive in? Explore our Free Demo Content and join our DSA course, trusted by over 100,000 neveropen!
Ready to dive in? Explore our Free Demo Content and join our DSA course, trusted by over 100,000 neveropen!
