Question

Consider the grammar with the following translation rules and E as the start symbol.
$\begin{array}{cc}E\to E_1\#T& \{E.\mathrm{value}=E_1.\mathrm{value}*T.\mathrm{value}\}\\ |T& \{E.\mathrm{value}=T.\mathrm{value}\}\\ T\to T_1\&F& \{T.\mathrm{value}=T_1.\mathrm{value}+F.\mathrm{value}\}\\ |F& \{T.\mathrm{value}=F.\mathrm{value}\}\\ F\to \mathrm{num}& \{F.\mathrm{value}=\mathrm{num}.\mathrm{value}\}\end{array}$

Compute E. value for the root of the parse tree for the expression: 2 # 3 & 5 # 6 & 4.

• A. 200
• B. 180
• C. 40
• D. 160

Answer 1

The correct option is D 160

First we have to construct the parse tree.

Then we construct the annonated parse tree or parse tree with value at the leaf node.