Applications of language theory to compiler design

Authors:
J. D. Ullman
Affiliations:
Princeton University, Princeton, New Jersey
Venue:
AFIPS '72 (Spring) Proceedings of the May 16-18, 1972, spring joint computer conference
Year:
1971

Citing 15
Cited 0

Syntactic Analysis and Operator Precedence

Journal of the ACM (JACM)
Syntax-Directed Transduction

Journal of the ACM (JACM)
Total Precedence Relations

Journal of the ACM (JACM)
Weak and Mixed Strategy Precedence Parsing

Journal of the ACM (JACM)
An efficient context-free parsing algorithm

Communications of the ACM
Simple LR(k) grammars

Communications of the ACM
A practical method for constructing LR (k) processors

Communications of the ACM
EULER: a generalization of ALGOL and it formal definition: Part 1

Communications of the ACM
A syntax directed compiler for ALGOL 60

Communications of the ACM
The theory of parsing, translation, and compiling

The theory of parsing, translation, and compiling
The care and feeding of LR(k) grammars

STOC '71 Proceedings of the third annual ACM symposium on Theory of computing
Translations on a context free grammar

STOC '69 Proceedings of the first annual ACM symposium on Theory of computing
Some properties of precedence languages

STOC '69 Proceedings of the first annual ACM symposium on Theory of computing
Syntax directed mappings of context Free languages

SWAT '68 Proceedings of the 9th Annual Symposium on Switching and Automata Theory (swat 1968)
Extended precedence languages, bounded right context languages, anti deterministic languages

SWAT '70 Proceedings of the 11th Annual Symposium on Switching and Automata Theory (swat 1970)

Quantified Score

Hi-index	0.00

Visualization

Abstract

There are certain aspects of language theory that have had, or can have, significant impact on the design and implementation of compilers. These areas are, principally, the subjects of context free grammars and syntax directed translations. It is perhaps to be expected that the deep and interesting theorems of language theory do not usually find application. Rather, it is the definitions of formal constructs and their elementary properties that find use.