# Homework 5 (Runtime Stack, Scoping, Parameter Passing)

\$35.00 \$29.05

Category:

## Description

Exercise 1. Runtime Stack

Consider the following block. Assume static scoping and call-by-value parameter passing.

• { int x;

• int y;

• y := 1;

• { int f(int x) {

• if x=0 then {

• y := 1 }

• else {

• y := f(x-1)*y+1 };

• return y;

1. };

1. x := f(2);

1. };

1. }

Illustrate the computations that take place during the evaluation of this block, that is, draw a sequence of pictures each showing the complete runtime stack with all activation records after each statement or function call.

Note. Do not use the alternative model of “temporary stack evaluation” that was briefly illustrated on slides 20 and 25 to explain the implementation given in FunStatScope.hs and FunRec.hs. Rather use one stack onto which a new activation record is pushed on each recursive function call.

1

 CS 381, Spring 2020, Homework 5 2

Exercise 2. Static and Dynamic Scope

Consider the following block. Assume call-by-value parameter passing.

• { int x;

• int y;

• int z;

• x := 3;

• y := 7;

• { int f(int y) { return x*y };

• int y;

• y := 11;

• { int g(int x) { return f(y) };

1. { int y;

1. y := 13;

1. z := g(2);

1. };

1. };

1. };

1. }

1. Which value will be assigned to z in line 12 under static scoping?

1. Which value will be assigned to z in line 12 under dynamic scoping?

It might be instructive to draw the runtime stack for different times of the execution, but it is not strictly required.

Exercise 3. Parameter Passing

Consider the following block. Assume dynamic scoping.

• { int y;

• int z;

• y := 7;

• { int f(int a) {

• y := a+1;

• return (y+a)

• };

• int g(int x) {

• y := f(x+1)+1;

1. z := f(x-y+3);

1. return (z+1)

1. }

1. z := g(y*2);

1. };

1. }

What are the values of y and z at the end of the above block under the assumption that both parameters a and x are passed:

1. Call-by-Name

1. Call-by Need

It might be instructive to draw the runtime stack for different times of the execution, but it is not strictly required.