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}}}$$

Most viewed questions in Compiler Design

50 votes

3 answers

GATE CSE 2009 | Question: 42
Which of the following statements are TRUE? There exist parsing algorithms for some programming languages whose complexities are less than $\Theta(n^3)$ A programming language which allows recursion can be implemented with static storage allocation. No L-attributed ... both source language and intermediate code level. I and II I and IV III and IV I, III and IV

Which of the following statements are TRUE?There exist parsing algorithms for some programming languages whose complexities are less than $\Theta(n^3)$A programming langu...

Kathleen

18.5k views

Kathleen asked Sep 22, 2014

38 votes

3 answers

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

Kathleen

18.3k views

Kathleen asked Oct 8, 2014

37 votes

6 answers

GATE CSE 2001 | Question: 1.18
Which of the following statements is false? An unambiguous grammar has same leftmost and rightmost derivation An LL(1) parser is a top-down parser LALR is more powerful than SLR An ambiguous grammar can never be LR(k) for any k

Which of the following statements is false?An unambiguous grammar has same leftmost and rightmost derivationAn LL(1) parser is a top-down parserLALR is more powerful than...

Kathleen

18.1k views

Kathleen asked Sep 14, 2014

20 votes

4 answers

GATE CSE 2019 | Question: 43
Consider the augmented grammar given below: $S’ \rightarrow S$ $S \rightarrow \langle L \rangle \mid id$ $L \rightarrow L, S \mid S$ Let $I_0 = \text{CLOSURE} (\{[S’ \rightarrow \cdot S ]\}).$ The number of items in the set $\text{GOTO} (I_0, \langle \: )$ is______

Consider the augmented grammar given below:$S’ \rightarrow S$$S \rightarrow \langle L \rangle \mid id$$L \rightarrow L, S \mid S$Let $I_0 = \text{CLOSURE} (\{[S’ \rig...

Arjun

17.7k views

Arjun asked Feb 7, 2019

42 votes

3 answers

GATE CSE 2012 | Question: 53
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, $ ... $ E2 : B \rightarrow S, S \rightarrow \varepsilon$ $ E3 : B \rightarrow S$

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

go_editor

17.5k views

go_editor asked Apr 21, 2016

21 votes

7 answers

GATE CSE 2021 Set 2 | Question: 3
Consider the following $\text{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? Lexical analyzer Syntax analyzer Semantic analyzer Machine dependent optimizer

Consider the following $\text{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?Lex...

Arjun

17.4k views

Arjun asked Feb 18, 2021

44 votes

3 answers

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.3k views

go_editor asked Sep 29, 2014

44 votes

1 answer

GATE CSE 1995 | Question: 1.14
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? Object code Relocation bits Names and locations of all external symbols defined in the object module Absolute addresses of internal symbols

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?Object codeRelocation bitsN...

Kathleen

16.8k views

Kathleen asked Oct 8, 2014

21 votes

6 answers

GATE CSE 2019 | Question: 36
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$ ... $X_1=T, \: X_2=L, \: X_3=T, \: X_4 = L_1$

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

Arjun

16.6k views

Arjun asked Feb 7, 2019

51 votes

4 answers

GATE CSE 2003 | Question: 76
Which of the following is NOT an advantage of using shared, dynamically linked libraries as opposed to using statistically linked libraries? Smaller sizes of executable files Lesser overall page fault rate in the system Faster program startup Existing programs need not be re-linked to take advantage of newer versions of libraries

Which of the following is NOT an advantage of using shared, dynamically linked libraries as opposed to using statistically linked libraries?Smaller sizes of executable fi...

Kathleen

16.4k views

Kathleen asked Sep 17, 2014

34 votes

5 answers

GATE CSE 2005 | Question: 59
Consider the grammar: $E \rightarrow E + n \mid E \times n \mid n$ For a sentence $n + n \times n$, the handles in the right-sentential form of the reduction are: $n, E + n$ and $E + n \times n$ $n, E + n$ and $E + E \times n$ $n, n + n$ and $n + n \times n$ $n, E + n$ and $E \times n$

Consider the grammar:$$E \rightarrow E + n \mid E \times n \mid n$$For a sentence $n + n \times n$, the handles in the right-sentential form of the reduction are:$n, E + ...

Kathleen

16.4k views

Kathleen asked Sep 22, 2014

37 votes

3 answers

GATE CSE 2008 | Question: 55
An LALR(1) parser for a grammar G can have shift-reduce (S-R) conflicts if and only if The SLR(1) parser for G has S-R conflicts The LR(1) parser for G has S-R conflicts The LR(0) parser for G has S-R conflicts The LALR(1) parser for G has reduce-reduce conflicts

An LALR(1) parser for a grammar G can have shift-reduce (S-R) conflicts if and only ifThe SLR(1) parser for G has S-R conflictsThe LR(1) parser for G has S-R conflictsThe...

Kathleen

15.9k views

Kathleen asked Sep 12, 2014

8 votes

3 answers

Finding type of Grammar LL(1), OR LR(0) , OR CLR(1) OR LALR(1)
Suppose we are given a grammar and asked to find the type of that grammar , what is the algorithm which needs to be followed for each of them? LL(1), OR LR(0) , OR CLR(1) OR LALR(1)

Suppose we are given a grammar and asked to find the type of that grammar , what is the algorithm which needs to be followed for each of them? LL(1), OR LR(0) , OR CLR(1...

Parshu gate

15.5k views

Parshu gate asked Nov 13, 2017

24 votes

2 answers

GATE CSE 2005 | Question: 60
Consider the grammar: $S \rightarrow (S) \mid a$ Let the number of states in SLR (1), LR(1) and LALR(1) parsers for the grammar be $n_1, n_2$ and $n_3$ respectively. The following relationship holds good: $n_1 < n_2 < n_3$ $n_1 = n_3 < n_2$ $n_1 = n_2 = n_3$ $n_1 \geq n_3 \geq n_2$

Consider the grammar:$$S \rightarrow (S) \mid a$$Let the number of states in SLR (1), LR(1) and LALR(1) parsers for the grammar be $n_1, n_2$ and $n_3$ respectively. The ...

Kathleen

15.5k views

Kathleen asked Sep 22, 2014

41 votes

6 answers

GATE CSE 2008 | Question: 12
Some code optimizations are carried out on the intermediate code because They enhance the portability of the compiler to the target processor Program analysis is more accurate on intermediate code than on machine code The information from ... analysis cannot otherwise be used for optimization The information from the front end cannot otherwise be used for optimization

Some code optimizations are carried out on the intermediate code becauseThey enhance the portability of the compiler to the target processorProgram analysis is more accur...

Kathleen

15.4k views

Kathleen asked Sep 11, 2014

45 votes

5 answers

GATE CSE 2015 Set 3 | Question: 31
Consider the following grammar G $S \rightarrow F \mid H$ $F \rightarrow p \mid c$ $H \rightarrow d \mid c$ Where $S$, $F$, and $H$ are non-terminal symbols, $p, d$, and $c$ are terminal symbols. Which of the following statement(s) ... grammar G S2: LR(1) can parse all strings that are generated using grammar G Only S1 Only S2 Both S1 and S2 Neither S1 and S2

Consider the following grammar G$S \rightarrow F \mid H$$F \rightarrow p \mid c$$H \rightarrow d \mid c$ Where $S$, $F$, and $H$ are non-terminal symbols, $p, d$, and $c...

go_editor

15.3k views

go_editor asked Feb 15, 2015

21 votes

4 answers

GATE CSE 2023 | Question: 1
Consider the following statements regarding the front-end and back-end of a compiler. S1: The front-end includes phases that are independent of the target hardware. S2: The back-end includes phases that are specific to the target hardware. S3: The back-end includes phases that are ... $\mathbf{S 3}$ are all TRUE. Only $\mathbf{S 1}$ and $\mathbf{S 3}$ are TRUE.

Consider the following statements regarding the front-end and back-end of a compiler.S1: The front-end includes phases that are independent of the target hardware.S2: The...

admin

15.3k views

admin asked Feb 15, 2023

3 votes

1 answer

Three address code invloves
Three address code invloves exactly 3 addresses at most 3 addresses at least 3 addresses No unary opeartors

Three address code invlovesexactly 3 addressesat most 3 addressesat least 3 addressesNo unary opeartors

sh!va

15.1k views

sh!va asked Jun 23, 2016

49 votes

7 answers

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.0k views

go_editor asked Sep 29, 2014

30 votes

5 answers

GATE CSE 2004 | Question: 2,ISRO2017-54
Consider the following function void swap(int a, int b) { int temp; temp = a; a = b; b = temp; } In order to exchange the values of two variables $x$ and $y$. call $swap(x, y)$ call $swap(\&x, \&y)$ $swap (x, y)$ cannot be used as it does not return any value $swap (x, y)$ cannot be used as the parameters are passed by value

Consider the following functionvoid swap(int a, int b) { int temp; temp = a; a = b; b = temp; }In order to exchange the values of two variables $x$ and $y$.call $swap(x, ...

Kathleen

14.7k views

Kathleen asked Sep 18, 2014

Page:

« prev
1
2
3
4
5
6
7
8
...
123
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