Consider the syntax directed translation given by the following grammar and semantic rules. Here $N, I, F$ and $B$ are non-terminals. $N$ is the starting non-terminal, and $\#$, $\mathbf{0}$ and $\mathbf{1}$ are lexical tokens corresponding to input letters “#”, “0” and “1”, respectively. $X.val$ denotes the synthesized attribute (a numeric value) associated with a non-terminal $X$. $I_1$ and $F_1$ denote occurrences of $I$ and $F$ on the right hand side of a production, respectively. For the tokens $\mathbf{0}$ and $\mathbf{1}$, $\mathbf{0}.val = 0$ and $\mathbf{1}.val = 1$. $$\begin{array}{llll} N & \rightarrow & I \, \# \, F & N.val = I.val + F.val I & \rightarrow & I_1 \, B & I.val = (2 \, I_1.val) + B.val I & \rightarrow & B & I.val = B.val F & \rightarrow & B \, F_1 & F.val = \frac{1}{2}(B.val + F_1.val) F & \rightarrow & B & F.val = \frac{1}{2} B.val B & \rightarrow & \mathbf{0} & B.val = \mathbf{0}.val B & \rightarrow & \mathbf{1} & B.val = \mathbf{1}.val \end{array}$$ The value computed by the translation scheme for the input string $$10\#011$$ is ________. (Rounded off to three decimal places)

Consider the syntax directed translation given by the following grammar and semantic rules. Here N, I, F and B are non-terminals. N is the starting non-terminal, and \#, 0 and 1 are lexical tokens corresponding to input letters “#”, “0” and “1”, respectively. X.val denotes the synthesized attribute (a numeric value) associated with a non-terminal X. I1 and F1 denote occurrences of I and F on the right hand side of a production, respectively. For the tokens 0 and 1, 0.val = 0 and 1.val = 1. arrayllll N & & I \, \# \, F & N.val = I.val + F.val I & & I1 \, B & I.val = (2 \, I1.val) + B.val I & & B & I.val = B.val F & & B \, F1 & F.val = 12(B.val + F1.val) F & & B & F.val = 12 B.val B & & 0 & B.val = 0.val B & & 1 & B.val = 1.val array The value computed by the translation scheme for the input string 10\#011 is … (Rounded off to three decimal places)

Topic-wise GATE CS PYQs with verified steps