Systematic recursion removal
- 1 February 1978
- journal article
- Published by Association for Computing Machinery (ACM) in Communications of the ACM
- Vol. 21 (2) , 127-134
- https://doi.org/10.1145/359340.359344
Abstract
The recursion removal algorithm presented by Strong and Walker is amplified and applied to a relatively complex PL/I program. The aim is to demonstrate systematic recursion-removal techniques on something more complex than Knuth's “sturdy toddler” and to obtain measurements of the cost of procedure linkage in PL/I and the savings achievable via procedure integration in the presence of recursion. First, the paper describes the recursion-removal process and the example on which it will be illustrated. Recursion removal is then applied to the two major parts of this example and the final result of the process is displayed. Our performance comparison results are presented, and our conclusions are briefly discussedKeywords
This publication has 6 references indexed in Scilit:
- Notes on recursion eliminationCommunications of the ACM, 1977
- On Simple Goedel Numberings and TranslationsSIAM Journal on Computing, 1975
- Structured Programming with go to StatementsACM Computing Surveys, 1974
- Characterizations of flowchartable recursionsJournal of Computer and System Sciences, 1973
- Procedure linkage optimization working paperPublished by Association for Computing Machinery (ACM) ,1973
- Translating recursion equations into flow chartsJournal of Computer and System Sciences, 1971