6533b834fe1ef96bd129de6b

RESEARCH PRODUCT

Sequential formula translation

Friedrich L. BauerK. Samelson

subject

Algorithmic languageSequenceRecursionGeneral Computer ScienceSyntax (programming languages)Computer scienceSimple (abstract algebra)Programming languageElement (category theory)Translation (geometry)computer.software_genreSyntaxcomputer

description

The syntax of an algorithmic language such as ALGOL is conveniently described as a sequence of states indicated by an element called cellar. Transitions are controlled by admissible state- s ymbol pairs which may be represented by a transition matrix. This description of syntax furnishes at the same time an extremely simple rule for translating into machine programs statements in the algorithmic language. Sequential treatment, however, is not feasible in the case of certain optimizing processes such as recursive address calculation.

yearjournalcountryeditionlanguage
1983-01-01Communications of the ACM
https://doi.org/10.1145/357980.357983