Q45

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

$$\begin{array}{lll} E \rightarrow E_ 1\# \: T & \qquad\left\{E.value = E_1.value * T.value\right\}\\ \qquad\mid T & \qquad \{E.value = T.value\}\\ T \rightarrow T_1 \& \: F &\qquad \{T.value = T_1.value + F.value\}\\ \qquad\mid F&\qquad \{T.value = F.value\}\\ F \rightarrow \text{num}&\qquad \{F.value=num.value\} \end{array}$$

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