Compiler Design Mid - II, November - 2014

1.Determining common sub expression can be done using ________
  • Compiler
  • Interpreter
  • DAG
  • Parse Tree
Answer: C
2.One of the following is an object code form
  • Absolute machine language
  • Re-locatable machine code
  • Assembly language
  • Above ALL
Answer: D
3.The statement of the form a:=b is called a _________ Statement.
  • Common
  • Copy
  • Induction Variable
  • Decode
Answer: B
4.To check whether a variable is exactly defined once or not is a ________ check.
  • uniqueness check
  • Flow of control check
  • name check
  • Above ALL
Answer: A
5.________ is a Data structure, which is used by compiler to keep track of information
  • Lexical Analyzer
  • Symbol Table
  • Semantic Table
  • Semantic Analyzer
Answer: B
6.A symbol is said to be _______ if it has different meaning depending on its context or use.
  • Override
  • overloaded
  • Overwrite
  • None
Answer: B
7.The storage strategy in which activation record is maintained even after the execution of a procedure is completed.
  • Stack allocation
  • Heap allocation
  • Static allocation
  • Dynamic allocation
Answer: B
8.An optimized compiler can perform _________
  • Optimize the code
  • occupy less space
  • to take less time for execution
  • Above ALL
Answer: A
9.Machine independent optimization is
  • Register allocation
  • Frequency reduction
  • Data intermixed with instructions
  • None
Answer: C
10.In DAG the interior nodes are labeled with
  • Number in BFS
  • Special colors
  • Identifiers
  • Number in BFS
Answer: C
11.A_____________ occurs when there is a reference to storage that has been de-allocated.
Answer: Dangling reference
12.The process of moving the statement from one part of the program to another is called ___________
Answer: Code Motion
13.______________ is a simple, systematic technique for allocating registers and managing register spills.
Answer: Graph coloring
14.The _________ is a node in the flow graph, which precedes all the statements in the loop.
Answer: Dominator
15.Any statement that immediately follows a goto or conditional goto statement in a sequence of three address statements is a __________.
Answer: Leader
16.The ________ rules of a language determine which declaration of the name applies when the name appears in the text of a program.
Answer: Scope
17.A technique for improving the quality of a target code locally by examining a short sequence of target instructions and replacing with faster sequence is called ______________ optimization.
Answer: Peephole
18.In loop optimization technique whose body is rarely executed is _________________
Answer: Blank stripper
19.At a point in a program if the value of the variable can be used subsequently, then that variable is __________ Variable.
Answer: Live
20.General Form of a three-address statement is ________________
Answer: a:=b (op) c