Exactly 3 address
At most Three address
No unary operators
None of the mentioned
Post-fix Notation
Syntax Trees
Three address code
All of the mentioned
Dag
Flow Graph
Control Graph
Hamilton Graph
They enhance the portability of the compiler to other target processors
Program analysis is more accurate on intermediate code than on machine code
The information from dataflow analysis cannot otherwise be used for optimization
The information from the front end cannot otherwise be used for optimization
The code contains loop invariant computation
There is scope of common sub-expression elimination in this code
There is scope of strength reduction in this code
There is scope of dead code elimination in this code
5 and 7
6 and 7
5 and 5
7 and 8
6
8
9
10
c = a + b t = b * e a = d – e b = d/t c = a
c = a + b d = c c = c – e a = d – e b = d/b
d = c c = c – e a = d – e b = b * e b = d/b
None of the above
Loop optimization
Local optimization
Constant folding
Data flow analysis
Replacing run time computation by compile time computation
Removing common subexpression
Removing loop invariant computation
Replacing a costly operation by a relatively cheaper one
Local optimization
Loop optimization
Constant folding
Strength reduction
Loop rolling
Loop Jamming
Constant folding
None of these
It is based on the syntax
Its description is independent of any implementation
It is easy to modify
All of these
Removal of invariant computation
Peephole optimization
Constant folding
All of these
DAG
Flow graph
Control graph
Hamiltonian graph
Postfix notation
Syntax trees
Three address code
All of these
Source code
Intermediate code
Target code
All of the above
Local optimization
Loop optimization
Constant folding
Data flow analysis
Data flow analysis
Constant folding
Peep hole optimization
DFA and constant folding
Is optimized to occupy less space
Is optimized to take less time for execution
Optimizes the code
All of the above
DAG
A flow graph
A graph with cycles
None of the above
Tree
DAG
Graph
None of the above
Computing logical values
Used as conditional expressions
Both a &b
None of the above
Backpatching
Code-generator
Parser
Static checker
Encoding true & false numerically
To evaluate boolean expression analogously to an arithmetic expression
Implementing boolean expression by flow of control
All of the above