Consider the following grammar along with translation rules. $$\begin{array}{ll} S \rightarrow S_1 \text{ \# } T & \{S_{\bullet val} = S_{1\bullet val} * T_{\bullet val}\} S \rightarrow T & \{S_{\bullet val} = T_{\bullet val}\} T \rightarrow T_1 \% R & \{T_{\bullet val} = T_{1\bullet val} \div R_{\bullet val}\} T \rightarrow R & \{T_{\bullet val} = R_{\bullet val}\} R \rightarrow id & \{R_{\bullet val} = id_{\bullet val}\} \end{array}$$ Here # and % are operators and $id$ is a token that represents an integer and $id_{\bullet val}$ represents the corresponding integer value. The set of non-terminals is $\{S, T, R, P\}$ and a subscripted non-terminal indicates an instance of the non-terminal. Using this translation scheme, the computed value of $S_{\bullet val}$ for root of the parse tree for the expression $20\#10\%5\#8\%2\%2$ is __________.

Consider the following grammar along with translation rules. arrayll S S1 \# T & \S val = S1 val * T val\ S T & \S val = T val\ T T1 \% R & \T val = T1 val R val\ T R & \T val = R val\ R id & \R val = id val\ array Here # and % are operators and id is a token that represents an integer and id val represents the corresponding integer value. The set of non-terminals is \S, T, R, P\ and a subscripted non-terminal indicates an instance of the non-terminal. Using this translation scheme, the computed value of S val for root of the parse tree for the expression 20\#10\%5\#8\%2\%2 is …

Topic-wise GATE CS PYQs with verified steps