CD MID II IMPORTANT QUESTIONS
DESCRIPTIVE
[Link] about Peephole optimization.
[Link] Different Types of Loop Optimization Techniques.
[Link] in detail about data flow analysis.
[Link] the Code Optimization Techniques and Its Types.
[Link] are the Different variants of Syntax Tree.
[Link] is DAG ? Draw Syntax tree for (a*b)+(c-d))*(a*b))=b).
[Link] is Dynamic Programming.
[Link] a Simple Code Generator Algorithm with an Example and Issues in Code Generator.
[Link] about Code Optimization techniques.
[Link] about Syntax-Directed Definitions.
[Link] about Three Address Code.
[Link] All the Peephole Optimization Techniques.
OBJECTIVES:
Data flow equations can be computed using_____________ . [ ]
a. Available expression b. Reaching definition c. Live variable analysis d. All of the above
_______________ performs the garbage collection. [ ]
a. C b. PASCAL c. LISP d. JAVA
Semantic errors can be detected at__________. [ ]
a. Compile time b. Runtime c. Both at compile time and run time d. None of the above
The augmented context free grammar is generated during________ . [ ]
a. Type checking b. Syntax analysis c. Syntax directed translation scheme d. None of the above
Synthesized attribute is computed at__________ . [ ]
a. Child node of the parse tree b. Parent node of the parse tree
c. Root node of the parse Street d. Sibling node of the parse tree
Following is a form of an object code___________. [ ]
a. Three address code b. Polish notation c. Relocatable code d. None of the above
Code generation take_____________ as input . [ ]
a. Source code b. Assembly language code c. Intermediate code d. None of the above
Selection of appropriate instruction is an important factor in ________. [ ]
a. Code Optimisation b. Code generation c. Syntax analysis d. Lexical analysis
Peephole optimisation is___________ . [ ]
a. Applied to a small part of the code
b. Can be applied to the portion of the code that is not contiguous
c. It can be applied repeatedly to get the optimized code
d. All of the above.
In a bottom of evaluation of a SDD, 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. None
Which statement is an abstract form of intermediate code? [ ]
3- address b) 2-address c) address d) Intermediate code
In how many types of optimizations can be divided? [ ]
a) two types b) three types c) four types d) five types
The value of which variable is updated inside the loop by a loop-invariant value?
a) Loop b) strength c) induction d) invariable [ ]
Which compiler runs on one machine and generates code for multiple machines?
a) Multipass compiler b) Cross compiler c)Optimizing compiler d) One pass compiler [ ]
Which symbol is not related to context-free grammar? [ ]
a) End b) Start c) non-terminal d) Terminal
Which statement is an abstract form of intermediate code? [ ]
3- address b) 2-address c) address d) Intermediate code
In how many types of optimizations can be divided? [ ]
a) two types b) three types c) four types d) five types
which is not a optimization method [ ]
a) Code Motion b) Loop Unrolling c) Loop Fusion d) Basic Blocks
DAG is an abbreviation of ? [ ]
a) Detecting Acyclic Graph b) Data Acyclic Graph c)Dynamic Acyclic Graph d) Directed Acyclic Graph
Which method merges the multiple loops into the single one? [ ]
a) Constant Folding b) Loop rolling c) Loop fusion d) None of the above
Which of the following structure has four fields? [ ]
a) Parse tree b) Triples c) Indirect Triples d) Quadruples
Which phase of the compiler checks the grammar of the programming? [ ]
a) Code Optimization b) Semantic Analysis c)Code Generation d) Syntax Analysis
Selection of appropriate instruction is an important factor in ________. [ ]
a. Code Optimisation phase b. Code generation phase c. Syntax analysis phase d. Lexical analysis phase
Peephole optimisation is___________ . [ ]
a. Applied to a small part of the code
b. Can be applied to the portion of the code that is not contiguous
c. It can be applied repeatedly to get the optimized code
d. All of the above.
In a bottom of evaluation of a SDD, 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. None
____________ is a technique of using optimization on loops.
_____________ data Structure is used evaluating the synthesized attributes.
___________________ is a loop that contains no other loop.
Consider the following code ADD b, R0 MOV a, R0 MOV R0, c The cost is _________.
Code Generation is a process of creating ______________________ Language .
_______________ is a machine code that contains refers to actual addresses within program’s address space.
Compilers generate an easy to represent form of source language which is called _____________________________.
Data flow analysis is done during __________ phase.
During_______________________, select appropriate set of variables that will reside in registers.
Evaluation of postfix expression requires_______ stack.
For deciding the evaluation order from the dependency graph __________ is used.
In strength Reduction, the * is replaced by _______________
Int, char, float, double, Enum are _________________ expressions.
Register allocation is an important issue in___________ phase.
The assignment in the form a:=b is called ______________ statement.
The first statement of the basic block is a ___________ statement
The graph which represents the interdependency between synthesized and inherited attributes is____________.
The live variable analysis is done in___________ phase.
The Semantic action for F-> digit is ______________________.
The Syntax-directed definition that uses only synthesized attributes is called _________________________
Definition.
