Removing Trivial Assignments from Programs.

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.

Document Details

Document Type
Technical Report
Publication Date
Mar 01, 1976
Accession Number
ADA021572

Entities

People

  • Bernard Mont-reynaud

Organizations

  • SRI International

Tags

DTIC Thesaurus Topics

  • Algorithms
  • Compilers
  • Evolutionary Algorithms
  • Heuristic Methods
  • Mathematics
  • Optimization

Fields of Study

  • Computer science
  • Mathematics

Readers

  • Approximation Theory.
  • Computer Science.
  • Educational Psychology