Consider the following intermediate code segment in 3-address code form :
$x = x^{} x$
$y = y^{} y$
$x = x^{} y$
$y = y^{} x$

The minimum number of total variables in the static single assignment form of the given code segment is _____________

No worries! We‘ve got your back. Try BYJU‘S free classes today!

Right on! Give the BNAT exam to get a 100% scholarship for BYJUS courses

No worries! We‘ve got your back. Try BYJU‘S free classes today!

Open in App

Solution

The correct option is C 6
The SSA from of the given code segment is :

$x_{1} = x_{0}^{} x_{0}$
$y_{1} = y_{0}^{} y_{0}$
$x_{2} = x_{1}^{} y_{1}$
$y_{2} = y_{1}^{} x_{2}$

$So, total 6 variable (x_{0}, y_{0}, x_{1}, x_{2}, y_{1}, y_{2}) .$

Suggest Corrections

Similar questions

Consider the following code segment:
x = u - t;
y = x * v;
x = y + w;
y = t - z;
y = x * y;
The minimum number of total variables required to convert the above code segment to static single assignment form is

Q. Consider the following ANSI C code segment:

$z = x + 3 + y \to f 1 + y \to f 2;$

$f o r (i = 0; i < 200; i = i + 2) {$

$i f (z > i) {$

$p = p + x + 3;$

$q = q + y \to f 1;$

$} e l s e {$

$p = p + y \to f 2;$

$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, q, 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 $\to$ f1 or y $\to$ f2) in the optimized code, respectively, are :

I f X a n d Y a r e t w o d i s c r e t e r a n d o m v a r i a b l e s a n d H (V) r e p r e s e n t s t h e e n t r o p y o f t h e v a r i a b l e V, t h e n c o n s i d e r t h e f o l l o w i n g r e l a t i o n s : S e l e c t t h e c o r r e c t r e l a t i o n s u s i n g t h e c o d e s g i v e n b e l o w . R 1 : H (X) \geq H (X | Y) R 2 : H (X, Y) \geq H (X) + H (Y) R 3 : H (x) - H (Y) = H (X | y) - H (Y | X)

Q. Consider the following two C code segments. Y and X are one and two dimensional arrays of size n and

n \times n

respectively, where

2 \leq n \geq 10.

Assume that in both code segments, elements of Y are initialized to 0 and each element X[i][j] of array X is initialized to i + j. Further assume that when stored in main memory all elements of X are in same main memory page frame.

Code segment 1 :
// initialize elements of Y to 0
// initialize elements X [i][j] of X to i+j
for (i =0; i < n; i++)
Y [i] + = X [0] [i];

Code segment 2 :
// initialize elements of Y to 0
// initialize elements X[i][j] of X to i+j
for (i =0; i < n; i++)
Y [i] + = X [i] [0];

Which of the following statements is/are correct?

S1 : Final contents of array Y will be same in both code segments.

S2 : Elements of array X accessed inside the for loop shown in code segment 1 are contiguous in main memory.

S3 : Elements of array X accessed inside the for loop shown in code segment 2 are contiguous in main memory.

Q. Number of temporary variable required to create 3 address code in static single assignment form for the expression:

P + Q^{*} R - S / (Q^{*} R)

Join BYJU'S Learning Program

Consider the following intermediate code segment in 3-address code form : x=x ∗ x y=y ∗ y x=x ∗ y y=y ∗ x The minimum number of total variables in the static single assignment form of the given code segment is _____________

The correct option is C 6The SSA from of the given code segment is : x1=x0 ∗ x0 y1=y0 ∗ y0 x2=x1 ∗ y1 y2=y1 ∗ x2 So, total 6 variable(x0, y0, x1, x2, y1, y2).

Consider the following intermediate code segment in 3-address code form :
$x = x^{} x$
$y = y^{} y$
$x = x^{} y$
$y = y^{} x$

The minimum number of total variables in the static single assignment form of the given code segment is _____________

The correct option is C 6
The SSA from of the given code segment is :

$x_{1} = x_{0}^{} x_{0}$
$y_{1} = y_{0}^{} y_{0}$
$x_{2} = x_{1}^{} y_{1}$
$y_{2} = y_{1}^{} x_{2}$

$So, total 6 variable (x_{0}, y_{0}, x_{1}, x_{2}, y_{1}, y_{2}) .$