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 answered questions in Compiler Design

60 votes
7 answers
24
The minimum number of arithmetic operations required to evaluate the polynomial $P(X) = X^5+4X^3+6X+5$ for a given value of $X$, using only one temporary variable is ____...
41 votes
7 answers
28
0 votes
6 answers
30
Context-free grammar can be recognized by finite state automation$2$- way linear bounded automatapush down automataboth (B) and (C)
4 votes
6 answers
31
1 votes
6 answers
34
Consider the following grammar G:$S\rightarrow AB\mid d$$A\rightarrow aA\mid b$$B\rightarrow bB\mid c$The grammar G is:LL (1) grammar and not LR (0)LL (1) and LR (0)Not L...
7 votes
6 answers
35
Which of the following statements is true?Every LL(1) grammar is LALR(1).Every LL(1) grammar is CLR(1). AS I think 2nd is True and 1st is False if I am wrong please let ...
2 votes
6 answers
36
Consider the following grammar$S\rightarrow Aa\mid B $$B\rightarrow a\mid BC$$C \rightarrow a\mid \in$the no of productions in simplified cfg is
21 votes
6 answers
39
Which of the following is the most powerful parsing method?LL (1)Canonical LRSLRLALR