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{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&1 & 2&1&2&1&1.67&2
\\\hline\textbf{2 Marks Count} &4&3&3 & 1 &3&2&1&2.67&4
\\\hline\textbf{Total Marks} &10&8&7 & 4&7&6&\bf{4}&\bf{7}&\bf{10}\\\hline
\end{array}}}$$

Filter

Recent questions in Compiler Design

#1
20
views
0 answers
0 votes
made easy test
Which of the following statements is/are true?A) Graph coloring is a systematic technique for allocating registers and managing register spills.B) ... resolves the shift/reduce conflict arising from the dangling-else ambiguity correctly.
User Avatar
#2
31
views
1 answers
1 votes
igate booklet question
Consider the following grammar: Prog → {S} S→ Prog X; | Y = z; X →ϵ |S Prog Y → SZ Z→id Determine follow(S) from the above grammar. (A) { } , id} (B) { }, ϵ , id} (C) { },{ id} (D ) { },{ id,ϵ }
User Avatar
#3
71
views
0 answers
1 votes
#CompilerDesign
S -> i E t S S' | aS' -> e S | ϵE -> bHow to convert this grammar to LL(1) grammar?
User Avatar
#4
82
views
0 answers
0 votes
SCOA021 TEST 1 2024
Draw a DFA and Transition table of (a|b)* abb
User Avatar
#5
115
views
0 answers
0 votes
Compiler design
directed acyclic graph(DAG)is a simplified step from the AST. Solve the following expressions by AST and DAG: X=(((a+a))+((a+a)+(a+a)))
User Avatar
#6
129
views
0 answers
0 votes
Compiler Design compiler design tcompiler-design-timothy-g-griffin
Q4. Generate target code for the following source language statements : x = a + b + c * (d-e) 
User Avatar
#7
93
views
0 answers
0 votes
Compiler Design compiler design tcompiler-design-timothy-g-griffin
Q2. Implement the statement a:= -b + c*(d-e) + f * (c*(d-e)) into following Intermediate code representation.  a) Quadrupleb) Triple c) Indirect Triple Solve the above Question like this example
User Avatar
#8
114
views
0 answers
1 votes
Compiler Design
1. Generate intermediate code for the following code segment. a) (x<y) and (y>z) and not z b) if(i%2==0)evensum=evensum+elseoddsum=oddsum+i;
User Avatar
#9
121
views
0 answers
0 votes
exam 2011
Use the semantic rules below to draw an annotated parse tree for the expression. Compute the final value. (4*2)+3+(3*3+2)n
User Avatar
#10
88
views
0 answers
0 votes
exam 2011
Use the semantic rules below to draw an annotated parse tree for the expression. Compute the final value. (4*2)+3+(3*3+2)n
User Avatar
#11
258
views
2 answers
0 votes
FIRST $ FOLLOW
S -> A BA -> f S fA -> b b B dB -> ƐB -> cFirst(S) =First(A) =First(B) =Follow(S) =Follow(A) =Follow(B) =
User Avatar
#12
185
views
2 answers
0 votes
FIRST & FOLLOR
S -> A BA -> f S fA -> b b B dB -> ƐB -> cFirst(S) =First(A) =First(B) =Follow(S) =Follow(A) =Follow(B) =
User Avatar
#14
261
views
0 answers
0 votes
BARC 2024 CSE
Number of nodes in the DAG(Directed Acyclic Graph) representing (a+b)+c+(a+b)
User Avatar
#15
2.8k
views
3 answers
1 votes
GATE CSE 2024 | Set 2 | Question: 11
Consider the following two sets:Set $\text{X}$Set $\text{Y}$P. Lexical Analyzer1. Abstract Syntax TreeQ. Syntax Analyzer2. TokenR. Intermediate Code Generator3. Parse TreeS. Code ...
User Avatar
#16
3.1k
views
1 answers
2 votes
GATE CSE 2024 | Set 2 | Question: 19
Which of the following statements is/are FALSE?An attribute grammar is a syntax-directed definition $\text{(SDD)}$ in which the functions in the semantic ... $\text{LR(1)}$ grammar can be evaluated using a bottom-up parsing strategy
User Avatar
#17
3.4k
views
1 answers
2 votes
GATE CSE 2024 | Set 2 | Question: 30
Consider the following context-free grammar where the start symbol is $\text{S}$ and the set of terminals is $\{a, b, c, d\}$ ... $(2)$ $S \rightarrow A a A b$ $(3)$ blank $(4)$ blank
User Avatar
#18
2.1k
views
1 answers
3 votes
GATE CSE 2024 | Set 2 | Question: 33
Consider the following expression: $x[i]=(p+r) *-s[i]+u / w$ ... $=s i \quad(3)-(0)(2) \quad(6)=[ ] x i$
User Avatar
#19
2.2k
views
1 answers
4 votes
GATE CSE 2024 | Set 2 | Question: 42
Consider a context-free grammar $\text{G}$ with the following $3$ rules.$S \rightarrow a S, S \rightarrow a S b S , S \rightarrow c$ Let $w \in L(G)$ ... $n_{c}(w)=n_{b}(w) * 2$
User Avatar
#20
3.0k
views
1 answers
2 votes
GATE CSE 2024 | Set 2 | Question: 55
Consider the following augmented grammar, which is to be parsed with a $\text{SLR}$ parser. The set of terminals is $\{a, b, c, d, \#, @\}$\[\begin{ ... number of items in the set $\operatorname{GOTO}\left(I_{0}, S\right)$ is __________.
User Avatar
Page: