AbstractThis 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
Traditionally, an attribute grammar is presented as a context-free grammar which is augmented with a...
Extensible programming languages allow users to create fundamentally new syntax and translate this s...
Paragon is a programming language that extends Java with statically checked information flow control...
This paper presents GOM, a language for describing abstract syntax trees and generating a Java imple...
International audienceThis paper presents Gom, a language for describing abstract syntax trees and g...
textabstractAbstract syntax trees are a very common data-structure in language related tools. For ex...
This paper presents an object-oriented technique for rewriting abstract syntax trees in order to sim...
Syntax trees are a very common data structure in language related tools. For example, compilers, int...
This thesis presents an object-oriented technique for rewriting abstract syntax trees in order to si...
When writing programs to manipulate structures such as algebraic expressions, logical formulas, proo...
Abstract This paper presents OpenJava, which is a macro system that we have developed for Java. With...
A syntax-directed editing environment intended for development of artificial languages, e.g. program...
Context: Meta programming consists for a large part of matching, analyzing, and transforming syntax ...
AbstractThis paper describes how an Abstract Programming Interface (api) and its implementation can ...
This paper introduces compiler construction basics with JavaCC and focuses on paradigms of language ...
Traditionally, an attribute grammar is presented as a context-free grammar which is augmented with a...
Extensible programming languages allow users to create fundamentally new syntax and translate this s...
Paragon is a programming language that extends Java with statically checked information flow control...
This paper presents GOM, a language for describing abstract syntax trees and generating a Java imple...
International audienceThis paper presents Gom, a language for describing abstract syntax trees and g...
textabstractAbstract syntax trees are a very common data-structure in language related tools. For ex...
This paper presents an object-oriented technique for rewriting abstract syntax trees in order to sim...
Syntax trees are a very common data structure in language related tools. For example, compilers, int...
This thesis presents an object-oriented technique for rewriting abstract syntax trees in order to si...
When writing programs to manipulate structures such as algebraic expressions, logical formulas, proo...
Abstract This paper presents OpenJava, which is a macro system that we have developed for Java. With...
A syntax-directed editing environment intended for development of artificial languages, e.g. program...
Context: Meta programming consists for a large part of matching, analyzing, and transforming syntax ...
AbstractThis paper describes how an Abstract Programming Interface (api) and its implementation can ...
This paper introduces compiler construction basics with JavaCC and focuses on paradigms of language ...
Traditionally, an attribute grammar is presented as a context-free grammar which is augmented with a...
Extensible programming languages allow users to create fundamentally new syntax and translate this s...
Paragon is a programming language that extends Java with statically checked information flow control...