Syntax Directed Translation · Compiler Design · GATE CSE
Start PracticeMarks 1
GATE CSE 2021 Set 2
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 thr...
GATE CSE 2016 Set 1
Consider the following code segment.
x = u - t;
y = x * v;
x = y + w;
y = t - z;
y = x * y;
The minimum number of total variables required to convert ...
GATE CSE 2015 Set 2
In the context of abstract-syntax-tree $$(AST)$$ and control-flow-graph $$(CFG),$$ which one of the following is TRUE?
GATE CSE 2014 Set 3
One of the purposes of using intermediate code in compilers is to
GATE CSE 2003
Which of the following statements is FALSE?
GATE CSE 1997
In the following grammar:
$$\eqalign{
& X:: = X \oplus {Y \over Y} \cr
& Y:: = Z*{Y \over Z} \cr
& Z:: = id \cr} $$
Which of the...
GATE CSE 1995
A linker is given object modules for a set of programs that were compiled separately. What information need to be included in an object module?
GATE CSE 1994
Generation of intermediate code based on an abstract machine model is useful in compilers because
Marks 2
GATE CSE 2024 Set 1
Consider the following syntax-directed definition (SDD).
table { width: 100%; border-collapse: collapse; margin: 20px 0; } th { background-color: blue...
GATE CSE 2023
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 no...
GATE CSE 2022
Consider the following grammar along with translation rules.
S $$\to$$ S1 # T {S.val = S1.val * T.val}
S $$\to$$ T {S.val = T.val}
T $$\to$$ T1 %R {T....
GATE CSE 2021 Set 1
Consider the following grammar (that admits a series of declarations, followed by expressions) and the associated syntax directed translation (SDT) ac...
GATE CSE 2019
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$...
GATE CSE 2016 Set 1
Consider the following Syntax Directed Translation Scheme $$(SDTS),$$ with non-terminals $$\left\{ {S,A} \right\}$$ and terminals $$\left\{ {A,B} \rig...
GATE CSE 2014 Set 3
Consider the basic block given below.
a = b + c
c = a + d
d = b + c
e = d - b
a = e + b
The minimum number of nodes and edges present in the DAG r...
GATE CSE 2010
The program below uses six temporary variables a, b, c, d, e, f.
a = 1
b = 10
c = 20
d = a + b
e = c + d
f = c + e
b = c + e
e = b + f
d = 5 +...