GATE | GATE-CS-2004 | Question 45

Consider the grammar with the following translation rules and E as the start symbol.

E → E1 # T { E.value = E1.value * T.value }
         | T{ E.value = T.value }
T → T1 & F { T.value = T1.value + F.value }
          | F{ T.value = F.value }
F → num { F.value = num.value } 

Compute E.value for the root of the parse tree for the expression: 2 # 3 & 5 # 6 & 4.
(A) 200
(B) 180
(C) 160
(D) 40


Answer: (C)

Explanation: See question 5 of https://www.geeksforgeeks.org/compilers-set-1/

Quiz of this Question



My Personal Notes arrow_drop_up


Article Tags :

1


Please write to us at contribute@geeksforgeeks.org to report any issue with the above content.