Compiler Design MCQ Question Bank Last Update 29-Dec-20202 Page 1 of 18

Compiler Design MCQ question bank last update 29-Dec-20202 Page 1 of 18
Q. Grammar of the programming is checked at ________ phase of compiler.

A) Semantic analysis B) code generation C) syntax analysis D) code
optimization
Q. The lexical analyzer takes_________as input and produces a stream of_______as

output.
A) Source programs, tokens B) Token, source program C) Either A and B
D) None of the above
Q, ‘Macro’ in an ‘assembly level program’ is

A) Sub-program B) a complete program C) a hardware portion D) relative
coding
Q. We can optimize code by

A) Dead code elimination B) Common subprograms C) copy intermediate loop D)
loop declaration
Q. The optimization technique which is typically applied on loops is

Removal of invariant computation B) Peephole optimization C) Constant folding
D) All of these
Q . Which of the following is used for grouping of characters into tokens?

A) Parser B) Code optimization C) Code generator D) Lexical analyser
Q) A compiler that runs on one machine and produces code for a different
machine is called
A) Cross compilation B) One pass compilation C) Two pass compilation D)

None of the above
Q (i).Which of the following suffices to convert an arbitrary CFG to an LL(1)

grammar?
(A) Removing left recursion alone (B) Factoring the grammar alone
(C) Removing left recursion and factoring the grammar (D) None of these
Answer: (D)
Explanation: Removing left recursion and factoring the grammar do not suffice to
convert an arbitrary CFG to LL(1) grammar.
Q 1(ii) Which one of the following is a top-down parser?

(A) Recursive descent parser. (B) Operator precedence parser.
(C) An LR(k) parser. (D) An LALR(k) parser
Answer: (A)
Explanation: Recursive Descent parsing is LL(1) parsing which is top down parsing.
Q Which of the following is used for grouping of characters into tokens?


Q) YACC builds up

SLR parsing table B) Canonical LR parsing table C) LALR parsing table D) None
Q. The grammar S → aSa | bS | c is:
A) LL(1) but not LR(1) B) LR(1)but not LR(1)

C) Both LL(1)and LR(1) (correct) D) Neither LL(1)nor LR(1)
Explanation:
First(aSa) = a
First(bS) = b
First(c) = c
All are mutually disjoint i.e no common terminal
between them, the given grammar is LL(1).
As the grammar is LL(1) so it will also be LR(1) as LR parsers are

more powerful then LL(1) parsers. and all LL(1) grammar are also LR(1)
So option C is correct.
Q. Which of the following is the most powerful parsing method?

A. LL(1)
a) Canonical LR
b) SLR
c) LALR
Answer: (B) Canonical LR
Q. Assume that SLR parser for a grammar G has N1 states and the LALR parser
for G has N2 states. The relationship between N1 and N2 is: [GATE 2003]
A. N1 is necessarily less than N2.
B. N1 is necessarily equal to N2.
C. N1 is necessarily greater than N2.
D. None of these.
Answer: (B) N1 is necessarily equal to N2.
Q In a bottom-up evaluation of a Syntax directed definition, inherited attributes

can
A. Always be evaluated.
B. Be evaluated only if the definition is L-attributed.
C. Be evaluated only if the definition has synthesized attributes.
D. Never be evaluated.
Answer: (B) Be evaluated only if the definition is L-attributed.
Q . Canonical set of items is given below

S --> L. > R
Q --> R.
On input symbol < the set has
(A) a shift-reduce conflict and a reduce-reduce conflict.
(B) a shift-reduce conflict but not a reduce-reduce conflict.
(C) a reduce-reduce conflict but not a shift-reduce conflict.
(D) neither a shift-reduce nor a reduce-reduce conflict.
Explanation: The question is asked with respect to the symbol ‘ < ‘ which is not
present in the given canonical set of items. Hence it is neither a shift-reduce conflict
nor a reduce-reduce conflict on symbol ‘<‘.
Hence D is the correct option.
Q. Which one of the following is a top-down parser?

(A) Recursive descent parser.
(B) Operator precedence parser.
(C) An LR(k) parser.

(D) An LALR(k) parser
Q. In a compiler, keywords of a language are recognized during
(A) parsing of the program

(B) the code generation
(C) the lexical analysis of the program
(D) dataflow analysis
Q. The lexical analysis for a modern computer language such as Java needs the
power of which one of the following machine models in a necessary and
sufficient sense? (GATE CS 2011)
A Finite state automata (correct)

B Deterministic pushdown automata
C Non-Deterministic pushdown automata
D Turing Machine

A) LL(1) B) Canonical LR C) SLR D) LALR
6. Match all items in Group 1 with correct options from those given in Group 2.
(GATE-CS-2009)
Group 1 Group 2
P. Regular expression 1. Syntax analysis
Q. Pushdown automata 2. Code generation
R. Dataflow analysis 3. Lexical analysis
S. Register allocation 4. Code optimization
A P-4. Q-1, R-2, S-3

B P-3, Q-1, R-4, S-2 (correct)
C P-3, Q-4, R-1, S-2
D P-2, Q-1, R-4, S-3
Q .In a compiler, keywords of a language are recognized during


Answer: (C)
Explanation: Lexical analysis is the process of converting a sequence of characters
into a sequence of tokens. A token can be a keyword.
power of which one of the following machine models in a necessary and
sufficient sense?
(A) Finite state automata

(B) Deterministic pushdown automata
(C) Non-Deterministic pushdown automata
(D) Turing Machine
Answer: (A)
Q. A canonical set of items is given below
S --> L. > R
Q --> R.
Answer: (D)
Which one of the following is a top-down parser?

Q(A) Recursive descent parser.

Answer: (A)
Q . The grammar S → aSa | bS | c is:
A LL(1) but not LR(1)

B LR(1)but not LR(1)
C Both LL(1)and LR(1) (correct)
D Neither LL(1)nor LR(1)
Explanation:
First(aSa) = a
First(bS) = b
First(c) = c

Q.Which of the following suffices to convert an arbitrary CFG to an LL(1)

grammar?
(A) Removing left recursion alone

(B) Factoring the grammar alone
(C) Removing left recursion and factoring the grammar
(D) None of these
Answer: (D)

Q. Match all items in Group 1 with correct options from those given in Group 2.
Group 1 Group 2
A P-4. Q-1, R-2, S-3

C P-3, Q-4, R-1, S-2
D P-2, Q-1, R-4, S-3
Q.
Which of the following is the most powerful parsing method?
A. LL(1)
Canonical LR
SLR
LALR
Q. Assume that SLR parser for a grammar G has N1 states and the LALR parser for G
has N2 states. The relationship between N1 and N2 is: [GATE 2003]
A. N1 is necessarily equal to N2.
B. N1 is necessarily greater than N2.
C. None of these.
Q. In a bottom-up evaluation of a Syntax directed definition, inherited attributes can

[GATE 2003]
A. Be evaluated only if the definition is L-attributed.
B. Be evaluated only if the definition has synthesized attributes.
C. Never be evaluated.
Q. Intermediate code generation phase gets input from

Lexical analyser B) Syntax analyser C) Semantic analyser D) Error handling
Answer A
Q. Grammar of the programming is checked at ________ phase of compiler.

A) Semantic analysis B) code generation C) syntax analysis D) code optimization
Q3. The lexical analyzer takes_________as input and produces a stream

of_______as output.
A) Source programs, tokens B) Token, source program C) Either A and B
D) None of the above
Q4, ‘Macro’ in an ‘assembly level program’ is

A) Sub-program B) a complete program C) a hardware portion D) relative
coding
Q. We can optimize code by

A) Dead code elimination B) Common subprograms C) copy intermediate loop D)
loop declaration
Q. The optimization technique which is typically applied on loops is

Removal of invariant computation B) Peephole optimization C) Constant folding D)

All of these
Q . Which of the following is used for grouping of characters into tokens?

Q) A compiler that runs on one machine and produces code for a different
machine is called
A) Cross compilation B) One pass compilation C) Two pass compilation D)

None of the above
Q (i).Which of the following suffices to convert an arbitrary CFG to an LL(1)

grammar?
(A) Removing left recursion alone (B) Factoring the grammar alone
(C) Removing left recursion and factoring the grammar (D) None of these
Answer: (D)
Q 1(ii) Which one of the following is a top-down parser?

(A) Recursive descent parser. (B) Operator precedence parser.
(C) An LR(k) parser. (D) An LALR(k) parser
Answer: (A)
Q Which of the following is used for grouping of characters into tokens?


Q. YACC builds up

SLR parsing table B) Canonical LR parsing table C) LALR parsing table D) None
Q 1(iii). The grammar S → aSa | bS | c is:
A) LL(1) but not LR(1) B) LR(1)but not LR(1)

C) Both LL(1)and LR(1) (correct) D) Neither LL(1)nor LR(1)
Explanation:
First(aSa) = a
First(bS) = b
First(c) = c


A. LL(1)
a) Canonical LR
b) SLR
c) LALR
Q. Assume that SLR parser for a grammar G has N1 states and the LALR parser for G
has N2 states. The relationship between N1 and N2 is: [GATE 2003]
D. None of these.
Q In a bottom-up evaluation of a Syntax directed definition, inherited attributes

can
Q . Canonical set of items is given below

S --> L. > R
Q --> R.
Q. Which one of the following is a top-down parser?

Q. In a compiler, keywords of a language are recognized during


power of which one of the following machine models in a necessary and sufficient
sense? (GATE CS 2011)
A Finite state automata (correct)

B Deterministic pushdown automata
C Non-Deterministic pushdown automata
D Turing Machine

A) LL(1) B) Canonical LR C) SLR D) LALR
6. Match all items in Group 1 with correct options from those given in Group 2.
(GATE-CS-2009)
Group 1 Group 2
A P-4. Q-1, R-2, S-3

C P-3, Q-4, R-1, S-2
D P-2, Q-1, R-4, S-3
1.In a compiler, keywords of a language are recognized during


Answer: (C)
Explanation: Lexical analysis is the process of converting a sequence of characters
into a sequence of tokens. A token can be a keyword.
2.The lexical analysis for a modern computer language such as Java needs the
power of which one of the following machine models in a necessary and sufficient
sense?
(A) Finite state automata

(B) Deterministic pushdown automata
(C) Non-Deterministic pushdown automata
(D) Turing Machine
Answer: (A)
A canonical set of items is given below
S --> L. > R
Q --> R.
Answer: (D)
4.Which one of the following is a top-down parser?
Answer: (A)
Q 5. The grammar S → aSa | bS | c is:
A LL(1) but not LR(1)

B LR(1)but not LR(1)
C Both LL(1)and LR(1) (correct)
D Neither LL(1)nor LR(1)
Explanation:
First(aSa) = a
First(bS) = b
First(c) = c

Q 6.Which of the following suffices to convert an arbitrary CFG to an LL(1)

grammar?
(A) Removing left recursion alone

(B) Factoring the grammar alone
(C) Removing left recursion and factoring the grammar
(D) None of these
Answer: (D)

Q. Match all items in Group 1 with correct options from those given in Group 2.
Group 1 Group 2

A P-4. Q-1, R-2, S-3

C P-3, Q-4, R-1, S-2
D P-2, Q-1, R-4, S-3

A. LL(1)
a) Canonical LR
b) SLR
c) LALR
Q. Assume that SLR parser for a grammar G has N1 states and the LALR parser for G has
N2 states. The relationship between N1 and N2 is: [GATE 2003]
D. None of these.
Q. In a bottom-up evaluation of a Syntax directed definition, inherited attributes can

[GATE 2003]
Q Intermediate code generation phase gets input from

Lexical analyser B) Syntax analyser C) Semantic analyser D) Error handling
This set of Compilers Multiple Choice Questions & Answers (MCQs) focuses
on “Top-Down Parsing – 1”.
1. Which of the following derivations does a top-down parser use while
parsing an input string?
a) Leftmost derivation
b) Leftmost derivation in reverse
c) Rightmost derivation
d) Rightmost derivation in reverse
Answer: a
Explanation: In top down parser takes input from Left to right constructing
leftmost derivation of the sentence.
Q. The process of assigning load addresses to the various parts of the

program and adjusting the code and data in the program to reflect the
assigned addresses is called
a) Assembly
b) Parsing
c) Relocation
d) Symbol resolute
Answer: c
Explanation: Relocation is the process of replacing symbolic references or
names of libraries with actual usable addresses in memory before running a
program. Linker performs it during compilation.
Q Which of the following statements is false?
a) Left as well as right most derivations can be in Unambiguous

grammar
b) An LL (1) parser is a top-down parser
c) LALR is more powerful than SLR
d) Ambiguous grammar can’t be LR (k)
Answer: a
Explanation: If a grammar has more than one leftmost (or rightmost)
derivation the grammar is ambiguous. Sometimes in unambiguous
grammar the rightmost derivation and leftmost derivations may differ.
Q Given the following expression grammar:

E -> E * F | F+E | F
F -> F-F | id
which of the following is true?
a) * has higher precedence than +
b) – has higher precedence than *
c) + and — have same precedence
d) + has higher precedence than *
Answer: b
Explanation:Precedence is that a higher precedence operator will never
produce an expression with operator with lower precedence.
In the given grammar MINUS has higher precedence than ASTERIX.

Compiler Design MCQ Question Bank Last Update 29-Dec-20202 Page 1 of 18

Uploaded by

Copyright:

Available Formats

Compiler Design MCQ Question Bank Last Update 29-Dec-20202 Page 1 of 18

Uploaded by

Document Information

Original Description:

Original Title

Copyright

Available Formats

Share this document

Share or Embed Document

Sharing Options

Did you find this document useful?

Is this content inappropriate?

Copyright:

Available Formats

Compiler Design MCQ Question Bank Last Update 29-Dec-20202 Page 1 of 18

Uploaded by

Copyright:

Available Formats

Compiler Design MCQ question bank last update 29-Dec-20202 Page 1 of 18

Q. Grammar of the programming is checked at ________ phase of compiler.

Q. The lexical analyzer takes_________as input and produces a stream of_______as

Q, ‘Macro’ in an ‘assembly level program’ is

Q. We can optimize code by

Q. The optimization technique which is typically applied on loops is

Q . Which of the following is used for grouping of characters into tokens?

A) Cross compilation B) One pass compilation C) Two pass compilation D)

Q (i).Which of the following suffices to convert an arbitrary CFG to an LL(1)

Q 1(ii) Which one of the following is a top-down parser?

Q Which of the following is used for grouping of characters into tokens?

Q) YACC builds up

Q. The grammar S → aSa | bS | c is:

A) LL(1) but not LR(1) B) LR(1)but not LR(1)

As the grammar is LL(1) so it will also be LR(1) as LR parsers are

Q. Which of the following is the most powerful parsing method?

Q In a bottom-up evaluation of a Syntax directed definition, inherited attributes

Q . Canonical set of items is given below

Q. Which one of the following is a top-down parser?

(C) An LR(k) parser.

Explanation: Recursive Descent parsing is LL(1) parsing which is top down parsing.

Q. In a compiler, keywords of a language are recognized during

(A) parsing of the program

A Finite state automata (correct)

Q. Which of the following is the most powerful parsing method?

A P-4. Q-1, R-2, S-3

Q .In a compiler, keywords of a language are recognized during

(A) parsing of the program

(B) the code generation

(A) Finite state automata

Hence D is the correct option.

Which one of the following is a top-down parser?

Q(A) Recursive descent parser.

Q . The grammar S → aSa | bS | c is:

A LL(1) but not LR(1)

As the grammar is LL(1) so it will also be LR(1) as LR parsers are

Q.Which of the following suffices to convert an arbitrary CFG to an LL(1)

(A) Removing left recursion alone

Explanation: Removing left recursion and factoring the grammar do not suffice to

A P-4. Q-1, R-2, S-3

Q. In a bottom-up evaluation of a Syntax directed definition, inherited attributes can

Q. Intermediate code generation phase gets input from

Q. Grammar of the programming is checked at ________ phase of compiler.

Q3. The lexical analyzer takes_________as input and produces a stream

Q4, ‘Macro’ in an ‘assembly level program’ is

Q. We can optimize code by

Q. The optimization technique which is typically applied on loops is

Removal of invariant computation B) Peephole optimization C) Constant folding D)

Q . Which of the following is used for grouping of characters into tokens?

A) Cross compilation B) One pass compilation C) Two pass compilation D)

Q (i).Which of the following suffices to convert an arbitrary CFG to an LL(1)

Q 1(ii) Which one of the following is a top-down parser?

Q Which of the following is used for grouping of characters into tokens?

Q. YACC builds up

Q 1(iii). The grammar S → aSa | bS | c is:

A) LL(1) but not LR(1) B) LR(1)but not LR(1)

As the grammar is LL(1) so it will also be LR(1) as LR parsers are

Q. Which of the following is the most powerful parsing method?

Q. The lexical analyzer takes___as input and produces a stream of_as