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}}}$$

Recent questions in Compiler Design

28 votes

6 answers

2241

GATE CSE 2002 | Question: 2.19
To evaluate an expression without any embedded function calls One stack is enough Two stacks are needed As many stacks as the height of the expression tree are needed A Turing machine is needed in the general case

To evaluate an expression without any embedded function callsOne stack is enoughTwo stacks are neededAs many stacks as the height of the expression tree are neededA Turin...

10.1k views

Kathleen asked Sep 15, 2014

20 votes

2 answers

2242

GATE CSE 2001 | Question: 18
Remove left-recursion from the following grammar: $S \rightarrow Sa \mid Sb \mid a \mid b$ Consider the following grammar: $S \rightarrow aSbS\mid bSaS \mid ∊$ Construct all possible parse trees for the string abab. Is the grammar ambiguous?

Remove left-recursion from the following grammar: $S \rightarrow Sa \mid Sb \mid a \mid b$Consider the following grammar: $S \rightarrow aSbS\mid bSaS \mid �...

3.7k views

Kathleen asked Sep 14, 2014

8 votes

1 answer

2243

GATE CSE 2001 | Question: 17
The syntax of the repeat-until statement is given by the following grammar $S \rightarrow\text{ repeat }S_1\text{ until }E$ where E stands for expressions, $S$ and $S_1$ stand for statements. The non-terminals $S$ and $S_1$ have an ... Use the operator '\\' to concatenate two strings and the function gen(s) to generate a line containing the string s.

The syntax of the repeat-until statement is given by the following grammar$S \rightarrow\text{ repeat }S_1\text{ until }E$where E stands for expressions, $S$ and $S_1$ st...

2.1k views

Kathleen asked Sep 14, 2014

23 votes

2 answers

2244

GATE CSE 2001 | Question: 16
Consider the following grammar with terminal alphabet $\Sigma =\{a,(,),+,* \}$ and start symbol $E$. The production rules of the grammar are: $ E \rightarrow aA$ $ E \rightarrow (E)$ $A \rightarrow +E$ $A \rightarrow *E$ $A \rightarrow \epsilon $ Compute the FIRST and FOLLOW sets for $E$ and $A$. Complete the LL(1) parse table for the grammar.

Consider the following grammar with terminal alphabet $\Sigma =\{a,(,),+,* \}$ and start symbol $E$. The production rules of the grammar are:$ E \rightarrow aA$$ E \right...

4.8k views

Kathleen asked Sep 14, 2014

37 votes

6 answers

2245

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...

18.1k views

Kathleen asked Sep 14, 2014

36 votes

2 answers

2246

GATE CSE 2001 | Question: 1.17
The process of assigning load addresses to the various parts of the program and adjusting the code and the data in the program to reflect the assigned addresses is called Assembly parsing Relocation Symbol resolution

The process of assigning load addresses to the various parts of the program and adjusting the code and the data in the program to reflect the assigned addresses is called...

12.6k views

Kathleen asked Sep 14, 2014

15 votes

3 answers

2247

GATE CSE 2000 | Question: 19
Consider the syntax directed translation scheme $\textsf{(SDTS)}$ ... given, without changing the grammar, to find $E.red$, the number of reductions performed while reducing an input to $E$.

Consider the syntax directed translation scheme $\textsf{(SDTS)}$ given in the following. Assume attribute evaluation with bottom-up parsing, i.e., attributes are evaluat...

8.2k views

Kathleen asked Sep 14, 2014

27 votes

6 answers

2248

GATE CSE 2000 | Question: 2.21, ISRO2015-24
Given the following expression grammar: $\begin{align} E &\to E * F \mid F + E \mid F \\[1em] F &\to F - F \mid id \end{align}$ Which of the following is true? $*$ has higher precedence than $+$ $-$ has higher precedence than $*$ $+$ and $-$ have same precedence $+$ has higher precedence than $*$

Given the following expression grammar:$$\begin{align}E &\to E * F \mid F + E \mid F \\[1em]F &\to F - F \mid id\end{align}$$Which of the following is true?$*$ has higher...

10.8k views

Kathleen asked Sep 14, 2014

22 votes

6 answers

2249

GATE CSE 2000 | Question: 1.19, UGCNET-Dec2013-II: 30
Which of the following derivations does a top-down parser use while parsing an input string? The input is scanned from left to right. Leftmost derivation Leftmost derivation traced out in reverse Rightmost derivation Rightmost derivation traced out in reverse

Which of the following derivations does a top-down parser use while parsing an input string? The input is scanned from left to right.Leftmost derivationLeftmost derivatio...

7.8k views

Kathleen asked Sep 14, 2014

41 votes

7 answers

2250

GATE CSE 2000 | Question: 1.18, ISRO2015-25
The number of tokens in the following C statement is printf("i=%d, &i=%x", i, &i); $3$ $26$ $10$ $21$

The number of tokens in the following C statement isprintf("i=%d, &i=%x", i, &i);$3$$26$$10$$21$

36.7k views

Kathleen asked Sep 14, 2014

15 votes

1 answer

2251

GATE CSE 1992 | Question: 11a
Write syntax directed definitions (semantic rules) for the following grammar to add the type of each identifier to its entry in the symbol table during semantic analysis. Rewriting the grammar is not permitted and semantic rules are to be added to the ends of productions ... $T \rightarrow \text{int}$ $T \rightarrow \text{real}$ $L \rightarrow L,id$ $L \rightarrow id$

Write syntax directed definitions (semantic rules) for the following grammar to add the type of each identifier to its entry in the symbol table during semantic analysis....

3.1k views

Kathleen asked Sep 13, 2014

17 votes

2 answers

2252

GATE CSE 1992 | Question: 03,ii
Mention the pass number for each of the following activities that occur in a two pass assembler: object code generation literals added to literal table listing printed address resolution of local symbols

Mention the pass number for each of the following activities that occur in a two pass assembler:object code generationliterals added to literal tablelisting printedaddres...

4.6k views

Kathleen asked Sep 13, 2014

7 votes

1 answer

2253

GATE CSE 1992 | Question: 3,i
Write short answers to the following: Which of the following macros can put a macro assembler into an infinite loop? .MACRO M1,X .IF EQ,X M1 X+1 .ENDC .IF NE,X .WORD X .ENDC .ENDM .MACRO M2,X .IF EQ,X M2 X .ENDC .IF NE,X .WORD X+1 .ENDC .ENDM Give an example call that does so.

Write short answers to the following:Which of the following macros can put a macro assembler into an infinite loop?.MACRO M1,X .IF EQ,X M1 X+1 .ENDC .IF NE,X .WORD X .END...

2.0k views

Kathleen asked Sep 13, 2014

44 votes

2 answers

2254

GATE CSE 1992 | Question: 02,xiv
Consider the $\text{SLR(1)}$ and $\text{LALR (1)}$ parsing tables for a context free grammar. Which of the following statement is/are true? The goto part of both tables may be different. The shift entries are identical in both the tables. The reduce entries in the tables may be different. The error entries in tables may be different

Consider the $\text{SLR(1)}$ and $\text{LALR (1)}$ parsing tables for a context free grammar. Which of the following statement is/are true?The goto part of both tables m...

14.6k views

Kathleen asked Sep 13, 2014

37 votes

1 answer

2255

GATE CSE 1992 | Question: 02,xiii
For a context free grammar, FOLLOW(A) is the set of terminals that can appear immediately to the right of non-terminal $A$ in some "sentential" form. We define two sets LFOLLOW(A) and RFOLLOW(A) by replacing the word "sentential" ... FOLLOW(A) and RFOLLOW(A) are always the same. All the three sets are identical. All the three sets are different.

For a context free grammar, FOLLOW(A) is the set of terminals that can appear immediately to the right of non-terminal $A$ in some "sentential" form. We define two sets L...

8.1k views

Kathleen asked Sep 13, 2014

16 votes

4 answers

2256

GATE CSE 1992 | Question: 01,viii
The purpose of instruction location counter in an assembler is _______

The purpose of instruction location counter in an assembler is _______

3.6k views

Kathleen asked Sep 12, 2014

7 votes

3 answers

2257

GATE CSE 1992 | Question: 01,vii
Macro expansion is done in pass one instead of pass two in a two pass macro assembler because _________

Macro expansion is done in pass one instead of pass two in a two pass macro assembler because _________

1.6k views

Kathleen asked Sep 12, 2014

19 votes

3 answers

2258

GATE CSE 1991 | Question: 10a
Consider the following grammar for arithmetic expressions using binary operators $-$ and $/$ which are not associative $E \rightarrow E -T\mid T$ $T \rightarrow T/F\mid F$ $F \rightarrow (E) \mid id$ ($E$ is the start symbol) Is the grammar ... what is the relative precedence between $-$ and $/$? If not, give an unambiguous grammar that gives $/$ precedence over $-$.

Consider the following grammar for arithmetic expressions using binary operators $-$ and $/$ which are not associative$E \rightarrow E -T\mid T$$T \rightarrow T/F\mid F$ ...

4.5k views

Kathleen asked Sep 12, 2014

27 votes

3 answers

2259

GATE CSE 1991 | Question: 09a
Consider the following pseudo-code (all data items are of type integer): procedure P(a, b, c); a := 2; c := a + b; end {P} begin x := 1; y := 5; z := 100; P(x, x*y, z); Write ('x = ', x, 'z = ', z); end Determine its output, if the parameters are passed to the Procedure $\text{P}$ by value reference name

Consider the following pseudo-code (all data items are of type integer): procedure P(a, b, c); a := 2; c := a + b; end {P} begin x := 1; y := 5; z := 100; P(x, x*y, z); W...

3.6k views

Kathleen asked Sep 12, 2014

23 votes

6 answers

2260

GATE CSE 1991 | Question: 03,x
Indicate all the true statements from the following: Recursive descent parsing cannot be used for grammar with left recursion. The intermediate form for representing expressions which is best suited for code optimization is the postfix form. A ... passing, the effect can be correctly simulated in C No feature of Pascal typing violates strong typing in Pascal.

Indicate all the true statements from the following:Recursive descent parsing cannot be used for grammar with left recursion.The intermediate form for representing expres...

7.0k views

Kathleen asked Sep 12, 2014

Page:

« prev
1
...
108
109
110
111
112
113
114
115
116
117
118
...
123
next »