4,091 views

Consider the following program skeleton and below figure which shows activation records of procedures involved in the calling sequence. $$p \rightarrow s \rightarrow q \rightarrow r \rightarrow q.$$Write the access links of the activation records to enable correct access and variables in the procedures from other procedures involved in the calling sequence

procedure p;
procedure q;
procedure r;
begin
q
end r;
begin
r
end q;
procedure s;
begin
q
end s;
begin
s
end p;


2 Comments

@kenzou, @Arjun Sir. Please format the code appropriately.

4 Answers

Best answer

When procedure $p$ begins, $s$ is called $[p\to s].$ $s$ is enclosed within $p.$ So, any undeclared variable found inside $s$ will be searched for inside the body within which it is enclosed i.e., function $p$ (static scoping rules). So access link is from s to p.

Now, $s$ is visited and $s$ calls $q$ $[p\to s \to q].$ $q$ is visited and begin execution. Any undeclared variable found inside $q$ will be searched inside the enclosing function i.e. $p$ again. So, access link is from q to p.

Now, $q$ calls $r$ $[p \to s \to q \to r].$ $r$ is visited. $r$ begins execution and any undeclared variable found is searched in the enclosing function i.e., $q$ here. So, access link is from r to q.

$r$ calls $q$ $[p\to s \to q \to r \to q]:$  This is the sequence of calls which is already given in the question.

We have already seen access links for $q.$

So, it becomes

4 Comments

If there is no end q... Then we don't know upto where it's extended. But here not the case, so i strongly believe those are at same level. ( it's my opinion only ).

I think it is a old question, so there might be some error in the question.

It may be possible.

@ankitgupta.1729 Is the indentation fine now?

@Arjun sir, yes fine now. Thank you.

Reference :- NPTEL

4 Comments

Nice explanation

Isn’t in the second diagram for static chain s is connected with p instead of q..?

@ASNR1010 Question was different when I had written the answer. The pseudocode mentioned in this answer was the question previously. You can check the comments of the best answer..Indentation issue was there initially..

@ankitgupta.1729

Actually, I was confused by seeing two different answers before. but your nptel link made it clear thanks.

An activation record has the following parts:-

1. A control link from record A points to the previous record on the stack. The chain of control links traces the dynamic execution of the program.
2. An access link from record A points to the record of the closest enclosing block in the program. The chain of access links traces the static structure (think: scopes) of the program.

Going by the definition of the access link we have the record of the closest enclosing block in the program as mentioned.

The access link for the above ques is as follows:

$$p \rightarrow q \rightarrow r \rightarrow q \rightarrow s$$

4 Comments

p==>s==>q==>r==>q i think this is the sequence
Can someone please provide "C" equivalent of this ..
@jatin function can not define in another function but it can declared in C

Activation records keep track of values as a program executes. More specificly, an activation record has a set of names that are bound to values. We link activation records together in two ways:

• with a control link
• with an access link

control link from record A points to the previous record on the stack. The chain of control links traces the dynamic execution of the program.

An access link from record A points to the record of the closest enclosing block in the program. The chain of access links traces the static structure (think: scopes) of the program.

https://www.cs.hmc.edu/~benw/teaching/notes/activation.html

now come to answer

P is  enclosed by  main function

so Access_link(P)--->main()
similarly    S is  enclosed by  P
Access_link(S)--->P()

and so on
Access_link(Q)--->P()
Access_link(R)---->Q()  because R is enclosed by Q

4 votes
1 answer
1
18 votes
1 answer
2
1 vote
1 answer
3
3 votes
2 answers
4
1,110 views