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

Recent questions in Compiler Design

5 votes
1 answer
21
GO Classes Test Series 2024 | Mock GATE | Test 12 | Question: 2
Consider the following grammar- ... $\text{Follow(T)}$ are same. $\operatorname{First}(\mathrm{A})$ and $\operatorname{First}(\mathrm{T})$ are same.
Consider the following grammar-$$\begin{aligned}& S \rightarrow b T \\& T \rightarrow A b \mid B a \\& A \rightarrow a S \mid C B \\& B \rightarrow b D \\& C \rightarrow ...
User Avatar
0 votes
1 answer
25
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
4 votes
1 answer
29
GO Classes Test Series 2024 | Mock GATE | Test 11 | Question: 54
Consider the following grammar given below. ... the last character of the string: $a^* b($ $\operatorname{CC}($ $\mathrm{BC}($ $\mathrm{CB}$ $\mathrm{BB}$
Consider the following grammar given below.$$\begin{aligned}& A \rightarrow B+A \\& A \rightarrow B \\& B \rightarrow C B \\& B \rightarrow C \\& C \rightarrow D^* \\& C ...
User Avatar
0 votes
1 answer
30
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
0 votes
0 answers
31
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
0 votes
1 answer
33
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
0 votes
0 answers
34
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
0 votes
1 answer
36
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
1 answer
37
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
0 votes
1 answer
38
compiler Design
Please Answer this question 4. Discuss design issues in code generation. Generate target code for the following basic block. t1 : = a + b t2 : = c + d t3 : = e - t2 t4 : = t1 - t3
Please Answer this question 4. Discuss design issues in code generation. Generate target code for the following basic block. t1 : = a + b t2 : = c ...
User Avatar
0 votes
1 answer
40
Compiler Design: Timothy G. Griffin
3. Consider the grammar T → R | aTc R → € | RbR i). Give a leftmost and rightmost derivation of aabbbcc. ii). Is the grammar ambiguous? Justify your answer.
3. Consider the grammar T → R | aTc R → € | RbR i). Give a leftmost and rightmost derivation of aabbbcc. ii). Is the grammar ambiguous? Justify your answe...
User Avatar
Page: