Lexical analysis, Parsing, Syntax-directed translation, Runtime environments, Intermediate code generation.

$$\scriptsize{\overset{{\large{\textbf{Mark Distribution in Previous GATE}}}}{\begin{array}{|c|c|c|c|c|c|c|c|}\hline
\textbf{Year}& \textbf{2024-1} & \textbf{2024-2} & \textbf{2023} & \textbf{2022} & \textbf{2021-1}&\textbf{2021-2}&\textbf{Minimum}&\textbf{Average}&\textbf{Maximum}
\\\hline\textbf{1 Mark Count} &2&2&1 & 2&1&2&1&1.67&2
\\\hline\textbf{2 Marks Count} &4&3&3 & 1 &3&2&1&2.67&4
\\\hline\textbf{Total Marks} &10&8&7 & 4&7&6&\bf{4}&\bf{7}&\bf{10}\\\hline
\end{array}}}$$

Recent questions in Compiler Design

17 votes

2 answers

2181

GATE CSE 1997 | Question: 1.8
A language $L$ allows declaration of arrays whose sizes are not known during compilation. It is required to make efficient use of memory. Which one of the following is true? A compiler using static memory allocation can be written for $L$ A compiler ... $L$; an interpreter must be used A compiler using dynamic memory allocation can be written for $L$ None of the above

A language $L$ allows declaration of arrays whose sizes are not known during compilation. It is required to make efficient use of memory. Which one of the following is tr...

Kathleen

4.7k views

Kathleen asked Sep 29, 2014

22 votes

2 answers

2182

GATE CSE 1997 | Question: 1.6
In the following grammar $X ::= X \oplus Y \mid Y$ $Y::= Z * Y \mid Z$ $Z::= id $ Which of the following is true? $\text{ }\oplus\text{'}$ is left associative while $\text{ }*\text{'}$ ... $\text{ }\oplus\text{'}$ is right associative while $\text{ }*\text{'}$ is left associative None of the above

In the following grammar$X ::= X \oplus Y \mid Y$$Y::= Z * Y \mid Z$$Z::= id $Which of the following is true?$\text{‘}\oplus\text{’}$ is left associative while $\text...

Kathleen

6.8k views

Kathleen asked Sep 29, 2014

24 votes

3 answers

2183

GATE CSE 2010 | Question: 14
Which languages necessarily need heap allocation in the runtime environment? Those that support recursion. Those that use dynamic scoping. Those that allow dynamic data structure. Those that use global variables.

Which languages necessarily need heap allocation in the runtime environment?Those that support recursion.Those that use dynamic scoping.Those that allow dynamic data stru...

go_editor

8.5k views

go_editor asked Sep 29, 2014

28 votes

5 answers

2184

GATE CSE 2010 | Question: 13
Which data structure in a compiler is used for managing information about variables and their attributes? Abstract syntax tree Symbol table Semantic stack Parse table

Which data structure in a compiler is used for managing information about variables and their attributes?Abstract syntax treeSymbol tableSemantic stackParse table

go_editor

14.5k views

go_editor asked Sep 29, 2014

29 votes

3 answers

2185

GATE CSE 2012 | Question: 52
For the grammar below, a partial $LL(1)$ parsing table is also presented along with the grammar. Entries that need to be filled are indicated as $E1, E2,$ and $E3$. $\varepsilon$ is the empty string, \$ indicates end of input, and, $ ... $ \text{FOLLOW}(A) = \{a, b\} $ $ \text{FOLLOW}(B) =\{a, b\} $

For the grammar below, a partial $LL(1)$ parsing table is also presented along with the grammar. Entries that need to be filled are indicated as $E1, E2,$ and $E3$. $\var...

gatecse

5.0k views

gatecse asked Sep 29, 2014

49 votes

7 answers

2186

GATE CSE 2011 | Question: 36
Consider evaluating the following expression tree on a machine with load-store architecture in which memory can be accessed only through load and store instructions. The variables $a, b, c, d,$ and $e$ are initially stored in memory. The binary operators used ... in memory, what is the minimum number of registers needed to evaluate this expression? $2$ $9$ $5$ $3$

Consider evaluating the following expression tree on a machine with load-store architecture in which memory can be accessed only through load and store instructions. The ...

go_editor

15.2k views

go_editor asked Sep 29, 2014

38 votes

4 answers

2187

GATE CSE 2011 | Question: 27
Consider two binary operators $\text{ } \uparrow \text{'}$ and $\text{ } \downarrow \text{'}$ with the precedence of operator $\downarrow$ being lower than that of the operator $\uparrow$. Operator $\uparrow$ is right associative while operator ... Which one of the following represents the parse tree for expression $(7 \downarrow 3 \uparrow 4 \uparrow 3 \downarrow 2)$

Consider two binary operators $\text{‘} \uparrow \text{’}$ and $\text{‘} \downarrow \text{’}$ with the precedence of operator $\downarrow$ being lower than that ...

go_editor

7.2k views

go_editor asked Sep 29, 2014

37 votes

2 answers

2188

GATE CSE 2011 | Question: 19
The lexical analysis for a modern computer language such as Java needs the power of which one of the following machine models in a necessary and sufficient sense? Finite state automata Deterministic pushdown automata Non-deterministic pushdown automata Turing machine

The lexical analysis for a modern computer language such as Java needs the power of which one of the following machine models in a necessary and sufficient sense?Finite s...

go_editor

14.0k views

go_editor asked Sep 29, 2014

44 votes

3 answers

2189

GATE CSE 2011 | Question: 1
In a compiler, keywords of a language are recognized during parsing of the program the code generation the lexical analysis of the program dataflow analysis

In a compiler, keywords of a language are recognized duringparsing of the programthe code generationthe lexical analysis of the programdataflow analysis

go_editor

17.4k views

go_editor asked Sep 29, 2014

67 votes

4 answers

2190

GATE CSE 2014 Set 3 | Question: 34
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 representation of the above basic block respectively are $6$ and $6$ $8$ and $10$ $9$ and $12$ $4$ and $4$

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 representation of the abo...

go_editor

35.7k views

go_editor asked Sep 28, 2014

49 votes

3 answers

2191

GATE CSE 2014 Set 3 | Question: 18
Which of the following statements are CORRECT? Static allocation of all data areas by a compiler makes it impossible to implement recursion. Automatic garbage collection is essential to implement recursion. Dynamic allocation of activation records is essential to implement recursion. Both heap ... and $2$ only $2$ and $3$ only $3$ and $4$ only $1$ and $3$ only

Which of the following statements are CORRECT?Static allocation of all data areas by a compiler makes it impossible to implement recursion. Automatic garbage collection i...

go_editor

13.2k views

go_editor asked Sep 28, 2014

35 votes

4 answers

2192

GATE CSE 2014 Set 3 | Question: 17
One of the purposes of using intermediate code in compilers is to make parsing and semantic analysis simpler. improve error recovery and error reporting. increase the chances of reusing the machine-independent code optimizer in other compilers. improve the register allocation.

One of the purposes of using intermediate code in compilers is tomake parsing and semantic analysis simpler.improve error recovery and error reporting.increase the chance...

go_editor

9.5k views

go_editor asked Sep 28, 2014

60 votes

7 answers

2193

GATE CSE 2014 Set 3 | Question: 11
The minimum number of arithmetic operations required to evaluate the polynomial $P(X) = X^5+4X^3+6X+5$ for a given value of $X$, using only one temporary variable is ______.

The minimum number of arithmetic operations required to evaluate the polynomial $P(X) = X^5+4X^3+6X+5$ for a given value of $X$, using only one temporary variable is ____...

go_editor

19.4k views

go_editor asked Sep 28, 2014

44 votes

7 answers

2194

GATE CSE 2014 Set 2 | Question: 39
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 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 max...

go_editor

9.6k views

go_editor asked Sep 28, 2014

100 votes

9 answers

2195

GATE CSE 2014 Set 2 | Question: 34
For a C program accessing $\mathbf{X[i] [j] [k]}$, the following intermediate code is generated by a compiler. Assume that the size of an integer is $32$ bits and the size of a character is $8$ bits. t0 = i ∗ 1024 t1 = j ∗ 32 t2 = k ∗ 4 t3 = t1 + t0 t4 ... as "char $\mathbf{X[4] [32] [8]}$ . $\mathbf{X}$ is declared as "char $\mathbf{X[32] [16] [2]}$ .

For a C program accessing $\mathbf{X[i] [j] [k]}$, the following intermediate code is generated by a compiler. Assume that the size of an integer is $32$ bits and the siz...

go_editor

36.4k views

go_editor asked Sep 28, 2014

29 votes

4 answers

2196

GATE CSE 2014 Set 2 | Question: 18
Which one of the following is NOT performed during compilation? Dynamic memory allocation Type checking Symbol table management Inline expansion

Which one of the following is NOT performed during compilation?Dynamic memory allocationType checkingSymbol table managementInline expansion

go_editor

9.3k views

go_editor asked Sep 28, 2014

20 votes

2 answers

2197

GATE CSE 2014 Set 2 | Question: 17
Consider the grammar defined by the following production rules, with two operators $∗$ and $+$ $S\:\to\:T∗P$ $T\:\to\:U\mid T∗U$ $P\:\to\:Q+P\mid Q$ $Q\:\to Id$ $U\:\to Id$ Which one of the following is TRUE? $ +$ is left ... $ +$ is right associative, while $∗$ is left associative Both $+$ and $∗$ are right associative Both $+$ and $∗$ are left associative

Consider the grammar defined by the following production rules, with two operators $∗$ and $+$$S\:\to\:T∗P$$T\:\to\:U\mid T∗U$$P\:\to\:Q+P\mid Q$$Q\:\to Id$$U\:\to ...

go_editor

6.8k views

go_editor asked Sep 28, 2014

45 votes

4 answers

2198

GATE CSE 2006 | Question: 84
Which one of the following grammars generates the language $ L=\left \{ a^{i}b^{j}\mid i\neq j \right \}$? $S\rightarrow AC\mid CB$ $C\rightarrow aCb\mid a\mid b$ $A\rightarrow aA\mid \varepsilon$ $B\rightarrow Bb\mid \varepsilon$ ... $S\rightarrow AC\mid CB$ $C\rightarrow aCb\mid \varepsilon$ $A\rightarrow aA\mid a$ $B\rightarrow Bb\mid b$

Which one of the following grammars generates the language $ L=\left \{ a^{i}b^{j}\mid i\neq j \right \}$?$S\rightarrow AC\mid CB$$C\rightarrow aCb\mid a\mid b$$A\rightar...

Rucha Shelke

12.2k views

Rucha Shelke asked Sep 26, 2014

19 votes

2 answers

2199

GATE CSE 2006 | Question: 60
Consider the following C code segment. for (i = 0, i < n; i++) { for (j = 0; j < n; j++) { if (i%2) { x += (4*j + 5*i); y += (7 + 4*j); } } } Which one of the following is false? ... computation There is scope of common sub-expression elimination in this code There is scope of strength reduction in this code There is scope of dead code elimination in this code

Consider the following C code segment. for (i = 0, i < n; i++) { for (j = 0; j < n; j++) { if (i%2) { x += (4*j + 5*i); y += (7 + 4*j); } } }Which one of the following is...

Rucha Shelke

10.2k views

Rucha Shelke asked Sep 26, 2014

34 votes

4 answers

2200

GATE CSE 2006 | Question: 59
Consider the following translation scheme. $ S\rightarrow ER$ $ R\rightarrow *E\left \{ \text{print}(\text{ }*\text{'}); \right \} R\mid \varepsilon $ $ E\rightarrow F+E\left \{ \text{print}(\text{ }+\text{'}); \right \}\mid F $ ... $2 * 3 + 4$ $2 * +3 \ 4$ $2 \ 3 * 4 +$ $2 \ 3 \ 4+*$

Consider the following translation scheme. $ S\rightarrow ER$$ R\rightarrow *E\left \{ \text{print}(\text{‘}*\text{’}); \right \} R\mid \varepsilon $$ E\rightarrow F+...

Rucha Shelke

11.2k views

Rucha Shelke asked Sep 26, 2014

Page:

« prev
1
...
105
106
107
108
109
110
111
112
113
114
115
...
124
next »

tags	tag:apple
author	user:martin
title	title:apple
content	content:apple
exclude	-tag:apple
force match	+apple
views	views:100
score	score:10
answers	answers:2
is accepted	isaccepted:true
is closed	isclosed:true