Test: Code Generation & Optimization- 2

Code optimizer

Code generator

intermediate code generator

None of the above

a + (b*c) - d

a + b *c *b *c -d

(a + b)*(c- d)

(a + b*c)*(b*c- d)

Atleast one vertex with indegree 1 and atleast one vertex with outdegree 0.

Atleast one vertex with indegree 0 or atleast one vertex with outdegree 0,

Atleast one vertex with indegree 0 and atleast one vertex with outdegree 0,

Atleast one vertex with indegree 0 and atleast one vertex with outdegree 1

(a - b) * (a + b) + (c + d) * (c + d)

(a - b) * (c + d) + (a - b) * (c - d)

(a * b) + (c * d) * (a * b) + ( c * d)

(a + b) * ( c + d) + (a - b) * (c + d)

1 2 3 4 5 6

1 3 2 4 5 6

1 3 2 4 6 5

3 2 4 1 6 5

2

3

4

5

Tree

DAG

Graph

None of these

Automatic detection of local common sub-expressions.

Automatic detection of induction variables.

Automatic detection of loop invariant.

None of the above

 iac + cdb + - +

iacb + cd uminus * - +

iacb + cd * - +

None of the above

None of the above

It makes implementation of lexical analysis and syntax analysis easier.

Syntax-directed translations can be written for intermediate code generation.

It enhances the portability of the front end of the compiler.

It is not possible to generate code for real machines directly from high level language programs

Two addresses for operands, one for operator

One for all operator, one for all operands and one for result

One for result, two for operands

None of the above

 None of the above

Copy statements

Index assignment statements

Pointer assignments

None of the above

S₁ is true S₂ is false

S₁ is false S₂ is true

Both S₁ and S₂ are true

Both S₁ and S₂ are false