Q. 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
Ans: $ has higher precedence and is left associative; # is right associative
![Determine the correctness (or otherwise) of the following Assertion [A] and the Reason [R]](https://www.gkseries.com/blog/wp-content/uploads/2023/10/Determine-the-correctness-or-otherwise-of-the-following-Assertion-A-and-the-Reason-R.jpg)
