• DocumentCode
    878675
  • Title

    The Cellar Principle of State Transition and Storage Allocation

  • Author

    Bauer, F.L.

  • Volume
    12
  • Issue
    1
  • fYear
    1990
  • Firstpage
    41
  • Lastpage
    49
  • 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.
  • Keywords
    Arithmetic; Connectors; History; Instruments; Logic programming; Mathematics; Proposals; Relays; Software systems; Tail;
  • fLanguage
    English
  • Journal_Title
    Annals of the History of Computing
  • Publisher
    ieee
  • ISSN
    0164-1239
  • Type

    jour

  • DOI
    10.1109/MAHC.1990.10004
  • Filename
    4637515
    • Link To Document
    https://search.isc.ac/dl/search/defaultta.aspx?DTC=49&DC=878675