TY - GEN
T1 - COMPILER OPTIMIZATION BY DETECTING RECURSIVE SUBPROGRAMS.
AU - Skiena, Steven S.
PY - 1985
Y1 - 1985
N2 - A neglected aspect of compiler optimization concerns treating provably non-recursive routines differently than recursive ones. Possible code improvements resulting from this includes static variable allocation, faster call/return, application of the copy rule for expansion of programs, and stack reduction. Recursion detection algorithms are presented along with an empirical analysis of their performance on typical C language programs. Machine dependent performance is discussed for a variety of architectures.
AB - A neglected aspect of compiler optimization concerns treating provably non-recursive routines differently than recursive ones. Possible code improvements resulting from this includes static variable allocation, faster call/return, application of the copy rule for expansion of programs, and stack reduction. Recursion detection algorithms are presented along with an empirical analysis of their performance on typical C language programs. Machine dependent performance is discussed for a variety of architectures.
UR - https://www.scopus.com/pages/publications/0022279172
U2 - 10.1145/320435.320551
DO - 10.1145/320435.320551
M3 - Conference contribution
AN - SCOPUS:0022279172
SN - 0897911709
SN - 9780897911702
T3 - Proceedings of the Annual Conference of the Association for Computing Machinery
SP - 403
EP - 411
BT - Proceedings of the Annual Conference of the Association for Computing Machinery
PB - ACM
ER -