Recent questions and answers in Compiler Design / GATE Overflow for GATE CSE

0 votes

0 answers

1

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)

Q4. Generate target code for the following source language statements : x = a + b + c * (d-e)

Ebrahim

17 views

Ebrahim asked 23 hours ago

0 votes

0 answers

2

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) Quadruple b) Triple c) Indirect Triple Solve the above Question like this example

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

Ebrahim

9 views

Ebrahim asked 23 hours ago

0 votes

0 answers

3

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+ else oddsum=oddsum+i;

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;

Ebrahim

9 views

Ebrahim asked 23 hours ago

0 votes

0 answers

4

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

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

Mokoena

36 views

Mokoena asked Apr 29

0 votes

0 answers

5

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

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

Mokoena

31 views

Mokoena asked Apr 29

4 votes

3 answers

6

LL(1) Grammer
S -> (L) | a L -> L . S | S Question: Make necessary changes to make it suitable for LL(1) parsing and Construct FIRST and FOLLOW sets.

S - (L) | aL - L . S | SQuestion: Make necessary changes to make it suitable for LL(1) parsing and Construct FIRST and FOLLOW sets.

akshay2508

29.1k views

akshay2508 answered Apr 27

0 votes

1 answer

7

FIRST $ FOLLOW
S -> A B A -> f S f A -> b b B d B -> Ɛ B -> c First(S) = First(A) = First(B) = Follow(S) = Follow(A) = Follow(B) =

S - A BA - f S fA - b b B dB - ƐB - cFirst(S) =First(A) =First(B) =Follow(S) =Follow(A) =Follow(B) =

AagamS_0109

125 views

AagamS_0109 answered Apr 20

0 votes

1 answer

8

FIRST & FOLLOR
S -> A B A -> f S f A -> b b B d B -> Ɛ B -> c First(S) = First(A) = First(B) = Follow(S) = Follow(A) = Follow(B) =

S - A BA - f S fA - b b B dB - ƐB - cFirst(S) =First(A) =First(B) =Follow(S) =Follow(A) =Follow(B) =

manishankarkanrar

62 views

manishankarkanrar answered Apr 19

1 votes

3 answers

9

GATE CSE 2024 | Set 2 | Question: 11
Consider the following two sets: Set $\text{X}$ Set $\text{Y}$ P. Lexical Analyzer 1. Abstract Syntax Tree Q. Syntax Analyzer 2. Token R. Intermediate Code Generator 3. Parse Tree S. Code Optimizer 4. Constant Folding Which one of the following options is the CORRECT match ... $\mathrm{P}-4 ; \mathrm{Q}-3 ; \mathrm{R}-2 ; \mathrm{S}-1$

Consider the following two sets:Set $\text{X}$Set $\text{Y}$P. Lexical Analyzer1. Abstract Syntax TreeQ. Syntax Analyzer2. TokenR. Intermediate Code Generator3. ...

nishil032

2.4k views

nishil032 answered Apr 18

47 votes

2 answers

10

GATE CSE 1994 | Question: 1.12
Generation of intermediate code based on an abstract machine model is useful in compilers because it makes implementation of lexical analysis and syntax analysis easier syntax-directed translations can be written for intermediate code generation it ... the compiler it is not possible to generate code for real machines directly from high level language programs

Generation of intermediate code based on an abstract machine model is useful in compilers becauseit makes implementation of lexical analysis and syntax analysis easiersyn...

prasantkr.singh

20.2k views

prasantkr.singh answered Mar 31

0 votes

0 answers

11

Write the quadruples, triples and indirect triples for the expression x=*y; a=&x;.

Kathir_073

71 views

Kathir_073 asked Mar 26

0 votes

0 answers

12

BARC 2024 CSE
Number of nodes in the DAG(Directed Acyclic Graph) representing (a+b)+c+(a+b)

Number of nodes in the DAG(Directed Acyclic Graph) representing (a+b)+c+(a+b)

Ayanava Dutta

182 views

Ayanava Dutta asked Mar 17

0 votes

1 answer

13

UGC NET CSE | June 2005 | Part 2 | Question: 35
Symbol Table can be used for : Checking type compatibility Suppressing duplication of error message Storage allocation All of these

Symbol Table can be used for :Checking type compatibilitySuppressing duplication of error messageStorage allocationAll of these

ajayraho

311 views

ajayraho answered Mar 1

0 votes

1 answer

14

UGC NET CSE | June 2005 | Part 2 | Question: 33
Which activity is not included in the first pass of two pass assemblers? Build the symbol table Construct the machine code Separate mnemonic opcode and operand fields. None of these

Which activity is not included in the first pass of two pass assemblers?Build the symbol tableConstruct the machine codeSeparate mnemonic opcode and operand fields.None o...

ajayraho

217 views

ajayraho answered Mar 1

0 votes

2 answers

15

UGC NET CSE | June 2005 | Part 2 | Question: 32
Which of the following is the most general phase – structured grammar ? Regular Context – Sensitive Context free None of these

Which of the following is the most general phase – structured grammar ?RegularContext – SensitiveContext freeNone of these

ajayraho

352 views

ajayraho answered Mar 1

0 votes

4 answers

16

NIELIT 2018-56
Identify the total number of tokens in the given statement printf("A%B=",&i); $7$ $8$ $9$ $13$

Identify the total number of tokens in the given statementprintf("A%B=",&i);$7$$8$$9$$13$

yadavmayank742

2.7k views

yadavmayank742 answered Feb 18

21 votes

4 answers

17

GATE CSE 2023 | Question: 1
Consider the following statements regarding the front-end and back-end of a compiler. S1: The front-end includes phases that are independent of the target hardware. S2: The back-end includes phases that are specific to the target hardware. S3: The back-end includes phases that are ... $\mathbf{S 3}$ are all TRUE. Only $\mathbf{S 1}$ and $\mathbf{S 3}$ are TRUE.

Consider the following statements regarding the front-end and back-end of a compiler.S1: The front-end includes phases that are independent of the target hardware.S2: The...

Ambike jaiswal

15.4k views

Ambike jaiswal answered Feb 18

2 votes

1 answer

18

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{array}{l} S^{\prime} \rightarrow S \\ S \rightarrow S S|A a| b A c|B c| b ... $\operatorname{GOTO}\left(I_{0}, S\right)$ is __________.

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{array}{l}S^{\prime} \r...

Hira Thakur

2.6k views

Hira Thakur answered Feb 17

0 votes

1 answer

19

GATE CSE 2024 | Set 1 | Question: 29
Consider the following pseudo-code. $L 1 : t 1 = -1$ $L 2: t 2 = 0$ $L 3: t 3 = 0$ $L 4: t 4 = 4 * t 3$ $L 5: t 5 = 4 * t 2$ $L 6: t 6 = t 5 * M$ $L 7: t 7 = t 4+t 6$ ... options CORRECTLY specifies the number of basic blocks and the number of instructions in the largest basic block, respectively? $6$ and $6$ $6$ and $7$ $7$ and $7$ $7$ and $6$

Consider the following pseudo-code.$L 1 : t 1 = -1$ $L 2: t 2 = 0$ $L 3: t 3 = 0$ $L 4: t 4 = 4 * t 3$$L 5: t 5 = 4 * t 2$$L 6: t 6 = t 5 * M$$L 7: t 7 = t 4+t 6$$L 8: t ...

Hira Thakur

2.0k views

Hira Thakur answered Feb 17

2 votes

1 answer

20

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\}$ ... blank $(4)$ blank $(1)$ $S \rightarrow B b B a$ $(2)$ $S \rightarrow A a A b$ $(3)$ blank $(4)$ blank

Consider the following context-free grammar where the start symbol is $\text{S}$ and the set of terminals is $\{a, b, c, d\}$.$$\begin{array}{l}S \rightarrow A a A b \mid...

Hira Thakur

3.1k views

Hira Thakur answered Feb 17

0 votes

1 answer

21

GATE CSE 2024 | Set 1 | Question: 28
Consider the following grammar $G$, with $S$ as the start symbol. The grammar $G$ has three incomplete productions denoted by $(1), (2)$, and $(3)$ ... $R \rightarrow c R$ (1) $S \rightarrow R f$ (2) $T \rightarrow c T$ (3) $R \rightarrow c R$

Consider the following grammar $G$, with $S$ as the start symbol. The grammar $G$ has three incomplete productions denoted by $(1), (2)$, and $(3)$.$$\begin{aligned} & S ...

Hira Thakur

1.8k views

Hira Thakur answered Feb 17

0 votes

2 answers

22

GATE CSE 2024 | Set 1 | Question: 27
Consider the following syntax-directed definition $\text{(SDD)}$. $S \rightarrow D H T U$ $ \left\{S.v a l = D.val + H.val + T.val + U.val\right\};$ $D \rightarrow ^{"} \mathrm{M}^{"} D_1$ ... the following options is the $\text{CORRECT}$ value computed by the $\text{SDD}$ (in the attribute $S.val$)? $45$ $50$ $55$ $65$

Consider the following syntax-directed definition $\text{(SDD)}$.$S \rightarrow D H T U$$ \left\{S.v a l = D.val + H.val + T.val + U.val\right\};$$D \rightarrow ^{"} \...

Hira Thakur

2.0k views

Hira Thakur answered Feb 16

0 votes

1 answer

23

GATE CSE 2024 | Set 1 | Question: 49
Let $G=(V, \Sigma, S, P)$ be a context-free grammar in Chomsky Normal Form with $\Sigma=\{a, b, c\}$ and $V$ containing $10$ variable symbols including the start symbol $S$. The string $w=a^{30} b^{30} c^{30}$ is derivable from $S$. The number of steps (application of rules) in the derivation $S \rightarrow^* w$ is __________.

Let $G=(V, \Sigma, S, P)$ be a context-free grammar in Chomsky Normal Form with $\Sigma=\{a, b, c\}$ and $V$ containing $10$ variable symbols including the start symbol $...

aniketwaghela

1.4k views

aniketwaghela answered Feb 16

2 votes

1 answer

24

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 rules have no side effects The attributes in a $\text{L}$-attributed definition ... $\text{L}$-attributed definitions based on $\text{LR(1)}$ grammar can be evaluated using a bottom-up parsing strategy

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

Sachin Mittal 1

2.7k views

Sachin Mittal 1 answered Feb 16

3 votes

1 answer

25

GATE CSE 2024 | Set 2 | Question: 33
Consider the following expression: $x[i]=(p+r) *-s[i]+u / w$. The following sequence shows the list of triples representing the given expression, with entries missing for triples $(1), (3)$, and $(6)$ ... $(1)$ [ ]$=s i \quad(3)-(0)(2) \quad(6)=[ ] x i$

Consider the following expression: $x[i]=(p+r) *-s[i]+u / w$. The following sequence shows the list of triples representing the given expression, with entries missing ...

puspeshsrivastava

1.8k views

puspeshsrivastava answered Feb 16

1 votes

1 answer

26

GATE CSE 2024 | Set 1 | Question: 16
Which of the following is/are Bottom-Up Parser(s)? Shift-reduce Parser Predictive Parser LL$(1)$ Parser LR Parser

Which of the following is/are Bottom-Up Parser(s)?Shift-reduce ParserPredictive ParserLL$(1)$ Parser LR Parser

Hira Thakur

2.2k views

Hira Thakur answered Feb 16

3 votes

1 answer

27

GATE CSE 2024 | Set 1 | Question: 23
Consider the operator precedence and associativity rules for the integer arithmetic operators given in the table below. Operator Precedence Associativity + Highest Left - High Right * Medium Right / Low Right The value of the expression $3+1+5 * 2 / 7+2-4-7-6 / 2$ as per the above rules is ________.

Consider the operator precedence and associativity rules for the integer arithmetic operators given in the table below.Operator PrecedenceAssociativity+Highest Left-HighR...

Hira Thakur

2.8k views

Hira Thakur answered Feb 16

2 votes

1 answer

28

GO Classes Test Series 2024 | Mock GATE | Test 14 | Question: 26
Which attributes in the following grammar are synthesized? A.a B.b B.x C.c

Which attributes in the following grammar are synthesized?A.aB.bB.xC.c

Chaitanya Sai

837 views

Chaitanya Sai answered Feb 6

4 votes

1 answer

29

GO Classes Test Series 2024 | Mock GATE | Test 14 | Question: 52
Consider the following given grammar and the parse tree for the sentence $x + y * z.$ The first reduction made by the shift-reduce parser is labeled as 1, and we keep labeling in the same increasing order, such that the 8th (here, the ... labeled 3. $T \rightarrow T^* P$ will be labeled 6. $T \rightarrow T^* P$ will be labeled 7.

Consider the following given grammar and the parse tree for the sentence $x + y * z.$The first reduction made by the shift-reduce parser is labeled as 1, and we keep labe...

GO Classes

320 views

GO Classes answered Feb 5

4 votes

0 answers

30

GO Classes Test Series 2024 | Mock GATE | Test 14 | Question: 53
The grammar shown below is LL(k) for some value of k. What is the smallest value of k for which this grammar is LL(k)?

The grammar shown below is LL(k) for some value of k. What is the smallest value of k for which this grammar is LL(k)?

GO Classes

943 views

GO Classes asked Feb 5

12 votes

4 answers

31

GATE CSE 2023 | Question: 27
Consider the control flow graph shown. Which one of the following choices correctly lists the set of live variables at the exit point of each basic block? $\text{B1: { }, B2: {a}, B3: {a}, B4: {a}}$ $\text{B1: {i, j}, B2: {a}, B3: {a}, B4: {i}}$ $\text{B1: {a, i, j}, B2: {a, i, j}, B3: {a, i}, B4: {a}}$ $\text{B1: {a, i, j}, B2: {a, j}, B3: {a, j}, B4: {a, i, j}}$

Consider the control flow graph shown.Which one of the following choices correctly lists the set of live variables at the exit point of each basic block?$\text{B1: { }, B...

Shreyas16

12.3k views

Shreyas16 answered Feb 3

0 votes

1 answer

32

compiler design tcompiler-design-timothy-g-griffin
6. Generate code for the following C program using any code generation algorithm. [3 Marks] main() { int x, a, b, c, d, e; x= a + b -( c + d ) * e }

6. Generate code for the following C program using any code generation algorithm. [3 Marks] main() { int x, a, b, c, d, e; ...

prasantkr.singh

176 views

prasantkr.singh answered Feb 1

3 votes

1 answer

33

GO Classes Test Series 2024 | Mock GATE | Test 13 | Question: 38
Consider the syntax-directed translation given by the following grammar and semantic rules. Here, $S$ is the only non-terminal and $\Sigma=\{0,1,2\}$ is a set of terminals. $\text{S.val}$ denotes the synthesized attribute (a ... $3$ value. The value computed by the translation scheme for the input string $201$ is $20.$

Consider the syntax-directed translation given by the following grammar and semantic rules. Here, $S$ is the only non-terminal and $\Sigma=\{0,1,2\}$ is a set of terminal...

Philosophical_Virus

567 views

Philosophical_Virus answered Jan 29

4 votes

1 answer

34

GO Classes Test Series 2024 | Mock GATE | Test 13 | Question: 39
Consider the following grammar $ \begin{aligned} & A \rightarrow B B \\ & B \rightarrow b \end{aligned} $ Suppose we draw an $\operatorname{LR}(0)$ automatan for the given grammar then which of the ... transitions There is exactly one state with $2$ incoming transitions There is exactly one state with $3$ outgoing transitions

Consider the following grammar$$\begin{aligned}& A \rightarrow B B \\& B \rightarrow b\end{aligned}$$Suppose we draw an $\operatorname{LR}(0)$ automatan for the given gra...

GO Classes

394 views

GO Classes answered Jan 28

0 votes

0 answers

35

is there something wrong in the production rules?

pcla

113 views

pcla asked Jan 27

57 votes

11 answers

36

GATE CSE 2017 Set 1 | Question: 43
Consider the following grammar: stmt $\rightarrow$ if expr then expr else expr; stmt | $Ò$ expr $\rightarrow$ term relop term | term term $\rightarrow$ id | number id $\rightarrow$ a | b | c number $\rightarrow [0-9]$ where relop is a relational ... program if $e_1$ then $e_2$ else $e_3$ has $2$ control flow paths. $e_1 \rightarrow e_2$ and $e_1 \rightarrow e_3$.

Consider the following grammar:stmt $\rightarrow$ if expr then expr else expr; stmt | $Ò$expr $\rightarrow$ term relop term | termterm $\rightarrow$ id | numberid $\righ...

rajveer43

20.6k views

rajveer43 answered Jan 25

5 votes

1 answer

37

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

GauravRajpurohit

623 views

GauravRajpurohit answered Jan 21

2 votes

1 answer

38

GO Classes Test Series 2024 | Mock GATE | Test 12 | Question: 33
Consider the following grammar: $ \begin{aligned} & S \rightarrow a S^{\prime} \\ & S^{\prime} \rightarrow b S^{\prime} \mid \epsilon \end{aligned} $ Which of the following is/are CORRECT right sentential form of the given grammar? $a b S^{\prime}$ $bS'$ $a S^{\prime} b$ $bbS$

Consider the following grammar:$$\begin{aligned}& S \rightarrow a S^{\prime} \\& S^{\prime} \rightarrow b S^{\prime} \mid \epsilon\end{aligned}$$Which of the following is...

squirrel69

502 views

squirrel69 answered Jan 21

4 votes

1 answer

39

GO Classes Test Series 2024 | Mock GATE | Test 12 | Question: 16
Consider the following context-free grammar, with start symbol $S$ and terminals $a, ; , \lt , \gt .$ $ S \rightarrow \;\lt L \mid a \qquad L \rightarrow a R \mid \;\lt L R \quad R \rightarrow\;\gt\; \mid \;; L $ How many different parse trees are there for the string $\lt \lt a \gt ;a\gt ?$

Consider the following context-free grammar, with start symbol $S$ and terminals $a, ; , \lt , \gt .$$$S \rightarrow \;\lt L \mid a \qquad L \rightarrow a R \mid \;\lt L...

GO Classes

410 views

GO Classes answered Jan 21

5 votes

1 answer

40

GO Classes Test Series 2024 | Mock GATE | Test 12 | Question: 34
$ \begin{aligned} & S \rightarrow S1 \;T \\ & S 1 \rightarrow a \mid(S S) \\ & T \rightarrow \varepsilon \mid b \;T \end{aligned} $ In the $\text{LL(1)}$ parser table, $M$ ... $\{T \rightarrow \varepsilon\}$ $\{S 1 \rightarrow a\}$ and $\{T \rightarrow \varepsilon\}$

$$\begin{aligned}& S \rightarrow S1 \;T \\& S 1 \rightarrow a \mid(S S) \\& T \rightarrow \varepsilon \mid b \;T\end{aligned}$$In the $\text{LL(1)}$ parser table, $M$, of...

GO Classes

483 views

GO Classes answered Jan 21

tags	tag:apple
author	user:martin
title	title:apple
content	content:apple
exclude	-tag:apple
force match	+apple
views	views:100
score	score:10
answers	answers:2
is accepted	isaccepted:true
is closed	isclosed:true