search
Log In

Web Page

Lexical analysis, Parsing, Syntax-directed translation, Runtime environments, Intermediate code generation.

$$\small{\overset{{\large{\textbf{Mark Distribution in Previous GATE}}}}{\begin{array}{|c|c|c|c|c|c|c|c|}\hline
\textbf{Year}&\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&1&1&1&1.5&2
\\\hline\textbf{2 Marks Count}&2&2&2&1&3&2&1&2&3
\\\hline\textbf{Total Marks}&6&5&6&4&7&5&\bf{4}&\bf{5.5}&\bf{6}\\\hline
\end{array}}}$$

Recent questions in Compiler Design

1 vote
1 answer
1
Which of the following is not an intermediate code form? Syntax trees Three address codes Quadrupules Post fix Notation
asked Nov 20, 2020 in Compiler Design jothee 122 views
2 votes
1 answer
2
Which of the following are applications of symbol table? Storage allocation Checking type compatibility Suppressing duplicate error messages Choose the correct answer from the options given below: $(a)$ and $(b)$ only $(a)$ and $(c)$ only $(b)$ and $(c)$ only $(a)$ $(b)$ and $(c)$
asked Nov 20, 2020 in Compiler Design jothee 79 views
0 votes
1 answer
3
Find the lexicographic ordering of the bit strings given below based on the ordering $0<1$. $001$ $010$ $011$ $0001$ $0101$ Choose the correct answer from the options given below: $001 < 010 < 011 < 0001 < 0101$ $0001 < 001 < 010 < 0101 < 011$ $0001 < 0101 < 001 < 010 < 011$ $001 < 010 < 0001 < 0101 < 011$
asked Nov 20, 2020 in Compiler Design jothee 60 views
0 votes
1 answer
4
Which of the following can be accessed by transfer vector approach of linking? External data segments External subroutines Data located in other procedure All of these
asked Apr 2, 2020 in Compiler Design Lakshman Patel RJIT 296 views
0 votes
1 answer
5
0 votes
1 answer
6
0 votes
1 answer
7
0 votes
1 answer
8
Context-free grammar can be recognized by finite state automation $2$- way linear bounded automata push down automata both (B) and (C)
asked Apr 2, 2020 in Compiler Design Lakshman Patel RJIT 178 views
0 votes
1 answer
9
Consider an $\varepsilon$-tree CFG. If for every pair of productions $A\rightarrow u$ and $A\rightarrow v$ If $\text{FIRST(u)} \cap \text{FIRST(v)}$ is empty then the CFG has to be $LL(1).$ If the CFG is $LL(1)$ then $\text{FIRST(u)} \cap \text{FIRST(v)}$ has to be empty. Both $(A)$ and $(B)$ None of the above
asked Apr 1, 2020 in Compiler Design Lakshman Patel RJIT 253 views
1 vote
2 answers
11
In a single pass assembler, most of the forward references can be avoided by putting the restriction on the number of strings/lifereacts. that the data segment must be defined after the code segment. on unconditional rump. that the data segment be defined before the code segment.
asked Mar 31, 2020 in Compiler Design Lakshman Patel RJIT 466 views
0 votes
2 answers
12
A linker is given object module for a set of programs that were compiled separately. What information need not be included in an object module? Object mode Relocation bits Names and locations of all external symbols defined in the object module. Absolute addresses of internal symbols.
asked Mar 31, 2020 in Compiler Design Lakshman Patel RJIT 247 views
1 vote
3 answers
13
The identification of common sub-expression and replacement of run time computations by compile-time computations is: Local optimization Constant folding Loop Optimization Data flow analysis
asked Mar 31, 2020 in Compiler Design Lakshman Patel RJIT 373 views
0 votes
1 answer
14
0 votes
1 answer
15
0 votes
4 answers
16
0 votes
1 answer
17
0 votes
5 answers
18
0 votes
2 answers
19
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\to\epsilon$ and $A \to a)$ to parse a string with $n$ tokens? $n/2$ $n-1$ $2n-1$ $2^n$
asked Mar 30, 2020 in Compiler Design Lakshman Patel RJIT 260 views
0 votes
5 answers
20
...