Code Selection by Inversion of Order-Sorted Derivors
Code Selection by Inversion of Order-Sorted Derivors
复制标题
通过逆序导数进行代码选择
DOI：
10.1016/0304-3975(90)90145-8
复制
发表时间：
1990
期刊：
影响因子：
--
通讯作者：
R. Giegerich
中科院分区：
文献类型：
--
作者：
R. Giegerich
这项工作的目标是提供一个通用框架的模式匹配方法的代码选择问题的以下属性：最近的方法可以在这个框架中重新公式化和比较，它适应了用于定义中间语言的增加的表达能力，它提供了用于代码选择器规范的完整性的形式标准，它使用了已知模式匹配技术的直接概括，它提供了一种新的方法来集成代码生成的“非语法”子任务与模式匹配过程。这些性质通过将模式匹配公式化为构造有序项代数之间的层次导子的逆问题来实现。
The goal of this work is to provide a general framework for the pattern matching approach to the code selection problem with the following properties: recent approaches can be reformulated and compared in this framework, it accommodates increased expressive power for defining intermediate languages, it provides formal criteria for the completeness of a code selector specification, it uses a straightforward generalization of known pattern matching techniques, it offers a new way to integrate the “nonsyntactic” subtasks of code generation with the pattern matching process.These properties are achieved by formulating pattern matching as the problem of constructing an inverse to a hierarchic derivor between order-sorted term algebras.