Accession Number:

ADA021572

Title:

Removing Trivial Assignments from Programs.

Descriptive Note:

Technical rept.,

Corporate Author:

STANFORD RESEARCH INST MENLO PARK CALIF

Personal Author(s):

• Mont-Reynaud,Bernard

Report Date:

1976-03-01

Pagination or Media Count:

30.0

Abstract:

An assignment Y to X in a program is trivial when both X and Y are simple program variables. The paper describes a transformation which removes all such assignments from a program P, producing a program P which executes faster than P but usually has a larger size. The number of variables used by P is also minimized. Worst-case analysis of the transformation algorithm leads to nonpolynomial bounds. Such inefficiency, however, does not arise in typical situations, and the technique appears to be of interest for practical compiler optimization.

Descriptors:

• *OPTIMIZATION
• *COMPILERS
• ALGORITHMS
• COMPUTER PROGRAMMING
• FORTRAN
• RECURSIVE FUNCTIONS

Subject Categories:

• Computer Programming and Software

Distribution Statement:

APPROVED FOR PUBLIC RELEASE