Report on the algorithmic language ALGOL 68
Report on the algorithmic language ALGOL 68
| Hi-index | 0.00 |
Some questions of run-time storage management for ALGOL 68 are discussed. In the first section it is shown that in many cases copying of already existing values is not necessary, in spite of the fact that the Report prescribes this. The second section gives a new approach for finding the starting points for tracing the lists of values during garbage collection. In the third section we introduce a new area (in addition to the stack and the heap) for making the garbage collection process less expensive. The fourth section describes the general memory organization: stack, heap and bubble.