A nonrecursive list compacting algorithm

Abstract

A simple nonrecursive list structure compacting scheme or garbage collector suitable for both compact and LISP-like list structures is presented. The algorithm avoids the need for recursion by using the partial structure as it is built up to keep track of those lists that have been copied.

References

1. 1 HANSEN, W. J. Compact list representation: definition, garbage collection and system implementation. Comm. ACM 12, 9 (Sept. 1969), 499-507.
2. 2 FENICHEL, R. R., AND YOCHELSON, J. C. A LISP garbagecollector for virtual memory computer symstems. Comm. ACM 12, 11 (Nov. 1969), 611-612.
3. 3 KNUTH, D. E. The Art of Computer Programming Vol. 1 Fundamental Algorithms. Addison-Wesley, Reading, Mass., 1968, pp. 417-419.