A general-purpose table-driven compiler

Authors:
Stephen Warshall;Robert M. Shapiro
Affiliations:
Computer Associates, Inc., Wakefield, Massachusetts;Computer Associates, Inc., Wakefield, Massachusetts
Venue:
AFIPS '64 (Spring) Proceedings of the April 21-23, 1964, spring joint computer conference
Year:
1964

Citing 3
Cited 6

A syntax directed compiler for ALGOL 60

Communications of the ACM
Report on the algorithmic language ALGOL 60

Communications of the ACM
A syntax directed generator

AFIPS '61 (Eastern) Proceedings of the December 12-14, 1961, eastern joint computer conference: computers - key to total systems control

Universal programming languages and processors: a brief survey and new concepts

AFIPS '65 (Fall, part I) Proceedings of the November 30--December 1, 1965, fall joint computer conference, part I
Syntax-directed compiling

AFIPS '64 (Spring) Proceedings of the April 21-23, 1964, spring joint computer conference
An experimental general purpose compiler

AFIPS '67 (Spring) Proceedings of the April 18-20, 1967, spring joint computer conference
The design and implementation of a table driven compiler system

AFIPS '67 (Spring) Proceedings of the April 18-20, 1967, spring joint computer conference
On the basis for ELF: an extensible language facility

AFIPS '68 (Fall, part II) Proceedings of the December 9-11, 1968, fall joint computer conference, part II
A linguistics oriented programming language

IJCAI'73 Proceedings of the 3rd international joint conference on Artificial intelligence

Quantified Score

Hi-index	0.00

Visualization

Abstract

If a compiler is to generate efficient object code, there are several different kinds of optimization which should take place. Each of these optimization procedures has a preferred domain: that is, some algorithms prefer to operate over the input string, others over the tree which describes the syntax of the string, others over the "macro-instructions" which are generated from the tree, and so forth. In an earlier paper, one of the present authors pointed out the necessity for employing the tree form in particular as a natural domain for optimizers which consider syntactic context and suggested that, just as Irons and others had built general-purpose table-driven parsing algorithms, one could also build a general-purpose table-driven program for getting from trees to macro-instructions. The final compiler design presented here is the result of pursuing that kind of thinking somewhat farther.