A study on the run-time storage management for recursice and nested structure

Recursive nested 구조를 위한 run-time 기억장소 운영에 관한 연구

PASCAL has a recursive nested structure and uses deep binding of identifiers. This paper studies the problems and techniques in storage management for PASCAL on the IBM 370 system, and presents run-time storage administration algorithms which use stack scheme and heap efficiently on the view of storage. The stack-scheme was used to implement the feature of recursive nested structure and the heap was used to implement the feature of the dynamic allocation procedure and pointer variable, allowing an additional dynamic storage recovery procedure.