The Cellar Principle of State Transition and Storage Allocation
Friedrich Ludwig Bauer · IEEE Annals of the History of Computing · 1990
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.