We use cookies to ensure you have the best browsing experience on our website. By using our site, you acknowledge that you have read and understood our Cookie Policy & Privacy Policy
GATE | GATE CS 2011 | Question 27
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)?
(A) A
(B) B
(C) C
(D) D
Answer:(B) Explanation: See question 3 of https://www.geeksforgeeks.org/data-structures-and-algorithms-set-27/amp/ Quiz of this Question