ACM

Communications of the ACM

Home/Magazine Archive/June 1977 (Vol. 20, No. 6)/June 1977 (Vol. 20, No. 6)/Abstract

Notes on recursion elimination

By R. S. Bird
Communications of the ACM, June 1977, Vol. 20 No. 6, Pages 434-439
10.1145/359605.359630
Comments

View as: Print Mobile App ACM Digital Library Full Text (PDF) Share:

Various methods of recursion elimination are applied to the schematic recursive procedure: proc S(x); px then N(x); S(ƒx); S(gx); M(x) fi. Procedures with this general form arise in connection with tree traversal and sorting algorithms. Each method of recursion removal involves the use of one or more stacks, and the solutions are compared on the basis of their running time.

The full text of this article is premium content

No entries found

Log in to Read the Full Article

Sign In

Sign in using your ACM Web Account username and password to access premium content if you are an ACM member, Communications subscriber or Digital Library subscriber.

Need Access?

Please select one of the options below for access to premium content and features.

Create a Web Account

If you are already an ACM member, Communications subscriber, or Digital Library subscriber, please set up a web account to access premium content on this site.

Join the ACM

Become a member to take full advantage of ACM's outstanding computing information resources, networking opportunities, and other benefits.

Subscribe to Communications of the ACM Magazine

Get full access to 50+ years of CACM content and receive the print version of the magazine monthly.

Purchase the Article

Non-members can purchase this article or a copy of the magazine in which it appears.