Josef Grosch. Ast - A Generator for Abstract Syntax Trees. Technical report, Gesellschaft fuer Mathematik und Datenverarbeitung, Forschungstelle Karlsruhe, August 1989. Language manual.  Home/Search   Document Not in Database   Summary   Related Articles   Check

....for a transformation, perhaps in text. 2. Define the data model of your application, i.e. define which parts of the knowledge you want to present should be objects and which should be relations. This can be done either in Java, with the syntax of the tool AST from the GMD toolbox Cocktail [GE90] [Gro89], or within the context of the compiler model CoSy in CoSy fSDL [Buh95] 3. Design of the data manipulation, i.e. formulate graph rewrite systems that compute and transform the graphs that were defined in the data model. Build graphs with edge addition rewrite systems (EARS) and transform ....

....in AST standalone mode, and in CoSy fSDL mode. Java mode OPTIMIX can read Java classes to filter out type, graph, and set definitions. In this case the output language is Java. AST standalone mode OPTIMIX is able to read existing data model specifications of AST (with small restrictions) GE90] [Gro89]. This means that existing AST data specifications of compilers can be reused and extended for use with OPTIMIX. AST data definitions are module based and AST modules may occur within OPTIMIX specification files. Thus AST data definition language can also be used as standalone data definition ....

Josef Grosch. Ast - A Generator for Abstract Syntax Trees. Technical report, Gesellschaft fuer Mathematik und Datenverarbeitung, Forschungstelle Karlsruhe, August 1989. Language manual.

....for a transformation, perhaps in text. 2. Define the data model of your application, i.e. define which parts of the knowledge you want to present should be objects and which should be relations. This can be done either in Java, with the syntax of the tool AST from the GMD toolbox Cocktail [GE90] [Gro89], or within the context of the compiler model CoSy in CoSy fSDL [Buh95] 3. Design of the data manipulation, i.e. formulate graph rewrite systems that compute and transform the graphs that were defined in the data model. Build graphs with edge addition rewrite systems (EARS) and ....

....AST standalone mode, and in CoSy fSDL mode. Java mode OPTIMIX can read Java classes to filter out type, graph, and set definitions. In this case the output language is Java. AST standalone mode OPTIMIX is able with small restrictions to read existing data model specifications of AST [GE90] [Gro89]. Existing AST data specifications of compilers can be reused and extended for use with OPTIMIX. AST data definitions are module based and AST modules may occur within OPTIMIXspecification files. Thus AST data definition language can also be used as standalone data definition language of OPTIMIX. ....

Josef Grosch. Ast - A Generator for Abstract Syntax Trees. Technical report, Gesellschaft fuer Mathematik und Datenverarbeitung, Forschungstelle Karlsruhe, August 1989. Language manual.

....specication is explained. OPTIMIX specications are grouped in modules (data model and graph rewrite modules) which can be combined and reused AEexibly. The data model of the graphs is dened by a simple extension of the AST data denition language from the compiler construction toolbox Cocktail [Gro##] so that existing AST data speci cations can be reused and extended. Also, users can connect other tool environments easily by implementing an abstract interface module for graphs, nodes, and edges. OPTIMIX also supports a CoSy mode in which code is generated for the CoSy compiler construction ....

Josef Grosch. Ast - A Generator for Abstract Syntax Trees. Technical report, Gesellschaft fuer Mathematik und Datenverarbeitung, Forschungstelle Karlsruhe, August ####. Language manual.

....specification is explained. Optimix specifications are grouped in data model and graph rewrite modules which can be combined and reused flexibly. The data model of the graphs is defined by a simple extension of the AST data definition language from the compiler construction toolbox Cocktail [7]. Existing AST data specifications can be reused and extended. Users can connect other tool environments easily by implementing an abstract interface module for graphs. Additionally, Optimix supports the CoSy compiler framework [6] OptimixModule : ASTDataModule GraphRewriteModule . ....

....to new tool environments. Hence we believe that Optimix provides a valuable practical tool which saves a lot of coding work in program transformation. A free version of the tool can be fetched from its home page [12] 1. 4 Appendix Optimix s data definition language is similar to that of AST [7]. Node types (classes) consist of a collection of fields. Inner classes in angle brackets inherit from outer classes (simple inheritance) Fields of set and graph types are bracketed with ( MODULE ExampleData TREE IntermediateRepresentation RULES mirProcedure = the procedure type ....

Josef Grosch. Ast - A Generator for Abstract Syntax Trees. Technical report, Gesellschaft fuer Mathematik und Datenverarbeitung, Forschungstelle Karlsruhe, August 1989. Language manual.

....on the match and make paradigm. Intermediate representations in compiler frameworks There exist numerous frameworks for compilers and programming environments that provide facilities for representing intermediate data. Examples are Centaur s VTP [BCD 89] Eli [GHL 92] Cocktail s Ast [Gro92] SUIF [WFW 94] ASDL [WAKS97] and Montana [Kar98] These systems either provide an explicit intermediate format (Eli, Ast, SUIF) or they provide a programmable interface to the intermediate data (VTP, Montana, ASDL) Lamb s IDL [Lam87] and OMG s IDL [OMG97] are frameworks for representing ....

J. Grosch. Ast -- a generator for abstract syntax trees. Technical Report 15, GMD Karlsruhe, 1992.

....target language. Whenever a grammar rule is recognized by the parser generator, the associated semantic action is executed. A mechanism for S attribution (only synthesized attributes) is provided to allow communication between the semantic actions. 2.1.2. 3 Generator for Abstract Syntax Trees Ast [8] is a generator for program modules that defines the structure of abstract syntax trees and provides general tree manipulating procedures. The defined trees may be decorated with attributes of arbitrary types. The structure of the trees is specified by a formalism based on context free grammars. ....

Josef Grosch. Ast - A Generator for Abstract Syntax Trees. Technical Report Compiler Generation Report No. 15, GMD Forschungsstelle an der Universitat Karlsruhe, Aug. 1992.

....the engines writers for accessing the pool of data. 1.1 Related work In the Gandalf programming support environment [HN86] tools share a representation based on the abstract syntax of the language being supported, and all the tools are written in a single language. A similar approach is taken in [Gro90, CIL89]. IDL [Sno89] and NewGen [JT89] generalize these ideas in the Gandalf project, so that tools could potentially be built in different languages. This generalization has resulted in identifying a set of pre defined types as internal types, while others are external types. The result of such a ....

....combined with an operation such as and . In addition, short hands can be used for common situations. 3. 3 The Domain Calculus In f SDL a choice is made to define specifications in terms of a calculus (rather than, perhaps, a solely constructive definition style such as found in, for example, [Gro90]) 3. f SDL, domains and the domain calculus 7 There are several considerations. ffl The calculus allows for constructive specification without the need for local completeness. That is, conservative extensions can be made without altering the global specification (or unrelated code) ffl The ....

J. Grosch. Ast -- a generator for abstract syntax trees. Report 15, GMD, Karlsruhe, Karlsruhe, September 1990.

....formula CORNER CORNER C O R N E R C O R N E R oe formula CORNER CORNER C O R N E R C O R N E R oe Figure 2: The specification of the layout of quotients with G 2 F power of the system. The reader also gets an impression of the specification languages of the compiler construction tools Ast [15] and Ag [14] used in the construction of the enhanced version of G 2 F . The resulting attribution rules are modular and still relatively easy to understand. These two properties are very important when the extension of the generated definitions or their modification is concerned. The generated ....

J. Grosch. AST - a generator for abstract syntax trees. Technical report, Gesellschaft fur Mathematik und Datenverarbeitung, 1989.

....of an OPTIMIX specification. OPTIMIX specifications are module based and consist of data definition modules as well as graph rewrite modules. The data model of the graphs is defined by a simple extension of the data definition language of AST from the compiler construction toolbox Cocktail [Gro89]. The extension of the AST syntax is explained elsewhere [A m96] however, existing AST data specifications can be reused and extended for use with OPTIMIX. OPTIMIX also supports a CoSyfSDL mode in which code is generated for the CoSy compiler construction environment [AAvS94] OptimixModule : ....

Josef Grosch. Ast - A Generator for Abstract Syntax Trees. Technical report, Gesellschaft fuer Mathematik und Datenverarbeitung, Forschungstelle Karlsruhe, August 1989. Language manual.

....target language. Whenever a grammar rule is recognized by the parser generator, the associated semantic action is executed. A mechanism for S attribution (only synthesized attributes) is provided to allow communication between the semantic actions. 2.1.2. 3 Generator for Abstract Syntax Trees Ast [8] is a generator for program modules that defines the structure of abstract syntax trees and provides general tree manipulating procedures. The defined trees may be decorated with attributes of arbitrary types. The structure of the trees is specified by a formalism based on context free grammars. ....

Josef Grosch. Ast - A Generator for Abstract Syntax Trees. Technical Report Compiler Generation Report No. 15, GMD Forschungsstelle an der Universitat Karlsruhe, Aug. 1992.

....the toolbox, and the user manuals of the tools that are cited in the following text as detailed references about the tools. The COCKTAIL toolbox consists of the following tools: REX [12] Lexical analyzer (scanner) generator LALR [13, 14] LALR(1) parser generator ELL [13] LL(1) parser generator AST [15] Generator for abstract syntax trees AG [16] Attribute evaluator generator PUMA [17] Generator for the transformation of attributed trees REUSE [18, 19] Library of reusable modules CG, RPP [20] Preprocessors The COCKTAIL tools discussed in this chapter are designed to work in UNIX operating ....

Grosch, J. "Ast - A Generator for Abstract Syntax Trees", Compiler Generation Report No. 15, GMD Forschungsstelle an der Universitat Karlsruhe, 1992.

....for a transformation, perhaps in text. 2. Define the data model of your application, i.e. define which parts of the knowledge you want to present should be objects and which should be relations. This can be done either with the syntax of the tool AST from the GMD toolbox Cocktail [GE90] [Gro89], or within the context of the compiler model CoSy in CoSy fSDL [Buh95] 3. Design of the data manipulation, i.e. formulate graph rewrite systems that compute and transform the graphs that were defined in the data model. Build graphs with edge addition rewrite systems (EARS) and transform ....

....a flatform file which contains all fSDL specifications in a flat form. OPTIMIX must read this file to know about the data model (option ff) CHAPTER 1. GENERAL TOPICS 7 AST standalone mode OPTIMIX is able to read existing data model specifications of AST (with small restrictions) GE90] [Gro89]. This means that existing AST data specifications of compilers can be reused and extended for use with OPTIMIX. AST data definitions are module based and AST modules may occur within OPTIMIX specification files. Thus AST data definition language can also be used as standalone data definition ....

Josef Grosch. Ast - A Generator for Abstract Syntax Trees. Technical report, Gesellschaft fuer Mathematik und Datenverarbeitung, Forschungstelle Karlsruhe, August 1989. Language manual.

Online articles have much greater impact   More about CiteSeer.IST   Add search form to your site   Submit documents   Feedback  

CiteSeer.IST - Copyright Penn State and NEC