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

17 votes
3 answers
61
GATE CSE 1989 | Question: 1-iii
Merging states with a common core may produce __________ conflicts and does not produce ___________ conflicts in an LALR parser.
Merging states with a common core may produce __________ conflicts and does not produce ___________ conflicts in an LALR parser.
User Avatar
31 votes
2 answers
62
GATE CSE 2005 | Question: 83b
Consider the following expression grammar. The semantic rules for expression evaluation are stated next to each grammar production. ... of $+$' is higher than that of $\times$', and both operators are left associative; expression is evaluated to $9$
Consider the following expression grammar. The semantic rules for expression evaluation are stated next to each grammar production.$$\begin{array}{l|l} E\rightarrow numbe...
User Avatar
24 votes
1 answer
64
GATE CSE 1990 | Question: 16a
Show that grammar $G_1$ is ambiguous using parse trees: $G_{1}: S \rightarrow$ if $S$ then $S$ else $S$ $S \rightarrow$ if $S$ then $S$
Show that grammar $G_1$ is ambiguous using parse trees:$G_{1}: S \rightarrow$ if $S$ then $S$ else $S$ $S \rightarrow$ if $S$ then $S$
User Avatar
17 votes
2 answers
66
GATE CSE 1990 | Question: 4-v
State whether the following statements are TRUE or FALSE with reason: The Link-load-and-go loading scheme required less storage space than the link-and-go loading scheme.
State whether the following statements are TRUE or FALSE with reason:The Link-load-and-go loading scheme required less storage space than the link-and-go loading scheme.
User Avatar
29 votes
3 answers
67
GATE CSE 1990 | Question: 2-ix
Match the pairs in the following questions: ...
Match the pairs in the following questions:$$\begin{array}{ll|ll} (a) & \text{Lexical analysis} & (p) & \text{DAG's} \\\hline (b) & \text{Code optimization} & (q) & \tex...
User Avatar
17 votes
3 answers
68
GATE CSE 1990 | Question: 2-v
Match the pairs in the following questions: ...
Match the pairs in the following questions:$$\begin{array}{ll|ll}\hline (a) & \text{Pointer data type} & (p) & \text{Type conversion} \\\hline (b) & \text{Activation rec...
User Avatar
15 votes
2 answers
71
GATE CSE 1987 | Question: 1-xvii
Using longer identifiers in a program will necessarily lead to: Somewhat slower compilation A program that is easier to understand An incorrect program None of the above
Using longer identifiers in a program will necessarily lead to:Somewhat slower compilationA program that is easier to understandAn incorrect programNone of the above
User Avatar
16 votes
4 answers
72
GATE CSE 1987 | Question: 1-xiv
An operator precedence parser is a Bottom-up parser. Top-down parser. Back tracking parser. None of the above.
An operator precedence parser is aBottom-up parser.Top-down parser.Back tracking parser.None of the above.
User Avatar
22 votes
3 answers
73
GATE CSE 1987 | Question: 1-xii
A context-free grammar is ambiguous if: The grammar contains useless non-terminals. It produces more than one parse tree for some sentence. Some production has two non terminals side by side on the right-hand side. None of the above.
A context-free grammar is ambiguous if:The grammar contains useless non-terminals.It produces more than one parse tree for some sentence.Some production has two non termi...
User Avatar
16 votes
2 answers
74
GATE CSE 1987 | Question: 1-xi
In a compiler the module that checks every character of the source text is called: The code generator. The code optimiser. The lexical analyser. The syntax analyser.
In a compiler the module that checks every character of the source text is called:The code generator.The code optimiser.The lexical analyser.The syntax analyser.
User Avatar
Page: