The Community for Technology Leaders
Green Image
Issue No. 01 - January-March (1990 vol. 12)
ISSN: 1058-6180
pp: 41-49
ABSTRACT
<p>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.</p>
INDEX TERMS
CITATION
F. L. Bauer, "The Cellar Principle of State Transition and Storage Allocation", IEEE Annals of the History of Computing, vol. 12, no. , pp. 41-49, January-March 1990, doi:10.1109/MAHC.1990.10004
101 ms
(Ver 3.1 (10032016))