Recursion analysis for compiler optimization

A relatively simple method for the detection of recursive use of procedures is presented for use in compiler optimization. Implementation considerations are discussed, and a modification of the algorithm is given to further improve optimization. This analysis can also be used to determine what possi...

Full description

Saved in:
Bibliographic Details
Published in:Communications of the ACM 1976-09, Vol.19 (9), p.514-516
Main Author: Walter, Kenneth G.
Format: Magazinearticle
Language:English
Citations: Items that cite this one
Online Access:Get full text
Tags: Add Tag
No Tags, Be the first to tag this record!
Description
Summary:A relatively simple method for the detection of recursive use of procedures is presented for use in compiler optimization. Implementation considerations are discussed, and a modification of the algorithm is given to further improve optimization. This analysis can also be used to determine what possible subset of values could be assumed by variables which can only take on a relatively small discrete set of values. The most common are parameters of variables assuming values of label, procedure, or Pascal's enumerated type.
ISSN:0001-0782
1557-7317
DOI:10.1145/360336.360341