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

0 votes
1 answer
62
compiler design
Let P and Q be the minimum number of nodes and edges in the DAG representation of basic block respectively. Find P*Q X = Y + Z Z = X + M E = X + Y M = E – Y T = Z – M X = T + Y
Let P and Q be the minimum number of nodes and edges in the DAG representation of basic block respectively.Find P*QX = Y + ZZ = X + ME = X + YM = E – YT = Z – MX = T ...
User Avatar
0 votes
0 answers
63
viable prefix
Consider a grammar G. Given below is the sentential form of G to derive a string W = –(id + id) and E is the starting symbol of G. E -> –E E -> –(E) E -> –(E+E) E -> –(id+E) E -> –(id+id) Which of the option is not viable prefix of any sentential form?
Consider a grammar G. Given below is the sentential form of G to derive a string W = –(id + id) and E is the starting symbol of G.E - –EE - –(E)E - –(E+E)E - –(...
User Avatar
0 votes
0 answers
64
compiler design
how many handles are detected by bottom up parser for string a+a*a? grammar is E->E+T|T T->T*F|F F->a please draw the whole procedure and explain how bottom up parser does right most derivation in reverse in this question
how many handles are detected by bottom up parser for string a+a*a?grammar isE->E+T|TT->T*F|FF->aplease draw the whole procedure and explain how bottom up parser does ri...
User Avatar
0 votes
0 answers
65
compiler design
how many handles detected by bottom up parser for string a+a*a? grammar is E->E+T|T T->T*F|F F->a please draw the whole procedure and explain how bottom up parser does right most derivation in reverse in this question
how many handles detected by bottom up parser for string a+a*a?grammar isE->E+T|TT->T*F|FF->aplease draw the whole procedure and explain how bottom up parser does right m...
User Avatar
0 votes
1 answer
66
compiler design
no of tokens in b=/* /*b;
no of tokens inb=/* /*b;
User Avatar
0 votes
0 answers
67
10. Give the translation scheme that converts infix to postfix form for the following grammar. Also generate the annotated parse tree for input string 2+6+1 E-> E+T E->T T->0|1|2|3|4|5|6|7|8|9
Give the translation scheme that converts infix to postfix form for the following grammar. Also generate the annotated parse tree for input string 2+6+1E- E+TE->TT->0|1|2...
User Avatar
1 votes
2 answers
69
Unacademy Compiler Design Workbook
Conisder the following program: Main() { int x = 10; If (x<20 ; Else y = 20; } When lexical analyzer scanning the above program, how many lexical errors can be produced?
Conisder the following program:Main(){ int x = 10;If (x<20 ;Elsey = 20;}When lexical analyzer scanning the above program, how many lexical errors can be produced?
User Avatar
0 votes
0 answers
70
#self doubt
if grammar has different LMDT and RMDT, RMD and LMD can be same or different, then will it be considered like a unambiguous grammer or ambiguous ?
if grammar has different LMDT and RMDT, RMD and LMD can be same or different, then will it be considered like a unambiguous grammer or ambiguous ?
User Avatar
0 votes
1 answer
71
made easy gate cs 23 test series
Given a grammar: there is a right most derivation S1 → Sc → SAc → SaSbc. Thus, SaSbc is a right sentential form, and its handle is __
Given a grammar:there is a right most derivation S1 → Sc → SAc → SaSbc.Thus, SaSbc is a right sentential form, and its handle is __
User Avatar
0 votes
0 answers
72
made easy gate 23 test series
Consider the following grammar: 1. S → CC 2. C → cC 3. C → d The number error entries in canonical parsing table for grammar is __.
Consider the following grammar:1. S → CC2. C → cC3. C → dThe number error entries in canonical parsing table for grammar is __.
User Avatar
0 votes
1 answer
73
made easy test series
Identify the number of leaders in the following code segment:
Identify the number of leaders in the following code segment:
User Avatar
1 votes
0 answers
74
made easy gate 23 test series
The following grammer is: LALR(1) but not LR(1) LR(1) but not LALR(1) LALR(1) but not SLR(1) Neither LALR(1) nor LR(1)
The following grammer is:LALR(1) but not LR(1)LR(1) but not LALR(1)LALR(1) but not SLR(1)Neither LALR(1) nor LR(1)
User Avatar
0 votes
0 answers
75
Bottom-Up-Parser
Answer the Question with Proper Explanation…. S → Aa / bAc / dc / bda A → ε The Above Grammar is – Neither LR(0) nor SLR(1). LR(0) but not SLR(1). SLR(1) but not LR(0). Both LR(0) & SLR(1).
Answer the Question with Proper Explanation….S → Aa / bAc / dc / bdaA → ε The Above Grammar is –Neither LR(0) nor SLR(1).LR(0) but not SLR(1).SLR(1) but not LR(0...
User Avatar
0 votes
1 answer
76
Topics for Compiler design
What are the important topics for compiler design. I am going to start studying it now.
What are the important topics for compiler design. I am going to start studying it now.
User Avatar
0 votes
1 answer
80
UGC NET CSE | June 2023 | Part 2: 27
Which of the following parser is most powerful parser? Operator precedence $\text{SLR}$ Canonical $\text{LR}$ $\text{LALR}$
Which of the following parser is most powerful parser?Operator precedence$\text{SLR}$Canonical $\text{LR}$$\text{LALR}$
User Avatar
Page: