论文信息 - The Generation of Optimal Code for Stack Machines

The Generation of Optimal Code for Stack Machines

The problem of generating "optimal" programs for the evaluation of arithmetic expressions on a machine with a finite depth stack is studied. Efficient algorithms are given for constructing optimal programs in the case where the expressions are trees, there are no data dependencies, and the o p e r a t o r s have limited algebraic properties.

J. Bruno | T. Lassagne

[1] Journal of the Association for Computing Machinery , 1961, Nature.

[2] James P. Anderson. A note on some compiling algorithms , 1964, CACM.

[3] Ikuo Nakata,et al. On compiling algorithms for arithmetic expressions , 1967, CACM.

[4] Roman R. Redziejowski. On arithmetic expressions and trees , 1969, CACM.

[5] Jeffrey D. Ullman,et al. The Generation of Optimal Code for Arithmetic Expressions , 1970, JACM.