• Documents
  • Authors
  • Tables
  • Log in
  • Sign up
  • MetaCart
  • DMCA
  • Donate

CiteSeerX logo

Advanced Search Include Citations
Advanced Search Include Citations

DMCA

Canonical Abstract Syntax Trees (2006)

Cached

  • Download as a PDF

Download Links

  • [hal.inria.fr]
  • [arxiv.org]
  • [arxiv.org]
  • [arxiv.org]
  • [hal.inria.fr]
  • [www.loria.fr]
  • [rewerse.net]
  • [rewerse.eu]

  • Save to List
  • Add to Collection
  • Correct Errors
  • Monitor Changes
by Antoine Reilles
Venue:WRLA 2006
Citations:17 - 6 self
  • Summary
  • Citations
  • Active Bibliography
  • Co-citation
  • Clustered Documents
  • Version History

BibTeX

@MISC{Reilles06canonicalabstract,
    author = {Antoine Reilles},
    title = { Canonical Abstract Syntax Trees},
    year = {2006}
}

Share

Facebook Twitter Reddit Bibsonomy

OpenURL

 

Abstract

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.

Keyphrases

canonical abstract syntax tree    rewrite system    data structure    many implementation    client program    internal representation    normal form    abstract syntax tree    canonical form    java implementation   

Powered by: Apache Solr
  • About CiteSeerX
  • Submit and Index Documents
  • Privacy Policy
  • Help
  • Data
  • Source
  • Contact Us

Developed at and hosted by The College of Information Sciences and Technology

© 2007-2019 The Pennsylvania State University