Fundamental Structures of Computer Science
Fundamental Structures of Computer Science
The Theory of Parsing, Translation, and Compiling
The Theory of Parsing, Translation, and Compiling
SIGPLAN '80 Proceedings of the ACM-SIGPLAN symposium on The ADA programming language
A simplified operator identification scheme for Ada
ACM SIGPLAN Notices
Rationale for the design of the Ada programming language
ACM SIGPLAN Notices - Rationale for the deisgn of the Ada programming language
A One-Pass Algorithm for Overload Resolution in Ada
ACM Transactions on Programming Languages and Systems (TOPLAS)
SIGPLAN '80 Proceedings of the ACM-SIGPLAN symposium on The ADA programming language
An Ada code generator for VAX 11/780 with Unix
SIGPLAN '80 Proceedings of the ACM-SIGPLAN symposium on The ADA programming language
SIGPLAN '80 Proceedings of the ACM-SIGPLAN symposium on Ada programming language
An Ada code generator for VAX 11/780 with Unix
SIGPLAN '80 Proceedings of the ACM-SIGPLAN symposium on Ada programming language
| Hi-index | 0.01 |
A technique for writing semantic analysis phases of compilers is described. The technique uses Simula classes and virtual procedures to create a flexible and modular program. This technique is used to implement a semantic analysis phase of a compiler front end for the preliminary Ada language. Because the design is extremely flexible and modular, the front end is able to accommodate changes in the Ada language and its semantics as they are published. Several problems were encountered when implementing Ada's semantics. These problems are described and their solutions presented. The front end also produces TCOLAda, the specified intermediate language for various Ada compiler contracts. This output has been used by an experimental compiler back end. [9] The front end is written as two programs which perform lexical analysis, syntactic analysis, semantic analysis, and TCOLAda generation. The front end is coded in Simula, and has been running on DEC Tops-10 and Tops-20 systems since September 1979.