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{2022} & \textbf{2021-1}&\textbf{2021-2}&\textbf{2020}&\textbf{2019}&\textbf{2018}&\textbf{2017-1}&\textbf{2017-2}&\textbf{2016-1}&\textbf{2016-2}&\textbf{Minimum}&\textbf{Average}&\textbf{Maximum}
\\\hline\textbf{1 Mark Count} & 2&1&2&2&2&1&2&2&1&1&1&1.6&2
\\\hline\textbf{2 Marks Count} & 1 &3&2&1&2&2&2&1&3&2&1&1.9&3
\\\hline\textbf{Total Marks} & 4&7&6&4&6&5&6&4&7&5&\bf{4}&\bf{5.4}&\bf{7}\\\hline
\end{array}}}$$

Recent questions in Compiler Design

38 votes

3 answers

2201

GATE CSE 1995 | Question: 1.10
Consider a grammar with the following productions $S \rightarrow a \alpha b \mid b \alpha c \mid aB$ $S \rightarrow \alpha S\mid b$ $S \rightarrow \alpha b b\mid ab$ $S \alpha \rightarrow bd b\mid b$ The above grammar is: Context free Regular Context sensitive $LR(k)$

Consider a grammar with the following productions$S \rightarrow a \alpha b \mid b \alpha c \mid aB$$S \rightarrow \alpha S\mid b$$S \rightarrow \alpha b b\mid ab$$...

18.2k views

Kathleen asked Oct 8, 2014

5 votes

0 answers

2202

GATE CSE 1994 | Question: 23
Suppose we have a computer with single register and only three instructions given below: ... $T \rightarrow (E)\mid id$ Write a syntax directed translation to generate code using this grammar for the computer described above.

Suppose we have a computer with single register and only three instructions given below:$$\begin{array}{ll} \text{LOAD addren} & \text{; load register} \\ \text{} & \te...

1.0k views

Kathleen asked Oct 5, 2014

16 votes

3 answers

2203

GATE CSE 1994 | Question: 20
A grammar $G$ is in Chomsky-Normal Form (CNF) if all its productions are of the form $A \to BC$ or $A \to a$, where $A,B$ and $C$, are non-terminals and $a$ is a terminal. Suppose $G$ is a CFG in CNF and $w$ is a string in $L(G)$ of length $n$, then how long is a derivation of $w$ in $G$?

A grammar $G$ is in Chomsky-Normal Form (CNF) if all its productions are of the form $A \to BC$ or $A \to a$, where $A,B$ and $C$, are non-terminals and $a$ is a terminal...

5.0k views

Kathleen asked Oct 5, 2014

19 votes

2 answers

2204

GATE CSE 1994 | Question: 18a
State whether the following statements are True or False with reasons for your answer A subroutine cannot always be used to replace a macro in an assembly language program.

State whether the following statements are True or False with reasons for your answerA subroutine cannot always be used to replace a macro in an assembly language program...

3.0k views

Kathleen asked Oct 5, 2014

12 votes

2 answers

2205

GATE CSE 1994 | Question: 17a
State whether the following statements are True or False with reasons for your answer: Coroutine is just another name for a subroutine.

State whether the following statements are True or False with reasons for your answer:Coroutine is just another name for a subroutine.

2.7k views

Kathleen asked Oct 5, 2014

24 votes

4 answers

2206

GATE CSE 1994 | Question: 3.5
Match the following items ...

Match the following items$$\begin{array}{ll|ll}\hline \text{(i)} & \text{Backus-Naur form} & \text{(a)} & \text{Regular expressions} \\\hline \text{(ii)} & \text{Lexical...

5.4k views

Kathleen asked Oct 4, 2014

36 votes

3 answers

2207

GATE CSE 1994 | Question: 1.18
Which of the following features cannot be captured by context-free grammars? Syntax of if-then-else statements Syntax of recursive procedures Whether a variable has been declared before its use Variable names of arbitrary length

Which of the following features cannot be captured by context-free grammars?Syntax of if-then-else statementsSyntax of recursive proceduresWhether a variable has been dec...

10.0k views

Kathleen asked Oct 4, 2014

47 votes

2 answers

2208

GATE CSE 1994 | Question: 1.12
Generation of intermediate code based on an abstract machine model is useful in compilers because it makes implementation of lexical analysis and syntax analysis easier syntax-directed translations can be written for intermediate code generation it ... the compiler it is not possible to generate code for real machines directly from high level language programs

Generation of intermediate code based on an abstract machine model is useful in compilers becauseit makes implementation of lexical analysis and syntax analysis easiersyn...

20.0k views

Kathleen asked Oct 4, 2014

40 votes

2 answers

2209

GATE CSE 2010 | Question: 38
The grammar $ S \to aSa \mid bS \mid c$ is LL(1) but not LR(1) LR(1) but not LL(1) Both LL(1) and LR(1) Neither LL(1) nor LR(1)

The grammar $ S \to aSa \mid bS \mid c$ is LL(1) but not LR(1)LR(1) but not LL(1)Both LL(1) and LR(1)Neither LL(1) nor LR(1)

12.9k views

go_editor asked Sep 30, 2014

64 votes

7 answers

2210

GATE CSE 2010 | Question: 37
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 + e return d + f Assuming that all operations take their operands from registers, what is the minimum number of registers needed to execute this program without spilling? $2$ $3$ $4$ $6$

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 + e return d + fAssuming tha...

21.8k views

go_editor asked Sep 30, 2014

11 votes

3 answers

2211

GATE CSE 1993 | Question: 26
A stack is used to pass parameters to procedures in a procedure call. If a procedure $P$ has two parameters as described in procedure definition: procedure P (var x :integer; y: integer); and if $P$ is called by ; $P(a, b)$ State precisely in a ... $b$ In the generated code for the body of procedure $P$, how will the addressing of formal parameters $x$ and $y$ differ?

A stack is used to pass parameters to procedures in a procedure call.If a procedure $P$ has two parameters as described in procedure definition:procedure P (var x :intege...

3.0k views

Kathleen asked Sep 29, 2014

7 votes

2 answers

2212

GATE CSE 1993 | Question: 25
A simple Pascal like language has only three statements. assignment statement e.g. x:=expression loop construct e.g. for i:=expression to expression do statement sequencing e.g. begin statement ; ; statement end Write a context-free grammar (CFG) for statements in ... CFG. Show the parse tree for the following statements: for j:=2 to 10 do begin x:=expr1; y:=expr2; end

A simple Pascal like language has only three statements.assignment statement e.g. x:=expressionloop construct e.g. for i:=expression to expression do statementsequencing ...

1.5k views

Kathleen asked Sep 29, 2014

14 votes

2 answers

2213

GATE CSE 1993 | Question: 7.7
A part of the system software which under all circumstances must reside in the main memory is: text editor assembler linker loader none of the above

A part of the system software which under all circumstances must reside in the main memory is:text editorassemblerlinkerloadernone of the above

6.4k views

Kathleen asked Sep 29, 2014

27 votes

2 answers

2214

GATE CSE 1993 | Question: 7.6
A simple two-pass assembler does the following in the first pass: It allocates space for the literals. It computes the total length of the program. It builds the symbol table for the symbols and their values. It generates code for all the load and store register instructions. None of the above.

A simple two-pass assembler does the following in the first pass:It allocates space for the literals.It computes the total length of the program.It builds the symbol tabl...

19.8k views

Kathleen asked Sep 29, 2014

4 votes

1 answer

2215

GATE CSE 1997 | Question: 23
The language $L,$ defined by the following grammar, allows use of real or integer data in expressions and assignment statements. <assign-stmt> :: <LHS> := <E> <E> ::= <E> + <T>|<T> <T> :: ... that the name and type of variable can be obtained by making the function calls' give_name $(id)$ and give_type $(id)$ respectively.

The language $L,$ defined by the following grammar, allows use of real or integer data in expressions and assignment statements.<assign-stmt :: <LHS := <E <E ::...

1.4k views

Kathleen asked Sep 29, 2014

25 votes

4 answers

2216

GATE CSE 1997 | Question: 11
Consider the grammar $S \rightarrow bSe$ $S \rightarrow PQR$ $P \rightarrow bPc$ $P \rightarrow \varepsilon$ $Q \rightarrow cQd$ $Q \rightarrow \varepsilon$ $R \rightarrow dRe$ $R \rightarrow \varepsilon$ where $S, P, Q, R$ ... $i, j, k, m$? Find the smallest string that has two parse trees.

Consider the grammar$S \rightarrow bSe$$S \rightarrow PQR$$P \rightarrow bPc$$P \rightarrow \varepsilon$$Q \rightarrow cQd$$Q \rightarrow \varepsilon$$R \rightarrow dRe...

6.5k views

Kathleen asked Sep 29, 2014

24 votes

2 answers

2217

GATE CSE 1997 | Question: 4.9
The expression $( a * b) * c \; op \dots$ where ‘op’ is one of ‘$+$’, ‘$*$’ and ‘$\uparrow$’ (exponentiation) can be evaluated on a CPU with single register without storing the value of ($a * b$) if $\text{‘op’}$ is ‘$+$’ or ‘$*$’ $\text{‘op’}$ is ‘$\uparrow$’ or ‘$*$’ $\text{‘op’}$ is ‘$\uparrow$’ or ‘$+$’ not possible to evaluate without storing

The expression $( a * b) * c \; op \dots$where ‘op’ is one of ‘$+$’, ‘$*$’ and ‘$\uparrow$’ (exponentiation) can be evaluated on a CPU with single registe...

5.0k views

Kathleen asked Sep 29, 2014

19 votes

4 answers

2218

GATE CSE 1997 | Question: 1.10
Heap allocation is required for languages. that support recursion that support dynamic data structure that use dynamic scope rules None of the above

Heap allocation is required for languages.that support recursionthat support dynamic data structurethat use dynamic scope rulesNone of the above

7.2k views

Kathleen asked Sep 29, 2014

16 votes

2 answers

2219

GATE CSE 1997 | Question: 1.9
The conditional expansion facility of macro processor is provided to test a condition during the execution of the expanded program to expand certain model statements depending upon the value of a condition during the execution of the expanded ... recursion to expand certain model statements depending upon the value of a condition during the process of macro expansion

The conditional expansion facility of macro processor is provided totest a condition during the execution of the expanded programto expand certain model statements depend...

5.1k views

Kathleen asked Sep 29, 2014

17 votes

2 answers

2220

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...

4.7k views

Kathleen asked Sep 29, 2014

Page:

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