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|c|c|c|c|c|c|}\hline \textbf{Year}& \textbf{2026 - 1}& \textbf{2026 - 2}& \textbf{2025 - 1}& \textbf{2025 - 2}& \textbf{2024 - 1}& \textbf{2024 - 2}& \textbf{2023}& \textbf{2022}& \textbf{2021 - 1}& \textbf{2021 - 2}&\textbf{Minimum}&\textbf{Average}&\textbf{Maximum}\\\hline \textbf{1 Mark Count}&2&2&2&2&2&2&1&2&1&2&1&1.8&2\\\hline \textbf{2 Marks Count}&2&2&2&2&4&3&3&1&3&2&1&2.4&4\\\hline \textbf{Total Marks}&6&6&6&6&10&8&7&4&7&6&\bf{4}&\bf{6.6}&\bf{10}\\\hline \end{array}}}$$

Questions without answers in Compiler Design

1 1 vote
0 0 answers
141
141 views
We know that the class of languages of LR(0), SLR(1), LALR(1), CLR(1) is the class of DCFLs, with the only exception being that...An LR(0) language is a DCFL that has the...
0 0 votes
0 0 answers
90
90 views
 
0 0 votes
0 0 answers
284
284 views
like for S- . (S) look ahead is \$ For but S- .a look ahead should be \$ | )
0 0 votes
0 0 answers
149
149 views
Isnt this answer wrongI4 stateC - d., a | d there shouldnt be any $https://gateoverflow.in/?qa=blob&qa_blobid=5254677790122576834
0 0 votes
0 0 answers
663
663 views
Consider a pipelined processor in which the execution (EX) stage is shared by all instructions. The execution stage takes different different time for different instruct...
0 0 votes
0 0 answers
480
480 views
Consider the given control flow graph.Which of the following options correctly lists the set of redundant expressions (common sub-expressions) in the basic blocks B4 and ...
0 0 votes
0 0 answers
132
132 views
0 0 votes
0 0 answers
344
344 views
What is the use and def in basic block 2 and basic block 3 .
1 1 vote
0 0 answers
178
178 views
For the grammar below, a partial LL(1) parsing table is also presented along with the grammar. Entries that are need to be filled are indicated as E1, E2, and E3.A ->Bb |...
0 0 votes
0 0 answers
297
297 views
Consider the following Three Address code sample for solving the questions:$\begin{array}{lll}100 & : & t1= y+2 \\ 101 & : & \text{initial} = x/t1 \\ 102 &: & \text{limit...
0 0 votes
0 0 answers
221
221 views
$\mathrm{y}_{\mathrm{acc}}$ is which of the following parsers?Predictive Parser$\text{SLR}$ Parser$\text{CLR}$ Parser$\text{LALR}$ Parser
0 0 votes
0 0 answers
216
216 views
Regarding the code optimization, choose the correct sequenceAlgebraic SimplificationUse of machine idiomsRedundant - instruction eliminationFlow of control optimizationIm...
0 0 votes
0 0 answers
270
270 views
A program that is used by other routines to accomplish a particular task, is called :Micro programMicro operationRoutineSubroutine
2 2 votes
0 0 answers
196
196 views
Consider a Grammar $\mathrm{E} \rightarrow \mathrm{E}+\mathrm{n}\mid \mathrm{E} \times \mathrm{n} \mid \mathrm{n}$ for a sentence $\mathrm{n}+\mathrm{n} \times \mathrm{n}...
1 1 vote
0 0 answers
222
222 views
Match List - I with List - II according to input to the compiler phase that process it:$$\begin{array}{lll} & \text{List - I} & \text{List - II} \\\text{(A)} & \text...
0 0 votes
0 0 answers
276
276 views
Arrange the following phases of a compiler as per their order of execution (start to end)Target code generationSyntax AnalysisCode optimizationSemantic AnalysisLexical An...
0 0 votes
0 0 answers
437
437 views
0 0 votes
0 0 answers
126
126 views
Which of the following is true for the $\text{LL(1)}$ parsing method?It uses left recursion in its grammarIt can be used for all context-free languagesIt requires a look-...
0 0 votes
0 0 answers
189
189 views
Consider the if . . else grammar, G: S' - S S - iSE | S - a E ->eS | E - λ then a. G is ambiguous because FIRST(eS) ∩ FOLLOW(E) = Φ b. G is ambiguous because E has t...
0 0 votes
0 0 answers
163
163 views
Consider the following context-free grammar:S → Ab | Ac | dc | bda A → dSteps: Define LL(1) grammar and its properties.Determine if the grammar is LL(1) by calculating t...
0 0 votes
0 0 answers
131
131 views
Construct an LR(1) parsing table for the following grammar:S → E E → E + T | T T → T * F | F F → (E) | idExplain the concept of LR(1) parsing and its use.Compute the a...
0 0 votes
0 0 answers
561
561 views
Eliminate left Recursion from the following Grammar: S->AB, A->BS|b, B->SA|a
0 0 votes
0 0 answers
172
172 views
Find the FIRST and FOLLOW for the following grammar:E- (L)B | aL - L,E | EaE - dL | fDo we eliminate left recursion before finding first and follow if not how should we d...
0 0 votes
0 0 answers
326
326 views
1 1 vote
0 0 answers
368
368 views
The following program uses six temporary variables p, q, r, s, tand u. The code is:p=6q=7t=p*qs=t +pu=8u=s* ps =p +ur=r*qt =t +preturn tAssuming that all operations take ...
1 1 vote
0 0 answers
849
849 views
Consider the following simple context-free grammars: Grammar G₁ Grammar G2 Grammar G3S → AA → εA → bbA S → AA → εA → bAb S → AA → εA → Abb  The start symbols are S, the n...
1 1 vote
0 0 answers
260
260 views
Determine the types and relative addresses for the identifiers in the following sequence of declarations:float x;record {float x; float y;}p;record {int tag; float x; flo...
0 0 votes
0 0 answers
378
378 views
1) i=1 2) j=1 3) t1=5*I 4) t2=t1+j 5) t3=4*t2 6) t4=t3 7) a[t4]=-1 8) j=j+1 9) if (j<=5) goto 3 10) i=i+1 11) if (i<5) goto 2 finding leader and basic block
0 0 votes
0 0 answers
239
239 views
To see more, click for the full list of questions or popular tags.