Consider the following ANSI C code segment:z = x + 3 + y -> f1 + y -> f2;for (i = 0; i i) {P = p + x + 3;q = q + y -> f2;} else {p = p + y -> f2;q = q + x + 3;}}Assume that the variable y points to a struct (allocated on the heap) containing two fields f1 and f2, and the local variables x, y, z, p, g, and i are allotted registers. Common sub-expression elimination (CSE) optimization is applied on the code. The number of addition and dereference operations (of the form y -> f1 or y -> f2 ) in the optimized code, respectively, are:

Consider the following ANSI C code segment:z = x + 3 + y -> f1 + y ->

1.	Consider the following ANSI C code segment:z = x + 3 + y -> f1 + y -> f2;for (i = 0; i < 200; i = i + 2){if (z > i) {P = p + x + 3;q = q + y -> f2;} else {p = p + y -> f2;q = q + x + 3;}}Assume that the variable y points to a struct (allocated on the heap) containing two fields f1 and f2, and the local variables x, y, z, p, g, and i are allotted registers. Common sub-expression elimination (CSE) optimization is applied on the code. The number of addition and dereference operations (of the form y -> f1 or y -> f2 ) in the optimized code, respectively, are:
A.	203 and 2
B.	403 and 102
C.	303 and 102
D.	303 and 2
Answer» E.

Discussion

No Comment Found

Related MCQs

For a statement S in a program, in the context of liveness analysis, the following sets are defined:USE(S): the set of variables used in SIN(S): the set of variables that are live at the entry of SOUT(S): the set of variables that are live at the exit of SConsider a basic block that consists of two statements, S1 followed by S2.Which one of the following statements is correct?
Peephole optimization is a:
Consider evaluating the following expression tree on a machine with load-store Architecture in which memory can be accessed only through load and store instructions. The variables a, b, c, d and e are initially stored in memory. The binary operators used in this expression tree can be evaluated by the machine only when the operands are in registers. The instructions produce result only in a register. If no intermediate results can be stored in memory, what is the minimum number of registers needed to evaluate this expression?
Peephole optimization is a form of
Consider the code segmentint i, j, x, y, m, n;n=20;for (i = 0, i < n; i++){ for (j = 0; j < n; j++) { if (i % 2) { x + = ((4*j) + 5*i); y += (7 + 4*j); } }}m = x + y;Which one of the following is false?
Consider the following ANSI C code segment:z = x + 3 + y -> f1 + y -> f2;for (i = 0; i < 200; i = i + 2){if (z > i) {P = p + x + 3;q = q + y -> f2;} else {p = p + y -> f2;q = q + x + 3;}}Assume that the variable y points to a struct (allocated on the heap) containing two fields f1 and f2, and the local variables x, y, z, p, g, and i are allotted registers. Common sub-expression elimination (CSE) optimization is applied on the code. The number of addition and dereference operations (of the form y -> f1 or y -> f2 ) in the optimized code, respectively, are:
Relocating_bits_used_by_relocating_loader_are_specified_by$
The address code involve?
( Z,* ) be a structure, and * is defined by n * m =maximum ( n , m ) Which of the following statements is true for ( Z, * ) ?
The most powerful parser is

Discussion

No Comment Found

Related MCQs

Reply to Comment