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 条
  • [21] VAST - Visualization of Abstract Syntax Trees within Language Processors Courses
    Almeida-Martinez, Francisco J.
    Urquiza-Fuentes, Jaime
    Velazquez-Iturbide, J. Angel
    SOFTVIS 2008: PROCEEDINGS OF THE 4TH ACM SYMPOSIUM ON SOFTWARE VISUALIZATION, 2008, : 209 - 210
  • [22] Generator of efficient strongly typed abstract syntax trees in Java']Java
    van den Brand, M
    Moreau, PE
    Vinju, J
    IEE PROCEEDINGS-SOFTWARE, 2005, 152 (02): : 70 - 78
  • [23] PSIMINER: A Tool for Mining Rich Abstract Syntax Trees from Code
    Spirin, Egor
    Bogomolov, Egor
    Kovalenko, Vladimir
    Bryksin, Timofey
    2021 IEEE/ACM 18TH INTERNATIONAL CONFERENCE ON MINING SOFTWARE REPOSITORIES (MSR 2021), 2021, : 13 - 17
  • [24] CAST: Enhancing Code Summarization with Hierarchical Splitting and Reconstruction of Abstract Syntax Trees
    Shi, Ensheng
    Wang, Yanlin
    Du, Lun
    Zhang, Hongyu
    Han, Shi
    Zhang, Dongmei
    Sun, Hongbin
    2021 CONFERENCE ON EMPIRICAL METHODS IN NATURAL LANGUAGE PROCESSING (EMNLP 2021), 2021, : 4053 - 4062
  • [25] Thinking in Blocks: Implications of Using Abstract Syntax Trees as the Underlying Program Model
    Wendel, Daniel
    Medlock-Walton, Paul
    2015 IEEE BLOCKS AND BEYOND WORKSHOP (BLOCKS AND BEYOND), 2015, : 63 - 66
  • [26] An automatic approach to detecting and eliminating lazy classes based on abstract syntax trees
    Hu, Zhigang, 1600, Transport and Telecommunication Institute, Lomonosova street 1, Riga, LV-1019, Latvia (18):
  • [27] Detection of near-miss clones using metrics and Abstract Syntax Trees
    Vishwachi
    Gupta, Sonam
    PROCEEDINGS OF THE 2017 INTERNATIONAL CONFERENCE ON INVENTIVE COMMUNICATION AND COMPUTATIONAL TECHNOLOGIES (ICICCT), 2017, : 230 - 234
  • [28] Cross-language clone detection by learning over abstract syntax trees
    Perez, Daniel
    Chiba, Shigeru
    IEEE International Working Conference on Mining Software Repositories, 2019, 2019-May : 518 - 528
  • [29] AST-Transformer: Encoding Abstract Syntax Trees Efficiently for Code Summarization
    Tang, Ze
    Li, Chuanyi
    Ge, Jidong
    Shen, Xiaoyu
    Zhu, Zheling
    Luo, Bin
    2021 36TH IEEE/ACM INTERNATIONAL CONFERENCE ON AUTOMATED SOFTWARE ENGINEERING ASE 2021, 2021, : 1193 - 1195
  • [30] Abstract syntax from concrete syntax
    Wile, DS
    PROCEEDINGS OF THE 1997 INTERNATIONAL CONFERENCE ON SOFTWARE ENGINEERING, 1997, : 472 - 480
12345