Skip Navigation

The Computer Journal 1979 22(2):151-154; doi:10.1093/comjnl/22.2.151
© 1979 by British Computer Society
This Article
Right arrow Full Text (PDF)
Right arrow Alert me when this article is cited
Right arrow Alert me if a correction is posted
Services
Right arrow Email this article to a friend
Right arrow Similar articles in this journal
Right arrow Similar articles in ISI Web of Science
Right arrow Alert me to new issues of the journal
Right arrow Add to My Personal Archive
Right arrow Download to citation manager
Right arrowRequest Permissions
Google Scholar
Right arrow Articles by Bird, R. S.
Right arrow Search for Related Content
Social Bookmarking
Add to CiteULike   Add to Connotea   Add to Del.icio.us  
What's this?

Recursion elimination with variable parameters

R. S. Bird *

Department of Computer Science, University of Reading, Whiteknights Park, Reading, UK

Standard methods of recursion elimination are not immediately applicable to recursive procedures which posses variable (reference, name) parameters. Two methods of overcoming this problem are described. One method involves a transformation which replaces such parameters with constant ones, while the second involves the creation of a new level of reference variables, a device only possible in a language such as ALGOL 68. As examples of the techniques, iterative versions of a procedure to build a balanced tree are derived in both ALGOL 68 and PASCAL.

Received January 1978.

* Department of Computer Science, University of Reading, Whiteknights Park, Reading RG6 2AX


Add to CiteULike CiteULike   Add to Connotea Connotea   Add to Del.icio.us Del.icio.us    What's this?




Disclaimer:
Please note that abstracts for content published before 1996 were created through digital scanning and may therefore not exactly replicate the text of the original print issues. All efforts have been made to ensure accuracy, but the Publisher will not be held responsible for any remaining inaccuracies. If you require any further clarification, please contact our Customer Services Department.