Skip to content
VUBuddy

CS606 MCQs by Junaid

Compiler Construction PDF 1.2 MBUpdated 23 Oct 2026
MCQs CS606 MCQs by Junaid PDF 1.2 MB
vubuddy.com
Type
MCQs
Course
CS606 Compiler Construction
Size
PDF 1.2 MB
Updated
23 Oct 2026
Free download 0 of 3 used today
Download free · 1.2 MB

You get 3 free files a day on the website. Add the Chrome extension for 30 a day.

Unlimited downloads in the Android app Get it free on Google Play

Preview text

Text from pages 2, 3, 4 of 39. Download the file for all 39 pages.

1. convert the relocatable machine code into absolute machine code by linking library and relocatable objectfiles.

  •  Assembler
  •  Loader/link-editor
  •  Compiler
  •  Preprocessor
  1. Parsers take as input from lexical analyzer.
  •  Linker
  •  Token
  •  Instruction
  1. 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  Preprocessing  None of given

  1. In LL(1) parsing algorithm, contains a sequence of grammar symbols.  Stack PG # 62  Link List  Array
  2. Consider the grammar A  B C D B  h B | € C  C g | g | C h | i D AB | £ First of A is  h, g, i  g  h

8. parsers never shifts into an error state.  LS  LT  LR  LP

  1. In parser, the two LL stand for  Left-to-right scan of input  left-most derivation  Left-to-right scan of input and left-most derivation PG # 54

10. is elaborated to produce bindings.  Declaration  Expression  Command

11. A lexical analyzer generated by is essentially a FSA.

 Dex  Mex  Fex  Lex 12. A lexical analyzer generated by lex is essentially a PDA (Push Down Automaton).  True  False 13. T he actions (shift, reduce) in a SLR(1) parser depend on a look ahead symbol (  Current input token  Next Input Token  Previous output Token  Previous Input Token. 14. The following grammar contains a conflict. S → A | xb

 First-Reduce  Shift-First

15. S  A | xb A  aAb | x This grammar contains a conflict.

 First-Reduce  Shift-First

  1. Consider the Following S → AB  1  2  3  4

17. is a register allocation technique that always finds the minimal number of registers needed for aprocedure.

 Dangling reference  Graph coloring  Left Factoring  Right Recursion 18. Graph coloring is a register allocation technique that operates at individual basic blocks.

  •  True
  •  False
All CS606 files →
CS606 Compiler Construction All CS606 handouts, past papers, quizzes and MCQs in one place. Open course page

Get more out of VUBuddy, for free

Android app Free on Google Play
  • Unlimited downloads
  • The explanation behind every MCQ answer
  • Study offline on slow data
Get the Android app
Chrome extension Free on the Chrome Web Store
  • 30 downloads a day instead of 3
  • Sign in and buy Pro Semester here
Add to Chrome

One Pro Semester membership works in both the extension and the app.