Recent questions tagged compiler-design / GATE Overflow for GATE CSE

2 votes

2 answers

1621

UGC NET CSE | December 2014 | Part 3 | Question: 19
Consider the following statements $S1, S2$ and $S3$: $S1$: In call-by-value, anything that is passed into a function call is unchanged in the caller's scope when the function returns. $S2$: In call-by-reference, a function receives implicit reference to a ... $S3$ and $S1$ are true. $S2$ and $S1$ are true. $S1, S2, S3$ are true.

Consider the following statements $S1, S2$ and $S3$:$S1$: In call-by-value, anything that is passed into a function call is unchanged in the caller’s scope when the fun...

makhdoom ghaya

2.9k views

makhdoom ghaya asked Jul 25, 2016

2 votes

1 answer

1622

If a is a terminal and S, A, B are three non-terminals, then which of the following are regular grammars?(a) S → ε, A → aS|b(b) A → aB|a, B → bA|b(c) A → Ba|Ba...

vkm07

3.7k views

vkm07 asked Jul 23, 2016

3 votes

3 answers

1623

Compiler Design LR(0) Checking
Is E --> E+T / T , T --> i is LR(0) grammar ?

Is E E+T / T , T i is LR(0) grammar ?

Raveen Sharma

2.4k views

Raveen Sharma asked Jul 23, 2016

1 votes

1 answer

1624

Parse trees
How will we treat the given two parse trees..? Are they same i.e one is has been derived using lmd n other using rmd or they both will be treated as two diffent parse trees concluding it as ambiguous.. Only with reference to the string 'b' otherwise i know its ambiguous...

How will we treat the given two parse trees..? Are they same i.e one is has been derived using lmd n other using rmd or they both will be treated as two diffent parse tr...

Chetnawadhwa

1.5k views

Chetnawadhwa asked Jul 22, 2016

1 votes

1 answer

1625

UGC NET CSE | December 2014 | Part 2 | Question: 32
Which of the following is true ? Canonical $LR$ parser is $LR (1)$ parser with single look ahead terminal All $LR(K)$ parsers with $K > 1$ can be transformed into $LR(1)$ parsers. Both $(A)$ and $(B)$ None of the above

Which of the following is true ?Canonical $LR$ parser is $LR (1)$ parser with single look ahead terminalAll $LR(K)$ parsers with $K 1$ can be transformed into $LR(1)$ pa...

makhdoom ghaya

2.9k views

makhdoom ghaya asked Jul 22, 2016

2 votes

1 answer

1626

UGC NET CSE | December 2014 | Part 2 | Question: 31
Shift-Reduce parsers perform the following : Shift step that advances in the input stream by $K(K > 1)$ symbols and Reduce step that applies a completed grammar rule to some recent parse trees, joining them together as one tree ... does not advance in the input stream and Reduce step that applies a completed grammar rule to form a single tree.

Shift-Reduce parsers perform the following : Shift step that advances in the input stream by $K(K 1)$ symbols and Reduce step that applies a completed grammar rule to so...

makhdoom ghaya

2.0k views

makhdoom ghaya asked Jul 22, 2016

1 votes

2 answers

1627

compiler design
Let G be a context-free grammar where G = ({S, A, B, C}, {a, b, d}, P, S) with the productions in P given below. S → ABAC A → aA ∣ ε B → bB ∣ ε C → d (ε denotes the null string). Transform the grammar G to an equivalent context-free grammar G′ that has no ε productions and no unit productions. (A unit production is of the form x → y, and x and y are non terminals).

Let G be a context-free grammar where G = ({S, A, B, C}, {a, b, d}, P, S) with the productions in P given below.S → ABACA → aA ∣ εB → bB ∣ εC → d(ε denotes...

anshul namdeo

3.2k views

anshul namdeo asked Jul 20, 2016

1 votes

1 answer

1628

Veii impp Doubt in Compiler design
What is the difference between Compiler , Assembler and Interpreter in simple words ? ( what i understand is that Compiler is like a translator which converts HLL (which is input to compiler) into either Machine code or Assembly code. Please help and tell me please ?

What is the difference between Compiler , Assembler and Interpreter in simple words ?( what i understand is that Compiler is like a translator which converts HLL (which i...

LavTheRawkstar

510 views

LavTheRawkstar asked Jul 18, 2016

4 votes

1 answer

1629

Why Conditional Control Statements are Executes slower in case of Interpreter ?

himanich

434 views

himanich asked Jul 16, 2016

1 votes

1 answer

1630

UGC NET CSE | June 2013 | Part 2 | Question: 23
The equivalent production rules corresponding to the production rules $S \rightarrow S \alpha_1 \mid S \alpha_2 \mid \beta_1 \mid \beta_2$ is $S \rightarrow \beta_1 \mid \beta_2, A \rightarrow \alpha_1 A \mid \alpha_2 A \mid \lambda$ ...

The equivalent production rules corresponding to the production rules $S \rightarrow S \alpha_1 \mid S \alpha_2 \mid \beta_1 \mid \beta_2$ is$S \rightarrow \beta_1 \mid \...

go_editor

3.9k views

go_editor asked Jul 14, 2016

3 votes

1 answer

1631

UGC NET CSE | June 2013 | Part 2 | Question: 21
Given the production rules of a grammar G1 as $S_1 \rightarrow AB \mid aaB$ $A \rightarrow a \mid Aa$ $B \rightarrow b$ and the production rules of a grammar G2 as $S_2 \rightarrow aS_2bS_2 \mid bS_2 aS_2 \mid \lambda$ Which ... G1 is ambiguous and G2 is ambiguous G1 is not ambiguous and G2 is ambiguous G1 is not ambiguous and G2 is not ambiguous

Given the production rules of a grammar G1 as$S_1 \rightarrow AB \mid aaB$$A \rightarrow a \mid Aa$$B \rightarrow b$and the production rules of a grammar G2 as$S_2 \right...

go_editor

3.6k views

go_editor asked Jul 14, 2016

1 votes

2 answers

1632

What is the number of terminal strings generated by given context-free grammar ?
S→ A 0B A→ BB|0 B →AA|1 What is the number of terminal strings of length 5 generated by the context-free grammar shown above? 4 5 6 7

S→ A 0BA→ BB|0B →AA|1What is the number of terminal strings of length 5 generated by the context-free grammar shown above?4567

sh!va

1.1k views

sh!va asked Jul 12, 2016

1 votes

2 answers

1633

UGC NET CSE | December 2012 | Part 2 | Question: 27
Which of the following is true while converting CFG to an LL(1) grammar? Removing left recursion alone Factoring the grammar alone Removing left recursion and factoring the grammar None of the above

Which of the following is true while converting CFG to an LL(1) grammar?Removing left recursion aloneFactoring the grammar aloneRemoving left recursion and factoring the ...

Arjun

5.9k views

Arjun asked Jul 10, 2016

2 votes

5 answers

1634

UGC NET CSE | December 2012 | Part 2 | Question: 18
Given the following expressions of a grammar $E \rightarrow E * F / F + E / F$ $F \rightarrow F – F / id$ Which of the following is true? $*$ has the higher precedence than + - has the higher precedence than $*$ + and – have same precedence + has the higher precedence than $*$

Given the following expressions of a grammar$E \rightarrow E * F / F + E / F$$F \rightarrow F – F / id$Which of the following is true?$*$ has the higher precedence ...

go_editor

2.0k views

go_editor asked Jul 8, 2016

2 votes

3 answers

1635

UGC NET CSE | June 2012 | Part 3 | Question: 73
In which file the compiler manage various objects, which are used in windows programming? Control File Binary File Text File Obj File

In which file the compiler manage various objects, which are used in windows programming?Control FileBinary FileText FileObj File

go_editor

1.4k views

go_editor asked Jul 8, 2016

0 votes

1 answer

1636

Kerala_PSC If a grammar is LALR(1)
If a grammar is LALR(1), then it is necessarily, a. LR(1) b. SLR(1) c. LL(0) d. LL(1)

If a grammar is LALR(1), then it is necessarily,a. LR(1)b. SLR(1)c. LL(0)d. LL(1)

sh!va

3.5k views

sh!va asked Jul 7, 2016

8 votes

2 answers

1637

ISRO2016-43
A simple two-pass assembler does which of the following in the first pass: Checks to see if the instructions are legal in the current assembly mode It allocates space for the literals. It builds the symbol table for the symbols and their values. All of these

A simple two-pass assembler does which of the following in the first pass:Checks to see if the instructions are legal in the current assembly modeIt allocates space for t...

Arjun

3.9k views

Arjun asked Jul 6, 2016

12 votes

5 answers

1638

ISRO2016-40
Recursive descent parsing is an example of Top-down parsers Bottom-up parsers Predictive parsers None of the above

Recursive descent parsing is an example ofTop-down parsersBottom-up parsersPredictive parsersNone of the above

go_editor

10.5k views

go_editor asked Jul 6, 2016

2 votes

0 answers

1639

Among these language which is/are Context free Language and has Context Free Grammar ?
Among these languages which is/are Context free Language and has Context Free Grammar ? please Explain the reason a little bit . 1 .LISP 2 .C-Language 3 .C++ Language 4 .Cobol

Among these languages which is/are Context free Language and has Context Free Grammar ? please Explain the reason a little bit .1 .LISP2 .C-Language3 .C++ Language4 .Cobo...

shekhar chauhan

745 views

shekhar chauhan asked Jul 5, 2016

5 votes

3 answers

1640

ISRO2016-41
A top-down parser generates Rightmost Derivation Rightmost derivation in reverse Leftmost derivation Leftmost derivation in reverse

A top-down parser generatesRightmost DerivationRightmost derivation in reverseLeftmost derivationLeftmost derivation in reverse

habedo007

12.0k views

habedo007 asked Jul 5, 2016

10 votes

2 answers

1641

ISRO2016-44
Peephole optimization is form of Loop optimization Local optimization Constant folding Data flow analysis

Peephole optimization is form ofLoop optimizationLocal optimizationConstant foldingData flow analysis

ManojK

11.9k views

ManojK asked Jul 4, 2016

0 votes

1 answer

1642

What will be the output from YACC?
E → number | E '+' E | E '×' E This grammar is fed to a YACC tool for parsing. What will be the output for expression 3×2+1? /* How to solve this? please explain*/

E → number | E '+' E | E '×' E This grammar is fed to a YACC tool for parsing.What will be the output for expression 3×2+1? /* How to solve this? please explain*...

sh!va

659 views

sh!va asked Jul 1, 2016

8 votes

4 answers

1643

ISRO2014-52
Consider the following grammar. $S \rightarrow AB$ $A \rightarrow a$ $A \rightarrow BaB$ $B \rightarrow bbA$ Which of the following statements is FALSE? The length of every string produced by this grammar is even No string produced by this grammar has three ... $B$ is always odd No string produced by this grammar has four consecutive $b's$

Consider the following grammar.$S \rightarrow AB$$A \rightarrow a$$A \rightarrow BaB$$B \rightarrow bbA$Which of the following statements is FALSE?The length of every ...

go_editor

6.5k views

go_editor asked Jul 1, 2016

24 votes

1 answer

1644

CAN Inherently ambiguous languages HAVE DETERMINISTIC CONTEXT FREE GRAMMARS?
DANGLING ELSE PROBLEM: S->iEtSS' / a S'->∊/ eS E->b is a Deterministic context free grammar, and is ambiguous for "iEtiEtSeS" but ALL DCFG ARE UNAMBIGUOUS . so " how can this DCFG be ambiguous?"

DANGLING ELSE PROBLEM:S->iEtSS' / aS'->∊/ eS E->b is a Deterministic context free grammar, and is ambiguous for "iEtiEtSeS" but ALL DCFG ARE UNAMBIGUOUS . so " how c...

Harsh Tripathi

4.7k views

Harsh Tripathi asked Jun 30, 2016

0 votes

1 answer

1645

tokens
which of following symbols made as token by depending on next symbol? a=b>c<d#

which of following symbols made as token by depending on next symbol?a=b>c<d#

Naveen Chowdary 1

817 views

Naveen Chowdary 1 asked Jun 29, 2016

2 votes

1 answer

1646

Compiler Construction
Consider the following code which computes the inner product of 2 vectors: prod := 0; i := 1; repeat { prod := prod + a[i] * b[i] i = i+1; until i >20 } Below is possible IR for this program : 1) prod := 0 2) i :=1 3) t1 :=4*i 4) ... i+1 11) i :=t7 12) if i<=20 goto (3) 13) .. Create Basic Blocks and the control Flow Graph and also show any Optimizatioions.If you Find.

Consider the following code which computes the inner product of 2 vectors:prod := 0;i := 1;repeat{prod := prod + a[i] * b[i]i = i+1;until i >20}Below is possible IR for t...

LavTheRawkstar

4.4k views

LavTheRawkstar asked Jun 27, 2016

1 votes

3 answers

1647

Compiler Design
Consider the following grammar , and test whether the grammar is LL(1) or not. S → 1AB | ∈ A → 1AC | 0C B → OS C → 1

Consider the following grammar , and test whether the grammar is LL(1) or not.S → 1AB | ∈A → 1AC | 0CB → OSC → 1

LavTheRawkstar

11.5k views

LavTheRawkstar asked Jun 27, 2016

1 votes

1 answer

1648

Compiler Gate
Construct DAG for [a+a * (b-c) + [ (b-c) + d ].

Construct DAG for[a+a * (b-c) + [ (b-c) + d ].

LavTheRawkstar

1.2k views

LavTheRawkstar asked Jun 27, 2016

1 votes

2 answers

1649

Gate Compiler Design
Consider the following grammar E → E+T/T T → T*F/F F → id/(E) Calculate Lead and Last for every Non terminal.

Consider the following grammarE → E+T/TT → T*F/FF → id/(E)Calculate Lead and Last for every Non terminal.

LavTheRawkstar

6.8k views

LavTheRawkstar asked Jun 27, 2016

0 votes

1 answer

1650

in compiler technology reduction in strength means

parvati h

2.8k views

parvati h asked Jun 25, 2016

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