Thumbnail
Access Restriction
Subscribed

Author Strong, H. R. ♦ Auslander, M. A.
Source ACM Digital Library
Content type Text
Publisher Association for Computing Machinery (ACM)
File Format PDF
Language English
Subject Keyword Procedure integration ♦ Recursion elimination ♦ Recursion removal ♦ Procedure linkage ♦ Optimization
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 discussed
Description Affiliation: IBM Thomas J. Watson Research Center, Yorktown Heights, NY (Auslander, M. A.; Strong, H. R.)
Age Range 18 to 22 years ♦ above 22 year
Educational Use Research
Education Level UG and PG
Learning Resource Type Article
Publisher Date 2005-08-01
Publisher Place New York
Journal Communications of the ACM (CACM)
Volume Number 21
Issue Number 2
Page Count 8
Starting Page 127
Ending Page 134


Open content in new tab

   Open content in new tab
Source: ACM Digital Library