Q38

MCQ2 marks, −0.67

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

Loading…