Register

Web Page

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

Filter

Previous GATE Questions in Compiler Design

#161
4.0k
views
2 answers
22 votes
GATE CSE 1998 | Question: 22
An identifier in a programming language consists of up to six letters and digits of which the first character must be a letter. Derive a regular expression for the identi...
User Avatar
#162
4.5k
views
4 answers
12 votes
GATE CSE 1998 | Question: 14
Let $G_1 = (N, T, P, S_1)$ be a CFG where, $N=\{S_1, A, B\},T=\{a, b\}$ and $P$ is given by$$\begin{array}{l|l}S_1 \rightarrow a S_1 b &S_1 \rightarrow a B b \\S_1 \right...
User Avatar
#163
7.2k
views
2 answers
26 votes
GATE CSE 1998 | Question: 6b
Consider the grammarS $\rightarrow Aa \mid b$A $\rightarrow Ac \mid Sd \mid \epsilon$Construct an equivalent grammar with no left recursion and with minimum number of pr...
User Avatar
#164
9.0k
views
1 answers
28 votes
GATE CSE 1998 | Question: 2.15
Faster access to non-local variables is achieved using an array of pointers to activation records called a stackheapdisplayactivation tree
User Avatar
#165
6.0k
views
2 answers
18 votes
GATE CSE 1998 | Question: 1.28
A linker reads four modules whose lengths are $200, 800, 600$ and $500$ words, respectively. If they are loaded in that order, what are the relocation constants?$0, 200, ...
User Avatar
#166
14.2k
views
2 answers
46 votes
GATE CSE 1998 | Question: 1.27
Type checking is normally done duringlexical analysissyntax analysissyntax directed translationcode optimization
User Avatar
#167
12.9k
views
2 answers
24 votes
GATE CSE 1998 | Question: 1.26
Which of the following statements is true?SLR parser is more powerful than LALRLALR parser is more powerful than Canonical LR parserCanonical LR parser is more powerful t...
User Avatar
#168
9.6k
views
3 answers
26 votes
GATE CSE 1998 | Question: 1.25, ISRO2008-41
In a resident – OS computer, which of the following systems must reside in the main memory under all situations?AssemblerLinkerLoaderCompiler
User Avatar
#169
29.0k
views
5 answers
36 votes
GATE CSE 2013 | Question: 48
The following code segment is executed on a processor which allows only register operands in its instructions. Each instruction can have atmost two source operands and on...
User Avatar
#170
13.5k
views
4 answers
53 votes
GATE CSE 2013 | Question: 40
Consider the following two sets of $\textsf{LR(1)}$ items of an $\textsf{LR(1)}$ grammar.$$\begin{array}{l|l}X \rightarrow c.X, c∕d &X → c.X, \$\\X \rightarrow .cX, c...
User Avatar
#171
6.0k
views
1 answers
13 votes
GATE CSE 1999 | Question: 15
What will be the output of the following program assuming that parameter passing iscall by valuecall by referencecall by copy restoreprocedure P{x, y, z}; begin y:y+1; z:...
User Avatar
#172
1.8k
views
0 answers
2 votes
GATE CSE 1999 | Question: 9
Let synthesized attribute val give the value of the binary number generated by S in the following grammar. For example, on input 101.101, S.val = 5.625.$S \rightarrow L.L...
User Avatar
#173
9.9k
views
2 answers
28 votes
GATE CSE 1999 | Question: 2.15
A grammar that is both left and right recursive for a non-terminal, isAmbiguousUnambiguousInformation is not sufficient to decide whether it is ambiguous or unambiguousNo...
User Avatar
#174
7.2k
views
4 answers
5 votes
GATE CSE 1999 | Question: 2.14
The number of tokens in the FORTRAN statement DO 10 I = 1.25 is345None of the above
User Avatar
#175
23.7k
views
6 answers
21 votes
GATE CSE 1999 | Question: 1.17
Which of the following is the most powerful parsing method?LL (1)Canonical LRSLRLALR
User Avatar
#176
35.7k
views
13 answers
83 votes
GATE CSE 2013 | Question: 9
What is the maximum number of reduce moves that can be taken by a bottom-up parser for a grammar with no epsilon and unit-production (i.e., of type $A \rightarrow \epsilo...
User Avatar
#177
20.9k
views
7 answers
56 votes
GATE CSE 2005 | Question: 83a
Statement for Linked Answer Questions 83a & 83b:Consider the following expression grammar. The semantic rules for expression evaluation are stated next to each grammar pr...
User Avatar
#178
15.8k
views
2 answers
24 votes
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 ...
User Avatar
#179
16.8k
views
5 answers
34 votes
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 + ...
User Avatar
#180
24.0k
views
4 answers
37 votes
GATE CSE 2005 | Question: 14
The grammar $A \rightarrow AA \mid (A) \mid \epsilon$ is not suitable for predictive-parsing because the grammar is:ambiguousleft-recursiveright-recursivean operator-gram...
User Avatar
Page: