Implementation of simple stack allocation scheme
Answers
Answered by
0
Explanation:
The implementation of simple stack allocation scheme:
Activation record contains the locals so that they are bound to fresh storage in each activation record. The value of local is deleted when the activation ends. It works on the basis of last in first out (LIFO) and this is allocation
Similar questions