A Description of a Cooperative Venture in the Production of an Automatic Coding System
Journal of the ACM (JACM)
The arithmetic translator-compiler of the IBM FORTRAN automatic coding system
Communications of the ACM
The Preparation of Programs for an Electronic Digital Computer (Charles Babbage Institute Reprint)
The Preparation of Programs for an Electronic Digital Computer (Charles Babbage Institute Reprint)
A view of the origins and development of Prolog
Communications of the ACM
The Cellar Principle of State Transition and Storage Allocation
IEEE Annals of the History of Computing - Special issue on the history of computing in France—machines
A Descriptive Language for Symbol Manipulation
Journal of the ACM (JACM)
A Translator-Oriented Symbolic Programming Language
Journal of the ACM (JACM)
Single-Scan Techniques for the Translation of Arithmetic Expressions in ALGOL 60
Journal of the ACM (JACM)
Journal of the ACM (JACM)
Exploratory experimental studies comparing online and offline programming performance
Communications of the ACM
Information science in a Ph.D. computer science program
Communications of the ACM
Use of transition matrices in compiling
Communications of the ACM
Communications of the ACM
WATFOR—The University of Waterloo FORTRAN IV compiler
Communications of the ACM
Bounded context syntactic analysis
Communications of the ACM
FORTRAN IV as a syntax language
Communications of the ACM
High speed compilation of efficient object code
Communications of the ACM
Some techniques used in the ALCOR ILLINOIS 7090
Communications of the ACM
Recursive processes and ALGOL translation
Communications of the ACM
An algorithm for coding efficient arithmetic operations
Communications of the ACM
On the compilation of subscripted variables
Communications of the ACM
Some proposals for improving the efficiency of ALGOL 60
Communications of the ACM
A syntax controlled generator of formal language processors
Communications of the ACM
SIGACT news complexity theory column 35
ACM SIGACT News
On-line modeling by curve-fitting
Proceedings of the 1972 SIGGRAPH seminar on Computer graphics in medicine
Program control via transition matrices—a novel application of micro-programming
SIGMINI '76 Proceedings of the ACM SIGMINI/SIGPLAN interface meeting on Programming systems in the small processor environment
The European side of the last phase of the development of ALGOL 60
ACM SIGPLAN Notices - Special issue: History of programming languages conference
ACM SIGPLAN Notices - Special issue: History of programming languages conference
Proceedings of a symposium on Compiler optimization
The evaluation, classification and interpretation of expressions
ACM '64 Proceedings of the 1964 19th ACM national conference
From the stack principle to ALGOL
Software pioneers
ACM SIGPLAN Notices
The Structure of Formula-Translators
ALGOL Bulletin
ALGOL Bulletin
The European side of the last phase of the development of ALGOL 60
History of programming languages I
History of programming languages I
Program control via transition matrices: a novel application of micro-programming
ACM SIGMICRO Newsletter
A new approach to the functional design of a digital computer
IRE-AIEE-ACM '61 (Western) Papers presented at the May 9-11, 1961, western joint IRE-AIEE-ACM computer conference
A computer for direct execution of algorithmic languages
AFIPS '61 (Eastern) Proceedings of the December 12-14, 1961, eastern joint computer conference: computers - key to total systems control
Application of pushdown-store machines
AFIPS '63 (Fall) Proceedings of the November 12-14, 1963, fall joint computer conference
AFIPS '64 (Spring) Proceedings of the April 21-23, 1964, spring joint computer conference
Remote computing--an experimental system: part 2: internal design
AFIPS '64 (Spring) Proceedings of the April 21-23, 1964, spring joint computer conference
Serial compilation and the 1401 FORTRAN compiler
IBM Systems Journal
Agent-oriented programming: from prolog to guarded definite clauses
Agent-oriented programming: from prolog to guarded definite clauses
| Hi-index | 48.48 |
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-symbol 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.