The Cellar Principle of State Transition and Storage Allocation

Authors:
F. L. Bauer
Affiliations:
-
Venue:
IEEE Annals of the History of Computing - Special issue on the history of computing in France—machines
Year:
1990

Citing 14
Cited 2

A General Translation Program for Phrase Structure Languages

Journal of the ACM (JACM)
Two Families of Languages Related to ALGOL

Journal of the ACM (JACM)
Bounded context syntactic analysis

Communications of the ACM
“Structural connections” in formal languages

Communications of the ACM
Recursive processes and ALGOL translation

Communications of the ACM
A syntax directed compiler for ALGOL 60

Communications of the ACM
Sequential formula translation

Communications of the ACM
A syntax controlled generator of formal language processors

Communications of the ACM
The arithmetic translator-compiler of the IBM FORTRAN automatic coding system

Communications of the ACM
From formulas to computer oriented language

Communications of the ACM
An algebraic translator

Communications of the ACM
Historical Remarks on Compiler Construction

Compiler Construction, An Advanced Course, 2nd ed.
Addendum

Compiler Construction, An Advanced Course, 2nd ed.
Introduction to Mathematical Machine Theory

Introduction to Mathematical Machine Theory

Counter-Constrained Finite State Machines: A New Model for Component Protocols with Resource-Dependencies

SOFSEM '02 Proceedings of the 29th Conference on Current Trends in Theory and Practice of Informatics: Theory and Practice of Informatics
From the stack principle to ALGOL

Software pioneers

Quantified Score

Hi-index	0.00

Visualization

Abstract

The grammar of arithmetic formulas was the pilot example for developing parsing techniques for Chomsky grammars. It is shown how stacks were introduced and how they turned out to be powerful instruments within compilers by controlling state transitions at compile time and storage allocation at run time.