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

31 votes
2 answers
101
1 votes
3 answers
103
Consider the following grammar , and test whether the grammar is LL(1) or not.S → 1AB | ∈A → 1AC | 0CB → OSC → 1
5 votes
1 answer
104
31 votes
2 answers
106
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 * ...
3 votes
1 answer
110
Given a flow graph with 10 nodes, 13 edges and one connected components, the number of regions and the number of predicate (decision) nodes in the flow graph will be4, 55...
12 votes
5 answers
114
Recursive descent parsing is an example ofTop-down parsersBottom-up parsersPredictive parsersNone of the above
35 votes
4 answers
120
The attribute of three arithmetic operators in some programming language are given below.$$\begin{array}{|c|l|}\hline \textbf{OPERATOR} & \textbf{PRECEDENCE} & \textbf{...