Efficient annotated terms
TL;DR: The abstract data type of Annotated Terms (ATerms) is introduced, and their design, implementation and application are discussed.
read more
Abstract: How do distributed applications exchange tree-like data structures? We introduce the abstract data type of Annotated Terms (ATerms) and discuss their design, implementation and application. A comprehensive procedural interface enables creation and manipulation of ATerms in C or Java. The ATerm implementation is based on maximal subterm sharing and automatic garbage collection. A binary exchange format for the concise representation of ATerms (sharing preserved) allows the fast exchange of ATerms between applications. In a typical application---parse trees which contain considerable redundant information---less than 2 bytes are needed to represent a node in memory, and less than 2 bits are needed to represent it in binary format. The implementation of ATerms scales up to the manipulation of ATerms in the giga-byte range.
read more
Chat with Paper
AI Agents for this Paper
Find similar papers on Google Scholar, PubMed and Arxiv
Write a critical review of this paper
Analyze citations of this paper to find unaddressed research gaps
Figures
Citations
Pellet: A practical OWL-DL reasoner
TL;DR: Pellet is the first sound and complete OWL-DL reasoner with extensive support for reasoning with individuals, user-defined datatypes, and debugging support for ontologies.
3K
Stratego/XT 0.17. A language and toolset for program transformation
TL;DR: An overview ofStratego/XT 0.17 is given, including a description of the Stratego language and XT transformation tools; a discussion of the implementation techniques and software engineering process; and a descriptionof applications built with Strate go/XT.
346
Concrete syntax for objects: domain-specific language embedding and assimilation without restrictions
Martin Bravenboer,Eelco Visser +1 more
- 01 Oct 2004
TL;DR: MetaBorg is described, a method for providing concrete syntax for domain abstractions to application programmers by embedding domain-specific languages in a general purpose host language and assimilating the embedded domain code into the surrounding host code.
•Posted Content
Compiling Language Definitions: The ASF+SDF Compiler
TL;DR: The ASF+SDF meta-environment as mentioned in this paper is an interactive language development environment whose main application areas are definition of domain-specific languages, generation of program analysis and transformation tools, production of software renovation tools, and general specification and prototyping.
203
Elkhound: A Fast, Practical GLR Parser Generator
Scott McPeak
- 06 Jan 2003
TL;DR: Elkhound is an implementation of the Generalized LR (GLR) parsing algorithm that allows the user to associate arbitrary C++ code with reduction actions, while retaining full control of sharing and disambiguation, but powerful enough to elegantly handle the dark corners of real-world languages.
165
References
•Book
The Java Language Specification
James Gosling,Bill Joy,Guy L. Steele +2 more
- 12 Sep 1996
TL;DR: The Java Language Specification, Second Edition is the definitive technical reference for the Java programming language and provides complete, accurate, and detailed coverage of the syntax and semantics of the Java language.
•Book
Garbage collection: algorithms for automatic dynamic memory management
Richard Jones,Rafael Dueire Lins +1 more
- 08 Aug 1996
TL;DR: The Classical Algorithms: A Treatise on Reference Counting.
1.1K
A meta-environment for generating programming environments
Paul Klint
- 01 Jan 1990
TL;DR: In this paper, the authors describe the design and implementation of a meta-environment (a development environment for formal language definitions) based on the formalism ASF + SDF.
212