AbstractThis paper describes how an Abstract Programming Interface (api) and its implementation can be generated from the syntax definition of a data type. In particular we describe how a grammar (in Sdf) can be used to generate a library of access functions that manipulate the parse trees of terms over this syntax. Application of this technique in the Asf+Sdf Meta-Environment has resulted in the elimination of 47% of the handwritten code, thus greatly improving both maintainability of the tools and their flexibility with respect to changes in the parse tree format. Although the focus is on ATerms, the issues discussed and the techniques described are more generic and are relevant in related areas such as XML data-binding
Frequently source code analysis tools need to exchange internal representations of abstract syntax t...
Adaptable Parsing Expression Grammar (APEG) is a formal method for defining the syntax of programmin...
International audienceThis paper presents Gom, a language for describing abstract syntax trees and g...
Tree Manipulation; Using the ATerm-Library to represent tree-like data structures has become a popul...
AbstractThis paper describes how an Abstract Programming Interface (api) and its implementation can ...
Context: Meta programming consists for a large part of matching, analyzing, and transforming syntax ...
Modern parser generators typically require two components: an abstract syntax data structure and a ...
Component-based development of language tools stands in need of meta-tool support. This support can ...
Programmers in many fields are interested in building new languages. In the same way that high-level...
Abstract. When writing programs to manipulate structures such as algebraic ex-pressions, logical for...
When writing programs to manipulate structures such as algebraic expressions, logical formulas, proo...
Abstract syntax trees are a very common data-structure in language related tools. For example compil...
AbstractThis paper is about language technology for facilitating model-driven software development. ...
The notion of an abstract syntax is discussed. An algorithm is presented for automatically deriving ...
We describe an algorithm (written in Haskell) to automatically derive compact abstract syntax data t...
Frequently source code analysis tools need to exchange internal representations of abstract syntax t...
Adaptable Parsing Expression Grammar (APEG) is a formal method for defining the syntax of programmin...
International audienceThis paper presents Gom, a language for describing abstract syntax trees and g...
Tree Manipulation; Using the ATerm-Library to represent tree-like data structures has become a popul...
AbstractThis paper describes how an Abstract Programming Interface (api) and its implementation can ...
Context: Meta programming consists for a large part of matching, analyzing, and transforming syntax ...
Modern parser generators typically require two components: an abstract syntax data structure and a ...
Component-based development of language tools stands in need of meta-tool support. This support can ...
Programmers in many fields are interested in building new languages. In the same way that high-level...
Abstract. When writing programs to manipulate structures such as algebraic ex-pressions, logical for...
When writing programs to manipulate structures such as algebraic expressions, logical formulas, proo...
Abstract syntax trees are a very common data-structure in language related tools. For example compil...
AbstractThis paper is about language technology for facilitating model-driven software development. ...
The notion of an abstract syntax is discussed. An algorithm is presented for automatically deriving ...
We describe an algorithm (written in Haskell) to automatically derive compact abstract syntax data t...
Frequently source code analysis tools need to exchange internal representations of abstract syntax t...
Adaptable Parsing Expression Grammar (APEG) is a formal method for defining the syntax of programmin...
International audienceThis paper presents Gom, a language for describing abstract syntax trees and g...