BIB-VERSION:: CS-TR-v2.0
          ID:: STAN//CS-TR-76-544
       ENTRY:: July 04, 1995
ORGANIZATION:: Stanford University, Department of Computer Science
       TITLE:: Removing trivial assignments from programs
        TYPE:: Technical Report
      AUTHOR:: Mont-Reynaud, Bernard
        DATE:: March 1976
       PAGES:: 38
    ABSTRACT:: An assignment X $\leftarrow$ Y 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.
       NOTES:: [Adminitrivia V1/Prg/19950704]
         END:: STAN//CS-TR-76-544