Block structures, indirect addressing, and garbage collection

Subscribe (Full Service)


	Search: The ACM Digital Library The Guide

	Feedback

Block structures, indirect addressing, and garbage collection

Full text

Pdf (539 KB)

Source

Communications of the ACM archive
Volume 12 , Issue 7 (July 1969) table of contents

Pages: 395 - 398

Year of Publication: 1969

ISSN:0001-0782

Author

R. Y. Kain

Univ. of Minnesota, Minneapolis

Publisher

ACM New York, NY, USA

Bibliometrics

Downloads (6 Weeks): 7, Downloads (12 Months): 23, Citation Count: 4

Additional Information:

abstract references cited by index terms collaborative colleagues

Tools and Actions:	Request Permissions Review this Article Save this Article to a Binder Display Formats: BibTeX EndNote ACM Ref

DOI Bookmark:	Use this link to bookmark this Article: http://doi.acm.org/10.1145/363156.363175 What is a DOI?

ABSTRACT

Programming languages have included explicit or implicit block structures to provide a naming convenience for the programmer. However, when indirect addressing is used, as in SNOBOL, naming constraints may be introduced. Two modifications to SNOBOL are described, resulting in two desirable consequences: (1) naming constraints disappear even when there is indirect addressing within function definitions; and (2) there is a significant saving in the number of calls to the garbage collector, because some garbage is collected, at little expense, each time a function returns to its calling program. These modifications have been implemented as an extension to a SNOBOL dialect.

REFERENCES

Note: OCR errors may be found in this Reference List extracted from the full text article. ACM has opted to expose the complete List rather than only correct and linked references.

	1	BAILEY, F. N. AND KAIN, R. Y. An exact description of a SNOBOL dialect. Rep. No. CS101-68 (1968), U. Minnesota Center for Control Sciences, Minneapolis, Minn.
	2	GARBER, D., GRISWOLD, R. E., AND POLONSKY, I. P. The SNOBOL3 Programming Language. Bell Syst. Tech. J. J5 (1966), 895-943.
	3	Donald E. Knuth, The art of computer programming, volume 1 (3rd ed.): fundamental algorithms, Addison Wesley Longman Publishing Co., Inc., Redwood City, CA, 1997
	4	Stuart E. Madnick, String processing techniques, Communications of the ACM, v.10 n.7, p.420-424, July 1967 [doi>10.1145/363427.363444]
	5	H. Schorr , W. M. Waite, An efficient machine-independent procedure for garbage collection in various list structures, Communications of the ACM, v.10 n.8, p.501-506, Aug. 1967 [doi>10.1145/363534.363554]

CITED BY 4

	Saleh E. Abdullahi , Graem A. Ringwood, Garbage collecting the Internet: a survey of distributed garbage collection, ACM Computing Surveys (CSUR), v.30 n.3, p.330-373, Sept. 1998
	Jacques Cohen, Garbage Collection of Linked Data Structures, ACM Computing Surveys (CSUR), v.13 n.3, p.341-367, Sept. 1981
	John C. Reynolds, G/EDANKEN—a simple typeless language based on the principle of completeness and the reference concept, Communications of the ACM, v.13 n.5, p.308-319, May 1970
	E. F. Storm , R. H. Vaughan, Vulcan: a string handling language with dynamic storage control, Proceedings of the November 17-19, 1970, fall joint computer conference, November 17-19, 1970, Houston, Texas