CS606 Final Term MCQs 2016

CS606- Compiler Construction

Final-Term Papers Solved

MCQS with Reference (1 to 45 lectures) by Arslan Arshad (Zain Nasar)

FEB 21,2016

AKMP01

Final-Term Papers Solved MCQS with Reference (1 to 45 lectures)

1. _____ convert the relocatable machine code into absolute machine code by linking library and relocatable object files.

•  Assembler

 Loader/link-editor

•  Compiler
•  Preprocessor

2. Parsers take ____ as input from lexical analyzer.

•  Linker

 Token

•  Instruction

3. The regular expression ______denotes, the set of all strings of a’s and b’s of length two

•  a*
•  (a*|b*)*
•  (a*b*)*

 (a|b)(a|b)

4. _________ is a regular expression for the set of all strings over the alphabet {a} that has an even number of a’s.

•  aa*

 (aa)*

•  aa*a
•  a(aa)*

5. _______ Phase supports macro substitution and conditional compilation.

•  Semantic
•  Syntax
•  None of given

6. In LL(1) parsing algorithm, ____ contains a sequence of grammar symbols.

 Stack PG # 62

•  Link List
•  Array

7. Consider the grammar

A  B C D B  h B | € C  C g | g | C h | i

 h, g, i

•  g
•  h

8. _______ parsers never shifts into an error state.

•  LS
•  LT
•  LR
•  LP

9. In parser, the two LL stand for ________ .

•  Left-to-right scan of input
•  left-most derivation