Gate2018 cs Q55

0. 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?

Answer
Comment
Array

Option : A
Explanation :
here $ is higher precedence than # $ is left associative because in the sub expression b $ c $ d, b $ c will be evaluated first as per given tree.
As per the given tree structure right # if higher precedence than left #.
Hence it is right associative.

Forgot your password?

I agree with the Terms.