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

Filter

Most answered questions in Compiler Design

7 votes
4 answers
103
lexical error
if there is miss spelling in some keyword in a program then this misspelled keyword will be treated as lexical errors or it will be treated as a new identifier and accepted as a token ?? ex - whiel (1) ; here while is misspelled as whiel
if there is miss spelling in some keyword in a program then this misspelled keyword will be treated as lexical errors or it will be treated as a new identifier and accept...
User Avatar
14 votes
4 answers
104
ISRO 2017-79
The output of a lexical analyzer is A parse tree Intermediate code Machine code A stream of tokens
The output of a lexical analyzer isA parse treeIntermediate codeMachine codeA stream of tokens
User Avatar
2 votes
4 answers
108
Directed acyclic graph
In questions like, when asked to find the edges or nodes in the DAG of following expression, a=a+b*c-(a+b)+(b*c) do we also consider "=" as a node and its related edges?
In questions like, when asked to find the edges or nodes in the DAG of following expression,a=a+b*c-(a+b)+(b*c)do we also consider "=" as a node and its related edges?
User Avatar
1 votes
4 answers
109
Compiler
Consider the following grammar 1)Left Recursive 2)Ambiguos 3)Left factored 4)None of these
Consider the following grammar1)Left Recursive2)Ambiguos3)Left factored4)None of these
User Avatar
3 votes
4 answers
112
#compiler
given Grammar E → E + E E → E * E E → ( E ) E → id Find set of handles and viable prefixes for the input string id1 + id2 * id3
given GrammarE → E + EE → E * EE → ( E )E → idFind set of handles and viable prefixes for the input string id1 + id2 * id3
User Avatar
16 votes
4 answers
114
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
2 votes
4 answers
117
Find if the grammar is LL(1)
Consider the grammar: S -> ab | ac Is this grammar LL(1)? My try : I tried doing the left-factoring and create the LL(1) table and found that the grammar is LL(1), but the answer is given to be not LL(1).
Consider the grammar:S - ab | acIs this grammar LL(1)?My try : I tried doing the left-factoring and create the LL(1) table and found that the grammar is LL(1), but the an...
User Avatar
2 votes
4 answers
118
grammer in compiler design
Which of the following is the most general phase-structured grammar? (a) regular (b) context-free (c) context-sensitive (d) none of the above
Which of the following is the most general phase-structured grammar?(a) regular (b) context-free(c) context-sensitive (d) none of the above
User Avatar
Page: