Scribd
Upload
91 views10 pages

CS314 Spring 2023 Homework 4 Due Monday, March 27, 11:59pm Submission: PDF File Through Canvas 1 Problem - Pointers

1) The document describes homework assignments for CS314 in Spring 2023 involving pointers, compiler optimizations, scoping rules, and parameter passing. 2) The first problem involves pointers, drawing a diagram of variables and values, and identifying an illegal pointer expression. 3) The second problem tasks the student with implementing constant folding optimization and considering an example where it could be unsafe. 4) The third problem involves determining the output of a program using both static and dynamic scoping. 5) The fourth problem asks the student to draw a runtime stack diagram and generate ILOC code for lexical scoping examples. 6) The fifth problem provides a test program to determine the parameter passing style through different printed outputs.

Uploaded by

Muhammad chaudhary
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PDF, TXT or read online on Scribd
91 views10 pages

CS314 Spring 2023 Homework 4 Due Monday, March 27, 11:59pm Submission: PDF File Through Canvas 1 Problem - Pointers

1) The document describes homework assignments for CS314 in Spring 2023 involving pointers, compiler optimizations, scoping rules, and parameter passing. 2) The first problem involves pointers, drawing a diagram of variables and values, and identifying an illegal pointer expression. 3) The second problem tasks the student with implementing constant folding optimization and considering an example where it could be unsafe. 4) The third problem involves determining the output of a program using both static and dynamic scoping. 5) The fourth problem asks the student to draw a runtime stack diagram and generate ILOC code for lexical scoping examples. 6) The fifth problem provides a test program to determine the parameter passing style through different printed outputs.

Uploaded by

Muhammad chaudhary
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PDF, TXT or read online on Scribd
You are on page 1/ 10

CS314 Spring 2023

Homework 4
Due Monday, March 27, 11:59pm
submission: pdf file through canvas

1 Problem — Pointers
Given the following correct program in C,
1. give the correct type definitions for pointer variables ra, rb, rc, raa, rbb, and rcc.

2. draw a picture that shows all of the variables and their contents similar to the
picture as shown, for example, in lecture 12, page 12. Also indicate whether the
object lives on the stack or on the heap. Your picture should show the variables
and their values just before the first print statement (*).
3. show the output from this program.

4. write a statement involving a pointer expression using the variables in this program
which is ILLEGAL given your declared types.

int main() {int a, b, c;


??? ra; ??? rb; ??? rc; ??? raa; ??? rbb; ??? rcc;
a = 3; b = 2; c = 1;
ra = &a;
rb = &b;
rc = &c;
ra = rb;
raa = &rb;
rc = *raa;
rcc = raa;
rc = &a;
rbb = &rc;
rb = &c;
*ra = 4;
*rb = *ra + 4;
/* (*) */
printf ("%d %d %d\n",a,b,c);
printf("%d %d\n",*ra,*rb);
printf("%d %d %d\n",**raa,**rbb,**rcc);
}
1
2 Problem — Compiler Optimization and Aliasing
Assume the following program fragement without any control flow branches (straight line
code). Your job is it to implement a compiler optimization called “constant folding” for
straight line code. This optimization identifies program variables with values that are
known at compile time. Expressions that consist of only such variables can be evaluated
at compile time. In our project, we do constant folding for ILOC instructions, not on the
source code itself.

begin
int a, b, c;
... /* some other declarations */
a = 4;
b = 3;
... /* no statements that mention ‘‘a’’ or ‘‘b’’ */
c = a - b; /* c == 1 ? */
print c;
end.

Would it always be safe for the compiler optimization of constant folding to replace the
assignment “c = a - b” by “c = 1” ? Note that there are no assignments to variables a or b
between “b = 3” and “c = a - b”. The control flow is linear, so there are no branches. Give
an example where constant propagation would be not be safe (incorrect) in this
situation, without violating any of the above assumptions about the code fragment. Note:
You can add declarations of other variables and other statements that do not mention a
or b.
2
3 Problem — Lexical/Dynamic Scoping
Assume variable names written as capital letters use dynamic scoping and variable
names written as lower case letters use static (lexical) scoping. Assume that procedures
return when execution reaches their last statement. Assume that all procedure names
are resolved using static (lexical) scoping. Show the output of the entire program
execution. Label the output with the location of the print statement (e.g.: (*2*): ...)).

program main()
{ int A, b;
procedure f()
{ int c;
procedure g()
{ int c;
c = 33;
... = ...b...
print A,b,c; //<<<------ (*1*)
end g;
}
print A,b; //<<<------------ (*2*)
A = 1; b = 2; c = 3;
call g();
print c; //<<<------------ (*3*)
end f;
}
procedure g()
{ int A,b;
A = 4; b = 9;
call f();
print A,b; //<<<----------(*4*)
end g;
}
A = 5; b = 3;
print A,b; //<<<------------ (*5*)
call g();
print A,b; //<<<----------(*6*)
end main;
}

3
4 Probem – Lexical Scoping Code Generation Assume
that all variables are lexically scoped.

program main()
{ int a, b;
procedure f()
{ int c;
procedure g()
{
... = b + c //<<<-------- (*A*)
print a,b,c;
end g;
}
a = 0; c = 1;
... = b + c //<<<-------- (*B*)
call g();
print c;
end f;
}
procedure g()
{ int a,b;
a = 3; b = 7;
call f();
print a,b;
end g;
}
a = 2; b = 3;
print a,b;
call g();
print a,b;
end main;
}
1. Show the runtime stack with its stack frames, access and control links, and local
variables when the execution reaches program point (*A*).
2. Give the ILOC RISC code for the expressions at program points (*A*) and (*B*).
The value of the expressions need to be loaded into a register. The particular
register numbers are not important here.

4
5 Problem – Parameter Passing
Assume that you don’t know what particular parameter passing style a programming lan
guage is using. In order to find out, you are asked to write a short test program that will
print a different output depending on whether a call-by-value, call-by-reference, or
call-by value-result parameter passing style is used. Your test program must have the
following form:

program main()
{ x integer;
procedure bar(integer a)
{
// statement body of foo
}

// statement body of main


x = 1;
call bar(x);
print x;
}

The body of procedure bar must only contain assignment statements. For instance, you
are not allowed to add any new variable declarations.

1. Write the body of procedure bar such that print x in the main program will print
different values for the different parameter passing styles.

2. Give the output of your test program and explain why your solution works.

You might also like