A nonrecursive list compacting algorithm
- 1 November 1970
- journal article
- Published by Association for Computing Machinery (ACM) in Communications of the ACM
- Vol. 13 (11) , 677-678
- https://doi.org/10.1145/362790.362798
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.Keywords
This publication has 2 references indexed in Scilit:
- A LISP garbage-collector for virtual-memory computer systemsCommunications of the ACM, 1969
- Compact list representationCommunications of the ACM, 1969