Canonical Abstract Syntax Trees

被引:6
|
作者
Reilles, Antoine [1 ]
机构
[1] CNRS & LORIA, Campus Sci,BP 239, F-54506 Vandoeuvre Les Nancy, France
关键词
syntax trees; GOM; data representation; rewrite system;
D O I
10.1016/j.entcs.2007.06.014
中图分类号
TP301 [理论、方法];
学科分类号
081202 ;
摘要
This paper presents GOM, a language for describing abstract syntax trees and generating a Java implementation for those trees. GOM includes features allowing the user to specify and modify the interface of the data structure. These features provide in particular the capability to maintain the internal representation of data in canonical form with respect to a rewrite system. This explicitly guarantees that the client program only manipulates normal forms for this rewrite system, a feature which is only implicitly used in many implementations.
引用
收藏
页码:165 / 179
页数:15
相关论文
共 50 条