Year: 1983
Type: article
Abstract: 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.
Source: Communications of the ACM
Authors: K. Samelson, F. L. Bauer
Institution: Johannes Gutenberg University Mainz
Language: English
Subfield: Software
Field: Computer Science
Domain: Physical Sciences
Keywords: Algol, state transitions, transition matrix, cellar
Open Access status: bronze
OpenAlex ID: W2042041510
