Affiliation:
1. Univ. of California, Berkeley
Abstract
A formalism is presented for describing the actions of processors for programming languages—compilers, interpreters, assemblers—and their interactions in complex systems such as compiler-compilers or extendible languages. The formalism here might be used to define and answer such a question as “Can one do bootstrapping using a metacompiler whose metaphase is interpretive?” In addition an algorithm is presented for deciding whether or not a given system can be produced from a given set of component processors.
Publisher
Association for Computing Machinery (ACM)
Cited by
25 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献
1. Implementation Strategies;Texts in Computer Science;2022
2. A minimalistic verified bootstrapped compiler (proof pearl);Proceedings of the 10th ACM SIGPLAN International Conference on Certified Programs and Proofs;2021-01-17
3. Generating Efficient Predictive Shift-Reduce Parsers for Hyperedge Replacement Grammars;Software Technologies: Applications and Foundations;2018
4. Bootstrapping domain-specific meta-languages in language workbenches;ACM SIGPLAN Notices;2017-05-12
5. Bootstrapping domain-specific meta-languages in language workbenches;Proceedings of the 2016 ACM SIGPLAN International Conference on Generative Programming: Concepts and Experiences;2016-10-20