GATE Computer Science (CS) 2018 Shift 1 Solved Paper

© examsiri.com

Question : 57 of 65

Marks: +1, -0

Consider the following parse tree for the expression a # b $ c $ d # e # f, involving two binaryoperators $ and #.

Which one of the following is correct for the given parse tree?

$ has higher precedence and is left associative; # is right associative
# has higher precedence and is left associative; $ is right associative
$ has higher precedence and is left associative; # is left associative
# has higher precedence and is right associative; $ is left associative

Go to Question:

Prev Question

Next Question