A compiler writing system with optimization capabilities for complex object order structures
- Author:
- Stephen Gibbs Wasilew
Abstract
No abstract available.
Cited By
Aho A and Ganapathi M Efficient tree pattern matching (extended abstract) Proceedings of the 12th ACM SIGACT-SIGPLAN symposium on Principles of programming languages, (334-340)- Krumme D and Ackley D A practical method for code generation based on exhaustive search Proceedings of the 1982 SIGPLAN symposium on Compiler construction, (185-196)
- Krumme D and Ackley D (2019). A practical method for code generation based on exhaustive search, ACM SIGPLAN Notices, 17:6, (185-196), Online publication date: 1-Jun-1982.
- Aho A, Johnson S and Ullman J Code generation for expressions with common subexpressions (Extended Abstract) Proceedings of the 3rd ACM SIGACT-SIGPLAN symposium on Principles on programming languages, (19-31)
- Aho A and Johnson S Optimal code generation for expression trees Proceedings of the seventh annual ACM symposium on Theory of computing, (207-217)
Recommendations
META II a syntax-oriented compiler writing language
ACM '64: Proceedings of the 1964 19th ACM national conferenceMETA II is a compiler writing language which consists of syntax equations resembling Backus normal form and into which instructions to output assembly language commands are inserted. Compilers have been written in this language for VALGOL I and VALGOL ...
A Transportable Programming Language (TPL) System. II. The Bifunctional Compiler System
The transportable programming language (TPL) method is a high-level-language approach that uses a bifunctional compiler to efficiently convert code among various dialects of a particular high-level language (HLL) via the hypothetical parent of the high-...