Recent questions tagged compiler-design

3 votes

1 answer

331

UGC NET CSE | October 2020 | Part 2 | Question: 41
Which of the following are applications of symbol table? Storage allocation Checking type compatibility Suppressing duplicate error messages Choose the correct answer from the options given below: $\text{(i)}$ and $\text{(ii)}$ only $\text{(i)}$ and $\text{(iii)}$ only ... $\text{(iii)}$ only $\text{(i)}$ $\text{(ii)}$ and $\text{(iii)}$

Which of the following are applications of symbol table?Storage allocationChecking type compatibilitySuppressing duplicate error messagesChoose the correct answer from th...

2.4k views

go_editor asked Nov 20, 2020

3 votes

1 answer

332

UGC NET CSE | October 2020 | Part 2 | Question: 74
Find the lexicographic ordering of the bit strings given below based on the ordering $0<1$. $001$ $010$ $011$ $0001$ $0101$ Choose the correct answer from the options given below: $001 < 010 < 011 < 0001 < 0101$ ... $0001 < 0101 < 001 < 010 < 011$ $001 < 010 < 0001 < 0101 < 011$

Find the lexicographic ordering of the bit strings given below based on the ordering $0<1$.$001$$010$$011$$0001$$0101$Choose the correct answer from the options given bel...

1.7k views

go_editor asked Nov 20, 2020

0 votes

2 answers

333

NIELIT 2016 MAR Scientist C - Section C: 9
Which of the following can be accessed by transfer vector approach of linking? External data segments External subroutines Data located in other procedure All of these

Which of the following can be accessed by transfer vector approach of linking?External data segmentsExternal subroutinesData located in other procedureAll of these

894 views

admin asked Apr 2, 2020

0 votes

2 answers

334

NIELIT 2016 MAR Scientist C - Section C: 10
Relocation bits used by relocating loader are specified by Relocating loader itself Linker Assembler Macro processor

Relocation bits used by relocating loader are specified byRelocating loader itselfLinkerAssemblerMacro processor

1.1k views

admin asked Apr 2, 2020

1 votes

1 answer

335

NIELIT 2016 MAR Scientist C - Section C: 11
The most powerful parser is $\text{SLR}$ $\text{LALR}$ Canonical $\text{LR}$ Operator-precedence

The most powerful parser is$\text{SLR}$$\text{LALR}$Canonical $\text{LR}$Operator-precedence

1.7k views

admin asked Apr 2, 2020

1 votes

1 answer

336

NIELIT 2016 MAR Scientist C - Section C: 12
$\text{YACC}$ builds up $\text{SLR}$ parsing table Canonical $\text{LR}$ parsing table $\text{LALR}$ parsing table None of these

$\text{YACC}$ builds up$\text{SLR}$ parsing tableCanonical $\text{LR}$ parsing table$\text{LALR}$ parsing tableNone of these

1.3k views

admin asked Apr 2, 2020

0 votes

6 answers

337

NIELIT 2016 MAR Scientist C - Section C: 13
Context-free grammar can be recognized by finite state automation $2$- way linear bounded automata push down automata both (B) and (C)

Context-free grammar can be recognized by finite state automation$2$- way linear bounded automatapush down automataboth (B) and (C)

6.2k views

admin asked Apr 2, 2020

0 votes

1 answer

338

NIELIT 2017 OCT Scientific Assistant A (CS) - Section B: 10
Consider an $\varepsilon$-tree CFG. If for every pair of productions $A\rightarrow u$ and $A\rightarrow v$ If $\text{FIRST(u)} \cap \text{FIRST(v)}$ is empty then the CFG has to be $LL(1).$ If the CFG is $LL(1)$ then $\text{FIRST(u)} \cap \text{FIRST(v)}$ has to be empty. Both $(A)$ and $(B)$ None of the above

Consider an $\varepsilon$-tree CFG. If for every pair of productions $A\rightarrow u$ and $A\rightarrow v$If $\text{FIRST(u)} \cap \text{FIRST(v)}$ is empty then the CFG ...

3.2k views

admin asked Apr 1, 2020

4 votes

4 answers

339

NIELIT 2017 OCT Scientific Assistant A (CS) - Section B: 11
Synthesized attribute can easily be simulated by an LL grammar ambiguous grammar LR grammar none of the above

Synthesized attribute can easily be simulated by anLL grammarambiguous grammarLR grammarnone of the above

1.3k views

admin asked Apr 1, 2020

1 votes

2 answers

340

NIELIT 2016 MAR Scientist B - Section C: 31
In a single pass assembler, most of the forward references can be avoided by putting the restriction on the number of strings/lifereacts. that the data segment must be defined after the code segment. on unconditional rump. that the data segment be defined before the code segment.

In a single pass assembler, most of the forward references can be avoided by putting the restrictionon the number of strings/lifereacts.that the data segment must be defi...

1.5k views

admin asked Mar 31, 2020

1 votes

2 answers

341

NIELIT 2016 MAR Scientist B - Section C: 32
A linker is given object module for a set of programs that were compiled separately. What information need not be included in an object module? Object mode Relocation bits Names and locations of all external symbols defined in the object module. Absolute addresses of internal symbols.

A linker is given object module for a set of programs that were compiled separately. What information need not be included in an object module?Object modeRelocation bitsN...

1.1k views

admin asked Mar 31, 2020

4 votes

3 answers

342

NIELIT 2016 DEC Scientist B (CS) - Section B: 14
The identification of common sub-expression and replacement of run time computations by compile-time computations is: Local optimization Constant folding Loop Optimization Data flow analysis

The identification of common sub-expression and replacement of run time computations by compile-time computations is:Local optimizationConstant foldingLoop OptimizationDa...

4.5k views

admin asked Mar 31, 2020

0 votes

1 answer

343

NIELIT 2016 DEC Scientist B (CS) - Section B: 22
The structure or format of data is called Syntax Struct Semantic none of the above

The structure or format of data is calledSyntaxStructSemanticnone of the above

1.6k views

admin asked Mar 31, 2020

0 votes

1 answer

344

NIELIT 2016 DEC Scientist B (CS) - Section B: 36
The graph that shows basic blocks and their successor relationship is called: DAG Control graph Flow graph Hamiltonian graph

The graph that shows basic blocks and their successor relationship is called:DAGControl graphFlow graphHamiltonian graph

1.7k views

admin asked Mar 31, 2020

1 votes

4 answers

345

NIELIT 2016 DEC Scientist B (CS) - Section B: 40
A top down parser generates Left most derivation Right most derivation Left most derivation in reverse Right most derivation in reverse

A top down parser generatesLeft most derivationRight most derivationLeft most derivation in reverseRight most derivation in reverse

1.1k views

admin asked Mar 31, 2020

0 votes

1 answer

346

NIELIT 2016 DEC Scientist B (CS) - Section B: 43
Syntax directed translation scheme is desirable because It is based on the syntax It is easy to modify Its description is independent of any implementation All of these

Syntax directed translation scheme is desirable becauseIt is based on the syntaxIt is easy to modifyIts description is independent of any implementationAll of these

3.2k views

admin asked Mar 31, 2020

4 votes

6 answers

347

NIELIT 2016 DEC Scientist B (CS) - Section B: 57
The output of lexical analyzer is: A set of regular expressions Strings of character Syntax tree Set of tokens

The output of lexical analyzer is:A set of regular expressionsStrings of characterSyntax treeSet of tokens

1.9k views

admin asked Mar 31, 2020

1 votes

2 answers

348

NIELIT 2017 July Scientist B (CS) - Section B: 47
What is the maximum number of reduce moves that can be taken by a bottom-up parser for a grammar with no epsilon and unit production (i.e.,of type $A\to\epsilon$ and $A \to a)$ to parse a string with $n$ tokens? $n/2$ $n-1$ $2n-1$ $2^n$

What is the maximum number of reduce moves that can be taken by a bottom-up parser for a grammar with no epsilon and unit production (i.e.,of type $A\to\epsilon$ and $A \...

1.0k views

admin asked Mar 30, 2020

2 votes

5 answers

349

NIELIT 2017 July Scientist B (CS) - Section B: 49
In a compiler, keywords of a language are recognized during parsing of the program the code generation the lexical analysis of the program dataflow analysis

In a compiler, keywords of a language are recognized duringparsing of the programthe code generationthe lexical analysis of the programdataflow analysis

2.1k views

admin asked Mar 30, 2020

0 votes

1 answer

350

NIELIT 2017 July Scientist B (CS) - Section B: 57
A system program that combines the separately complied modules of a program into a form suitable for execution assembler linking loader cross compiler load and go

A system program that combines the separately complied modules of a program into a form suitable for executionassemblerlinking loadercross compilerload and go

776 views

admin asked Mar 30, 2020

2 votes

4 answers

351

NIELIT 2017 DEC Scientist B - Section B: 5
Which of the following is machine independent optimization? Loop optimization Redundancy Elimination Folding All of the option

Which of the following is machine independent optimization?Loop optimizationRedundancy EliminationFoldingAll of the option

9.0k views

admin asked Mar 30, 2020

0 votes

1 answer

352

NIELIT 2017 DEC Scientist B - Section B: 26
The grammar $S\rightarrow aSb\mid bSa\mid SS\mid \varepsilon $ is: Unambiguous CFG Ambiguous CFG Not a CFG Deterministic CFG

The grammar $S\rightarrow aSb\mid bSa\mid SS\mid \varepsilon $ is:Unambiguous CFGAmbiguous CFGNot a CFGDeterministic CFG

1.3k views

admin asked Mar 30, 2020

2 votes

1 answer

353

NIELIT 2017 DEC Scientist B - Section B: 33
Which of the following statements is/are false? $S1$: $LR(0)$ grammar and $SLR(1)$ grammar are equivalent $S2$: $LR(1)$ grammar are subset of $LALR(1)$ grammars $S1$ only $S1$ and $S2$ both $S2$ only None of the options

Which of the following statements is/are false?$S1$: $LR(0)$ grammar and $SLR(1)$ grammar are equivalent$S2$: $LR(1)$ grammar are subset of $LALR(1)$ grammars$S1$ only$S1...

2.9k views

admin asked Mar 30, 2020

1 votes

1 answer

354

NIELIT 2017 DEC Scientist B - Section B: 42
The optimization phase in a compiler generally Reduces the space of the code Optimizes the code to reduce execution time Both (A) and (B) Neither (A) nor (B)

The optimization phase in a compiler generallyReduces the space of the codeOptimizes the code to reduce execution timeBoth (A) and (B)Neither (A) nor (B)

1.9k views

admin asked Mar 30, 2020

1 votes

1 answer

355

NIELIT 2017 DEC Scientist B - Section B: 54
Which of the following statements is/are true in the context of interpreters? $S1$: Interpreters process program according to the logical flow of control through the program. $S2$: Interpreter translates and executes the error-free first instruction before it goes to the second. ... . Only $S1$ Only $S3$ Only $S1$, $S2$ and $S3$ Only $S1$, $S2$ and $S4$

Which of the following statements is/are true in the context of interpreters?$S1$: Interpreters process program according to the logical flow of control through the progr...

1.5k views

admin asked Mar 30, 2020

1 votes

1 answer

356

UGC NET CSE | December 2006 | Part 2 | Question: 34
The ‘K’ in LR (K) cannot be : $0$ $1$ $2$ None of these

The ‘K’ in LR (K) cannot be :$0$$1$$2$None of these

2.5k views

go_editor asked Mar 27, 2020

1 votes

1 answer

357

UGC NET CSE | December 2006 | Part 2 | Question: 35
Peer-hole optimization is a form of : loop optimization local optimization constant folding data flow analysis

Peer-hole optimization is a form of :loop optimizationlocal optimizationconstant foldingdata flow analysis

1.3k views

go_editor asked Mar 27, 2020

0 votes

1 answer

358

UGC NET CSE | December 2005 | Part 2 | Question: 32
A Top - down Parse generates Left most derivation Right – most derivation Right most derivation in reverse Left – most derivation in reverse

A Top - down Parse generatesLeft most derivationRight – most derivationRight most derivation in reverseLeft – most derivation in reverse

419 views

go_editor asked Mar 27, 2020

0 votes

1 answer

359

UGC NET CSE | December 2005 | Part 2 | Question: 35
Which activities is not included in the first pass of two pass assembler? build the symbol table construct the Intermediate code separate memonic opcode and operand field. none of these

Which activities is not included in the first pass of two pass assembler?build the symbol tableconstruct the Intermediate codeseparate memonic opcode and operand field.no...

518 views

go_editor asked Mar 27, 2020

2 votes

1 answer

360

UGC NET CSE | June 2006 | Part 2 | Question: 4
The logic of pumping lemma is a good example of : pigeon hole principle recursion divide and conque technique iteration

The logic of pumping lemma is a good example of :pigeon hole principlerecursiondivide and conque techniqueiteration

535 views

go_editor asked Mar 27, 2020

Page:

« prev
1
...
7
8
9
10
11
12
13
14
15
16
17
...
68
next »