A practical method for LR and LL syntactic error diagnosis and recovery
ACM Transactions on Programming Languages and Systems (TOPLAS)
Optimal code generation for expression trees: an application BURS theory
POPL '88 Proceedings of the 15th ACM SIGPLAN-SIGACT symposium on Principles of programming languages
The essence of compiling with continuations
PLDI '93 Proceedings of the ACM SIGPLAN 1993 conference on Programming language design and implementation
Typechecking and modules for multimethods
ACM Transactions on Programming Languages and Systems (TOPLAS)
Automatic Derivation of Code Generators from Machine Descriptions
ACM Transactions on Programming Languages and Systems (TOPLAS)
Efficient Dynamic Look-Up Strategy for Multi-Methods
ECOOP '94 Proceedings of the 8th European Conference on Object-Oriented Programming
Natural language processing implementation on Romanian Chatbot
SMO'09 Proceedings of the 9th WSEAS international conference on Simulation, modelling and optimization
Hi-index | 0.00 |
Any large software system is much easier to understand and implement if the designer takes care with the fundamental abstractions and interfaces. Each phase is implemented as one or more software modules. The semantic analyses of a compiler must translate abstract syntax into abstract machine code. It can do this after type-checking, or at the same time. Though it is possible to translate directly to real machine code, this hinders portability and modularity. Suppose we want compilers for N different source languages, targeted to M different machine. In principle this is N-M compilers, a large implementation task.