论文信息 - A less dynamic memory allocation scheme for algol-like languages

A less dynamic memory allocation scheme for algol-like languages

The conventional storage allocation scheme for block structured languages requires the allocation of stack space and the building of a display with each procedure call. This paper describes a technique for analyzing the call graph of a program in a block structured language that makes it possible to eliminate these operations from many call sequences, even in the presence of recursion.

Thomas P. Murtagh

[1] Edsger W. Dijkstra,et al. Notes on structured programming , 1970 .

[2] Alfred V. Aho,et al. The theory of parsing, translation, and compiling. 1: Parsing , 1972 .

[3] John Cocke,et al. A program data flow analysis procedure , 1976, CACM.

[4] Kenneth G. Walter. Recursion analysis for compiler optimization , 1976, CACM.

[5] Alfred V. Aho,et al. Principles of Compiler Design (Addison-Wesley series in computer science and information processing) , 1977 .

[6] Karl Andreas Winklmann. A theoretical study of some aspects of parameter passing in algol60 and in similar programming languages. , 1977 .

[7] Andrew S. Tanenbaum,et al. Implications of structured programming for machine architecture , 1978, CACM.

[8] William E. Weihl,et al. Interprocedural data flow analysis in the presence of pointers, procedure variables, and label variables , 1980, POPL '80.

[9] Butler W. Lampson,et al. Fast procedure calls , 1982, ASPLOS I.

[10] Niklaus Wirth,et al. Program development by stepwise refinement , 1971, CACM.