October 7, 2023
October 8, 2023
October 7, 2023
###### UGC-NET DEC-2019 Part-2
October 8, 2023
 Question 39

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
Question 39 Explanation:
Given expression is
2 # 3 & 5 # 6 & 4
→ Here # means multiplication (*)
→ & is having more precedence because it is far from starting symbol, here # and & are left associatives.
2 # 3 & 5 # 6 & 4
⇒ (2 * (3+5)) * (6+4)
⇒ (2 * 8) * (10)
⇒ 16 * 10 = 160
Question 39 Explanation:
Given expression is
2 # 3 & 5 # 6 & 4
→ Here # means multiplication (*)
→ & is having more precedence because it is far from starting symbol, here # and & are left associatives.
2 # 3 & 5 # 6 & 4
⇒ (2 * (3+5)) * (6+4)
⇒ (2 * 8) * (10)
⇒ 16 * 10 = 160