PL360, a Programming Language for the 360 Computers
Journal of the ACM (JACM)
Structured Programming with go to Statements
ACM Computing Surveys (CSUR)
Use of transition matrices in compiling
Communications of the ACM
Design of a separable transition-diagram compiler
Communications of the ACM
The Theory of Parsing, Translation, and Compiling
The Theory of Parsing, Translation, and Compiling
Compiler Construction for Digital Computers
Compiler Construction for Digital Computers
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
Design and Implementation of a Diagnostic Compiler for PL/I
Design and Implementation of a Diagnostic Compiler for PL/I
Structured control in programming languages
ACM SIGPLAN Notices - Special issue on programming language design
Principles of Compiler Design (Addison-Wesley series in computer science and information processing)
Principles of Compiler Design (Addison-Wesley series in computer science and information processing)
| Hi-index | 0.00 |
Transition matrices are a well-known tool for the construction of bottom-up compilers. This paper discusses the use of transition matrices in the recursive-descent compiler for the structured assembly language PL/85. In this compiler, a transition matrix (TM) is a self-contained module which can recursively invoke other TMs. TM invocation and exit and state transitions are handled by a microcoded interpreter. It is shown that our use of TMs made the compiler easy to implement and maintain, considerably reduced the space requirements for the parser, and resulted in a reliable, efficient and flexible compiler with good error handling capabilities.