Canonical Abstract Syntax Trees

被引：6
|
作者：
Reilles, Antoine [1 ]
机构：
[1] CNRS & LORIA, Campus Sci,BP 239, F-54506 Vandoeuvre Les Nancy, France
来源：
ELECTRONIC NOTES IN THEORETICAL COMPUTER SCIENCE | 2007年 / 176卷 / 04期
关键词：
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 条
  • [31] Canonical morphology and syntax
    Kulikov, Leonid
    JOURNAL OF LINGUISTICS, 2014, 50 (02) : 507 - 512
  • [32] Canonical morphology and syntax
    Arkadev, P. M.
    Curbett, G. G.
    VOPROSY YAZYKOZNANIYA, 2014, (05): : 153 - 159
  • [33] Control-Flow-Only Abstract Syntax Trees for Analyzing Students' Programming Progress
    Hovemeyer, David
    Hellas, Arto
    Petersen, Andrew
    Spacco, Jaime
    PROCEEDINGS OF THE 2016 ACM CONFERENCE ON INTERNATIONAL COMPUTING EDUCATION RESEARCH (ICER'16), 2016, : 63 - 72
  • [34] PassSum: Leveraging paths of abstract syntax trees and self-supervision for code summarization
    Niu, Changan
    Li, Chuanyi
    Ng, Vincent
    Ge, Jidong
    Huang, Liguo
    Luo, Bin
    JOURNAL OF SOFTWARE-EVOLUTION AND PROCESS, 2023, 36 (06)
  • [35] CoCoAST: Representing Source Code via Hierarchical Splitting and Reconstruction of Abstract Syntax Trees
    Ensheng Shi
    Yanlin Wang
    Lun Du
    Hongyu Zhang
    Shi Han
    Dongmei Zhang
    Hongbin Sun
    Empirical Software Engineering, 2023, 28
  • [36] Learning-Based Recursive Aggregation of Abstract Syntax Trees for Code Clone Detection
    Buech, Lutz
    Andrzejak, Artur
    2019 IEEE 26TH INTERNATIONAL CONFERENCE ON SOFTWARE ANALYSIS, EVOLUTION AND REENGINEERING (SANER), 2019, : 95 - 104
  • [37] fAST: regular expression inference from positive examples using Abstract Syntax Trees
    Raynal, Maxime
    Buob, Marc-Olivier
    Quenot, Georges
    INTERNATIONAL CONFERENCE ON GRAMMATICAL INFERENCE, VOL 217, 2023, 217 : 96 - 116
  • [38] CoCoAST: Representing Source Code via Hierarchical Splitting and Reconstruction of Abstract Syntax Trees
    Shi, Ensheng
    Wang, Yanlin
    Du, Lun
    Zhang, Hongyu
    Han, Shi
    Zhang, Dongmei
    Sun, Hongbin
    EMPIRICAL SOFTWARE ENGINEERING, 2023, 28 (06)
  • [39] Canonical Morphology and Syntax
    Peti-Stantic, Anita
    SUVREMENA LINGVISTIKA, 2014, 40 (78): : 213 - 217
  • [40] How does a program run? A visual model based on Annotating Abstract Syntax Trees
    Choppella, Venkatesh
    Ahuja, Garima
    Mavalankar, Aditi
    PROCEEDINGS OF 2016 INTERNATIONAL CONFERENCE ON LEARNING AND TEACHING IN COMPUTING AND ENGINEERING (LATICE 2016), 2016, : 38 - 42
12345