| Abstract: | Two problems involving the use of dynamic lists in Pascal are (1) the limited size of the heap and (2) the difficulty in creating copies of complex multi-linked structures. Both these problems can be solved by writing the appropriate segment of memory to a file on disk. The heap segment may then be released. To recover the structure during a later phase of processing, the contents of the file can be transferred back onto the heap. This paper presents an algorithm to implement this solution. |
