![Consider the following parse tree for the expression a#b$c$d#e#f, involving two binary operators $ and #](https://www.gkseries.com/blog/wp-content/uploads/2023/09/Consider-the-following-parse-tree-for-the-expression-abcdef-involving-two-binary-operators-and-.jpg)
Q. Consider the following parse tree for the expression a#b$c$d#e#f, involving two binary operators $ and #.
![](https://www.gkseries.com/blog/wp-content/uploads/2023/09/image-97.png)
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