GATE CS 2018 | Question 43 | GATE CS Solutions | GATE CS PYQs | Compiler Design
The solution for the GATE CS 2018, Question 43;
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?
(A) $ has higher precedence and is left associative; # is right associative
(B) # has higher precedence and is left associative; $ is right associative
(C) $ has higher precedence and is left associative; # is left associative
(D) # has higher precedence and is right associative; $ is left associative
is as follows as discussed in this video session.
#GATECS2018 #GATECSPYQs #CompilerDesign
