A functional semantics of attribute grammars

被引：0
|
作者：
Backhouse, K [1 ]
机构：
[1] Univ Oxford, Comp Lab, Oxford OX1 3QD, England
来源：
TOOLS AND ALGORITHMS FOR THE CONSTRUCTION AND ANAYLSIS OF SYSTEMS, PROCEEDINGS | 2002年 / 2280卷
关键词：
D O I：
暂无
中图分类号：
TP31 [计算机软件];
学科分类号：
081202 ; 0835 ;
摘要：
A definition of the semantics of attribute grammars is given, using the lambda calculus. We show how this semantics allows us to prove results about attribute grammars in a calculational style. In particular, we give a new proof of Chirica and Martin's result [6], that the attribute values can be computed by a structural recursion over the tree. We also derive a new definedness test, which encompasses the traditional closure and circularity tests. The test is derived by abstract interpretation.
引用
收藏
页码：142 / 157
页数：16
相关论文
共 50 条
12345