GATE CS Syntax-directed Translation questions

Consider the following two syntax-directed definitions $\text{SDD1}$ and $\text{SDD2}$ for type declarations. …

​​Given the following syntax directed translation rules: Rule 1: $R \rightarrow A B\{B . i=R . i-1 ; A . i=B . i ; R . i=A . i+1 ;\}$ Rule 2: $P \rightarrow C D\{P . i=C . i+D . i ; D . i=C . i+2 ;\}$ Rule 3: $Q \rightarrow E F\{Q . i=E . i+F . i ;\}$ Which ONE is the CORRECT option among the following?

​Consider the following syntax-directed definition $\text{(SDD)}$. …

​​​​​Which of the following statements is/are FALSE?

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 $\text{“\#", “0" and “1"},$ respectively. $X.val$ denotes the synthesized attribute (a …

Consider the following grammar along with translation rules. …

​​​Consider the following grammar (that admits a series of declarations, followed by expressions) and the associated syntax directed translation $\text{(SDT)}$ actions, given as pseudo-code …

Consider the productions $A \rightarrow PQ$ and $A \rightarrow XY$. Each of the five non-terminals $A, P, Q, X,$ and $Y$ has two attributes: $s$ is a synthesized attribute, and $i$ is an inherited attribute. Consider the following rules. Rule $1: P . i = A.i + 2, \: Q.i = P. i + A.i,$ and $A.s = P.s +Q. s$ Rule $2: X.i = A.i + Y.s$ and …

Consider the following grammar and the semantic actions to support the inherited type declaration attributes. Let $X_1, X_2, X_3, X_4, X_5$, and $X_6$ be the placeholders for the non-terminals $D, T, L$ or $L_1$ in the following table: …

Consider the following Syntax Directed Translation Scheme $( SDTS )$, with non-terminals $\{S,A \}$ and terminals $\{a,b \}$. $S \to aA \quad \{\text{print }1\}$ $S \to a \quad \{\text{print }2\}$ $A \to Sb \quad \{\text{print }3\}$ Using the above $SDTS$ , the output printed by a bottom-up parser, for the input $aab$ is:

Consider the expression tree shown. Each leaf represents a numerical value, which can either be $0$ or $1$. Over all possible choices of the values at the leaves, the maximum possible value of the expression represented by the tree is ___.

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

Consider the syntax directed definition shown below. …

In a bottom-up evaluation of a syntax directed definition, inherited attributes can

A shift reduce parser carries out the actions specified within braces immediately after reducing with the corresponding rule of grammar $S \rightarrow xxW \;\text{{print“1"}}$ $S \rightarrow y \;\text{{print“2"}}$ $W \rightarrow Sz\; \text{{print“3"}}$ What is the translation of $xxxxyzz$ using the syntax directed translation scheme described by the …