Skip to content
VUBuddy

CS606 Final Term Past Paper 2014

Compiler Construction PDF 281 KBUpdated 23 Oct 2026
Final term past paper CS606 Final Term Past Paper 2014 PDF 281 KB
vubuddy.com
Type
Final term past paper
Course
CS606 Compiler Construction
Size
PDF 281 KB
Updated
23 Oct 2026
Free download 0 of 3 used today
Download free · 281 KB

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 1, 2, 3 of 3. Download the file for all 3 pages.

CS—606 Compiler Construction Final Term Fall 2013 held in 5 March 2014

There were total 52 Questions

40 MCQs of 1 Mark

4 were of 2 Marks

4 were of 3 Marks

4 were of 5 Marks

Some the MCQs were as under: -

Q1. In compilers, linear analysis is also called _____________

  1. Lexical Analysis
  2. Scanning
  3. Lexical Analysis and Scanning
  4. None of the given

Q2. The test of string is described by a rule called a _________, associated with token.

  1. Character
  2. Loader
  3. Pattern
  4. None of the given

Q3. The regular expression ________ denotes, the set of all strings of a’s and b’s of length two.

  1. a*
  2. (a*|b*)*
  3. (a*b*)*
  4. (a|b)(a|b)

Q4. ___________ (Lexical Analyzer Generator), is written in Java.

  1. Flex
  2. Jlex
  3. Complex
  4. None of the given

Q5. Bottom up parsing is also called ___________.

  1. LR Parsing
  2. LT Parsing
  3. LS Parsing
  4. None of the given

Q6. The shift action __________ a terminal on the stack

  1. Pushes
  2. Pops
  3. Both pushes and pops
  4. None of the given

Q7. A DFA can be reconstructed from NFA using the subset construction, similar to one used for ___

  1. Lexical Analysis
  2. Physical Analysis
  3. Logical Analysis
  4. Parsing

Q8. The parser generator YACC can handle _______________ grammar.

  1. LL(1)
  2. LT(1)
  3. LS(1)
  4. LF(1)

Q9. A linker combines multiple object files into a __________ executable object.

  1. Single
  2. Double
  3. Triple
  4. Quadruple

Q10. The notation ___________ instructs YACC to push a computed attribute value on the stack.

  1. $$
  2. &&
  3. ##
  4. - -

Q11. Hybrid IRs combine elements of _________

  1. Graphical (Structural)
  2. Linear IRs
  3. Both
  4. Non-Linear IRs

Q12. A ___________ parser creates the nodes in the AST in preorder.

  1. Top – Down
  2. Bottom – Up
  3. Middle – Ware
  4. Straight

Q13. A lexical analyzer generator automatically constructs a ________ that recognizes tokens.

  1. FA
  2. PDA
  3. DP
  4. Unidirectional Graph

Q14. The order in which DAG is traversed can lead to ______ code.

  1. Better
  2. Worse
  3. Large
  4. Garbage

Q15. Which of the following system software resides in the main memory always?

  1. Text editor
  2. Assembler
  3. Linker
  4. Loader

Q16. _______ plays an important role in code optimization.

  1. DAG
  2. Lexical Analyzer
  3. AGD
  4. Memory Management

Subjective Part

Q1. Translate the regular expression “r*” in simple words. (2 marks)

Q2. What are two properties of reduced flow graphs? (2 marks)

Q3. Which information we can get from the second section of YACC file? (2 marks)

Q4. In main memory, what type of information is stored in data segment? (2 marks)

  1. Consider the following statement x: = a + (b*a) You are required to translate it into an AST. (3 Marks)
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.