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

Recent questions in Compiler Design

21 votes
6 answers
2221
GATE CSE 1999 | Question: 1.17
Which of the following is the most powerful parsing method? LL (1) Canonical LR SLR LALR
Which of the following is the most powerful parsing method?LL (1)Canonical LRSLRLALR
User Avatar
83 votes
13 answers
2222
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 \epsilon$ and $A \rightarrow a$) to parse a string with $n$ tokens? $n/2$ $n-1$ $2n-1$ $2^{n}$
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
37 votes
4 answers
2226
GATE CSE 2005 | Question: 14
The grammar $A \rightarrow AA \mid (A) \mid \epsilon$ is not suitable for predictive-parsing because the grammar is: ambiguous left-recursive right-recursive an operator-grammar
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
32 votes
1 answer
2228
GATE CSE 2009 | Question: 17
Match all items in Group 1 with the correct options from those given in Group 2.Syntax analysis ... $\text{P-3, Q-4, R-1, S-2}$ $\text{P-2, Q-1, R-4, S-3}$
Match all items in Group 1 with the correct options from those given in Group 2.Syntax analysis$$\begin{array}{|ll|ll|}\hline \rlap{\textbf{Group 1}} & & \rlap{\textbf{Gr...
User Avatar
75 votes
8 answers
2230
GATE CSE 2007 | Question: 53
Consider the following two statements: P: Every regular grammar is LL(1) Q: Every regular set has a LR(1) grammar Which of the following is TRUE? Both P and Q are true P is true and Q is false P is false and Q is true Both P and Q are false
Consider the following two statements:P: Every regular grammar is LL(1)Q: Every regular set has a LR(1) grammarWhich of the following is TRUE?Both P and Q are trueP is tr...
User Avatar
15 votes
3 answers
2232
GATE CSE 2007 | Question: 18
Which one of the following is a top-down parser? Recursive descent parser. Operator precedence parser. An LR(k) parser. An LALR(k) parser.
Which one of the following is a top-down parser?Recursive descent parser.Operator precedence parser.An LR(k) parser.An LALR(k) parser.
User Avatar
31 votes
2 answers
2234
GATE CSE 2004 | Question: 45
Consider the grammar with the following translation rules and $E$ ... root of the parse tree for the expression:$2$ # $3$ & $5$ # $6$ & $4$ $200$ $180$ $160$ $40$
Consider the grammar with the following translation rules and $E$ as the start symbol$$\begin{array}{lll}E \rightarrow E_ 1\# \: T & \qquad\left\{E.value = E_1.value * ...
User Avatar
29 votes
2 answers
2235
GATE CSE 2004 | Question: 9
Consider a program $P$ that consists of two source modules $M_1$ and $M_2$ contained in two different files. If $M_1$ contains a reference to a function defined in $M_2$ the reference will be resolved at Edit time Compile time Link time Load time
Consider a program $P$ that consists of two source modules $M_1$ and $M_2$ contained in two different files. If $M_1$ contains a reference to a function defined in $M_2$ ...
User Avatar
32 votes
4 answers
2240
GATE CSE 2003 | Question: 59
Consider the syntax directed definition shown below. ... $t_1 = Y+Z; X=t_1$ $t_1 =Y; t_2=t_1 +Z; X=t_2$ $t_1 =Y; t_2=Z; t_3=t_1+t_2; X=t_3$
Consider the syntax directed definition shown below.$$\begin{array}{ll}S \rightarrow \mathbf{ id :=} E&\qquad \{gen(\mathbf{ id}.place = E.place;);\}\\E \rightarrow E_1 +...
User Avatar
Page: