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

Hot questions in Compiler Design

0 votes
1 answer
86
see Dragon Book 3.9, pp.173, pp . 179)
How to minimize a DFA ? How to convert RE to DFA directly?
How to minimize a DFA ?How to convert RE to DFA directly?
User Avatar
0 votes
1 answer
87
Compiler-design
Q1. For the following grammar N -> AB | BA A -> a | CAC B -> b | CBC C -> a | b Find the FIRST and FOLLOW
Q1. For the following grammar N - AB | BA A - a | CAC B - b | CBC C - a | b Find the FIRST and FOLLOW
User Avatar
37 votes
6 answers
89
GATE CSE 2001 | Question: 1.18
Which of the following statements is false? An unambiguous grammar has same leftmost and rightmost derivation An LL(1) parser is a top-down parser LALR is more powerful than SLR An ambiguous grammar can never be LR(k) for any k
Which of the following statements is false?An unambiguous grammar has same leftmost and rightmost derivationAn LL(1) parser is a top-down parserLALR is more powerful than...
User Avatar
0 votes
1 answer
90
Compilers: Principles, Techniques, and Tools by ALFRED Aho
Find the minimum number of total variables in SSA form: a = b + m m = a + e d = b + m b = a + e
Find the minimum number of total variables in SSA form:a = b + mm = a + ed = b + mb = a + e
User Avatar
1 votes
3 answers
91
Made Easy Test Series - Compiler Design
$\text{ Find $\textbf{First(A)}$ and $\textbf{Follow(B)}$ }?$
$\text{ Find $\textbf{First(A)}$ and $\textbf{Follow(B)}$ }?$
User Avatar
0 votes
0 answers
92
compiler-design-timothy-g-griffin
Find the FIRST and FOLLOW of the grammar to check whether it is LL (1) parser or not. N → AB | BA A → a | CAC B → b | CBC C → a | b
Find the FIRST and FOLLOW of the grammar to check whether it is LL (1) parser or not. N → AB | BA A → a | CAC B → b | CBC C → a | b
User Avatar
29 votes
4 answers
94
GATE CSE 2014 Set 2 | Question: 18
Which one of the following is NOT performed during compilation? Dynamic memory allocation Type checking Symbol table management Inline expansion
Which one of the following is NOT performed during compilation?Dynamic memory allocationType checkingSymbol table managementInline expansion
User Avatar
0 votes
1 answer
95
Made Easy Test Series Question
Consider the following C code: d=a+b e=a-b f=c+d g=c-e a=f+g b=f-g c=d+e The minimum number of total variables required to convert the above code segment to static single assignment form is? Ans given is 7 but how
Consider the following C code:d=a+be=a-bf=c+dg=c-ea=f+gb=f-gc=d+eThe minimum number of total variables required to convert the above code segment to static single assignm...
User Avatar
0 votes
0 answers
97
GATE PYQ
S := 0 i := 1 L1: if i > n goto L2 t := i * i S := S + t i := i + 1 goto L1 L2: return S what is Control FLow Graph for this and GEN KILL for all BB ?
S := 0i := 1L1: if i n goto L2t := i * iS := S + ti := i + 1goto L1L2: return S what is Control FLow Graph for this and GEN KILL for all BB ?
User Avatar
24 votes
3 answers
99
GATE CSE 2010 | Question: 14
Which languages necessarily need heap allocation in the runtime environment? Those that support recursion. Those that use dynamic scoping. Those that allow dynamic data structure. Those that use global variables.
Which languages necessarily need heap allocation in the runtime environment?Those that support recursion.Those that use dynamic scoping.Those that allow dynamic data stru...
User Avatar
0 votes
1 answer
100
Compiler Design
Like Example Above please answer this question Q5. Implement a+b*(c+d)-e/f into: a). Quadruples. b). Triples. c). Indirect triples.
Like Example Above please answer this questionQ5. Implement a+b*(c+d)-e/finto: a). Quadruples.b). Triples.c). Indirect triples.
User Avatar
Page: