Question: 2 Problem 2 _- Lexical Scoping This problem uses the following program. This program uses static (lexical) scoping procedure main () nt a procedure foo

 2 Problem 2 _- Lexical Scoping This problem uses the following

program. This program uses static (lexical) scoping procedure main () nt a

2 Problem 2 _- Lexical Scoping This problem uses the following program. This program uses static (lexical) scoping procedure main () nt a procedure foo (int i): in procedure bar(int j): procedure recurse (int k): print b; b:= b / 2; recurse (k + 1); else bar(k) recurse (1); foo (4); print a; (a) What does this program print? (b) Rewrite this program, with all non-parameter variables replaced by (level,offset) pairs. (c) Show the stack frames at the beginning of function bar (before the instruction a:-j; is executed). Label each frame with its procedure's name, and make sure you include the local variables and their values. Show all access links and control links between the stack frames, and the frame pointer (FP), by drawing arrows. You should use the frame lavout in the below figure 2 Problem 2 _- Lexical Scoping This problem uses the following program. This program uses static (lexical) scoping procedure main () nt a procedure foo (int i): in procedure bar(int j): procedure recurse (int k): print b; b:= b / 2; recurse (k + 1); else bar(k) recurse (1); foo (4); print a; (a) What does this program print? (b) Rewrite this program, with all non-parameter variables replaced by (level,offset) pairs. (c) Show the stack frames at the beginning of function bar (before the instruction a:-j; is executed). Label each frame with its procedure's name, and make sure you include the local variables and their values. Show all access links and control links between the stack frames, and the frame pointer (FP), by drawing arrows. You should use the frame lavout in the below figure

Step by Step Solution

There are 3 Steps involved in it

1 Expert Approved Answer
Step: 1 Unlock blur-text-image
Question Has Been Solved by an Expert!

Get step-by-step solutions from verified subject matter experts

Step: 2 Unlock
Step: 3 Unlock

Students Have Also Explored These Related Databases Questions!