A note on some compiling algorithms

Authors:
James P. Anderson
Affiliations:
Burroughs Corporation, Paoli, PA
Venue:
Communications of the ACM
Year:
1964

Citing 0
Cited 11

The Generation of Optimal Code for Arithmetic Expressions

Journal of the ACM (JACM)
The Generation of Optimal Code for Stack Machines

Journal of the ACM (JACM)
Code Generation for a One-Register Machine

Journal of the ACM (JACM)
Instruction Sets for Evaluating Arithmetic Expressions

Journal of the ACM (JACM)
The role of programming in a Ph.D. computer science program

Communications of the ACM
On compiling algorithms for arithmetic expressions

Communications of the ACM
A unified approach to global program optimization

POPL '73 Proceedings of the 1st annual ACM SIGACT-SIGPLAN symposium on Principles of programming languages
A survey of compiler optimization techniques

ACM '73 Proceedings of the ACM annual conference
A formal approach to code optimization

Proceedings of a symposium on Compiler optimization
Scope conserving expression evaluation: a class of storage optimal evaluation strategies for arithmetic expressions

ACM SIGPLAN Notices
A host computer system for software development

ACM '74 Proceedings of the 1974 annual ACM conference - Volume 2

Quantified Score

Hi-index	48.25

Visualization

Abstract

Two compiling generators for arithmetic expressions are discussed: one presently in use in an experimental compiler, and an improvement suggested by K. Speierman of Burroughs.