# Syntax-directed Translation

 Question 1
Consider the following ANSI C program:
int main () {
Integer x;
return 0;
} 
Which one of the following phases in a seven-phase C compiler will throw an error?
 A Lexical analyzer B Syntax analyzer C Semantic analyzer D Machine dependent optimizer
GATE CSE 2021 SET-2   Compiler Design
Question 1 Explanation:
 Question 2
Consider the following grammar (that admits a series of declarations, followed by expressions) and the associated syntax directed translation (SDT) actions, given as pseudo-code

$\begin{array}{lll} P & \rightarrow & D^* E^* \\ D & \rightarrow & \textsf{int ID} \{ \text{record that } \textsf{ID.} \text{lexeme is of type} \textsf{ int\}} \\ D & \rightarrow & \textsf{bool ID} \{ \text{record that } \textsf{ID.} \text{lexeme is of type} \textsf{ bool\}} \\ E& \rightarrow & E_1 +E_2 \{ \text{check that } E_1. \text{type}=E_2. \text{type} = \textsf{int}; \text{set } E.\text{type }:= \textsf{int} \} \\ E & \rightarrow & !E_1 \{ \text{check that } E_1. \text{type} = \textsf{bool}; \text{ set } E.\text{type} := \textsf{bool} \} \\ E & \rightarrow & \textsf{ID} \{ \text{set } E. \text{type } := \textsf{int} \} \end{array}$

With respect to the above grammar, which one of the following choices is correct?
 A The actions can be used to correctly type-check any syntactically correct program B The actions can be used to type-check syntactically correct integer variable declarations and integer expressions C The actions can be used to type-check syntactically correct boolean variable declarations and boolean expressions. D The actions will lead to an infinite loop
GATE CSE 2021 SET-1   Compiler Design
Question 2 Explanation:
 Question 3
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:

Which one of the following are the appropriate choices for $X_1,X_2,X_3 \; and \; X_4$?
 A $X_1=L,X_2=T,X_3=L_1,X_4=L$ B $X_1=T,X_2=L,X_3=L_1,X_4=T$ C $X_1=L,X_2=L,X_3=L_1,X_4=T$ D $X_1=T,X_2=L,X_3=T,X_4=L_1$
GATE CSE 2019   Compiler Design
Question 3 Explanation:
 Question 4
Which one of the following statements is FALSE?
 A Context-free grammar can be used to specify both lexical and syntax rules. B Type checking is done before parsing. C High-level language programs can be translated to different Intermediate Representations. D Arguments to a function can be passed using the program stack.
GATE CSE 2018   Compiler Design
Question 4 Explanation:
 Question 5
Consider the following Java code fragment:
 public class While
{
public void loop()
{
int x = 0;
while(1)
{
System.out.println("x plus one is" +(x+1));
}
}
}
 A There is syntax error in line no. 1 B There is syntax errors in line nos. 1 & 6 C There is syntax error in line no. 8 D There is syntax error in line no. 6
ISRO CSE 2014   Compiler Design
Question 5 Explanation:
 Question 6
Which of the following statements is FALSE?
 A In statically typed language, each variable in a program has a fixed type B In up-typed languages, values do not have any types C In dynamically typed languages, variables have no types D In all statically typed languages, each variable in a program is associated with values of only a single type during the execution of the program
GATE CSE 2003   Compiler Design
Question 6 Explanation:
 Question 7
In a bottom-up evaluation of a syntax directed definition, inherited attributes can
 A always be evaluated B be evaluated if the definition is L-attributed C be evaluated only if the definition has synthesized attributes D never be evaluated
GATE CSE 2003   Compiler Design
Question 7 Explanation:
 Question 8
Type checking is normally done during
 A lexical analysis B syntax analysis C syntax directed translation D code optimization
GATE CSE 1998   Compiler Design
Question 8 Explanation:
 Question 9
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 above rules?
 A 23131 B 11233 C 11231 D 33211
GATE CSE 1995   Compiler Design
Question 9 Explanation:
There are 9 questions to complete.