M. G. J. van den Brand, H. A. de Jong, P. Klint, and P. A. Olivier. Efficient annotated terms. Software---Practice & Experience, 30:259--291, 2000.  Home/Search   Document Details and Download   Summary   Related Articles   Check

....representing software in the context of program comprehension. In particular we refer to the following: Ada Semantic Interface Specification (ASIS) 1] An ISO ratified [17] open source API written in Ada95 for accessing information from the Ada95 Compilation Environment. Annotated Terms (ATerms) [36, 35] An exchange format and an API that represents data produced by parsers, structural editors, compilers and other components in software reengineering tools. InterMediate Language (IML) 7] A portable intermediate representation developed by Project Bauhaus [2] Resource Graph (RG) 7] An ....

M. van den Brand, H. de Jong, P. Klint, and P. Olivier. "Efficient Annotated Terms". Software, Practice & Experience, 30:259--291, 2000.

....to support component based development of program transformations. Figure 1 gives an overview of the individual tool packages that are bundled by XT. At the heart of XT PGEN Stratego GPP Grammar Base Grammar Tools ATermLibrary XT Figure 1: XT is a bundle of packages. lies the ATERM library [1]. The ATERM format is a generic tree representation format, for which the ATERM library provides space and time efficient support. Within XT, the ATERM format is used as a common exchange format for parse trees and abstract syntax trees. The Stratego package contains the Stratego compiler [12] ....

M. van den Brand, H. Jong, P. Klint, and P. Olivier. Efficient Annotated Terms. Software, Practice & Experience, 30(3):259--291, 2000.

....with rules to apply and thus make it possible to develop libraries of reusable transformation strategies. The CodeBoost C transformation framework provides a library of standard transformation rules and strategies on C programs. Intermediate output from CodeBoost is in the ATerm format [5], and is primarily useful for Stratego programs, but is also accessible from C, C and Java, and is easily parsable. The final output is readable C code. ....

M. G. J. van den Brand, H.A. de Jong, P. Klint, and P.A. Olivier. Efficient annotated terms. Software, Practice & Experience, 30(3):259--291, 2000.

....Language centered software engineering is supported by the tool bundle XT [15] XT, which stands for Program Transformation Tools , bundles various related transformation tool packages into a single distribution. These packages include a generalized LR parser and parser generator [28] ATERMs [2] as uniform exchange format, the transformational programming language Stratego [29] and the generic pretty printer GPP [13] Furthermore, XT contains an extensive collection of grammar related tools and the Grammar Base [14] a collection of reusable grammars. XT is free software, requires ....

M. G. J. van den Brand, H. A. de Jong, P. Klint, and P. A. Olivier. Efficient annotated terms. Software, Practice & Experience, 30(3):259--291, 2000.

....systems. Its purpose is to minimize installation effort, verify that all components work together, and to provide extensive documentation and instructions about how to use this tooling together. The following tool packages are bundled by XT: 2 XT: program transformation tools ffl ATERMs [3] This is a generic format for representing annotated trees and is used within XT as common tree exchange format to connect individual components to form transformation systems. There are two representations for ATERMs: a human readable, textual representation and a space efficient binary ....

M.G.J. van den Brand, H.A. de Jong, P. Klint, and P.A. Olivier. Efficient Annotated Terms. Software, Practice & Experience, 30(3):259--291, 2000.

....is supported by XT [7] XT (which stands for Program Transformation Tools ) bundles various related transformation tool packages into a single distribution, that can be downloaded and installed with minimal effort. These packages include a generalized LR parser and parser generator [25] ATERMs[2] as uniform exchange format, the transformational programming language Stratego [26] and the generic pretty printer GPP [4] Furthermore, XT contains an extensive collection of grammar tools (including yaccsdf which we further developed for the automatic transformation of YACC to SDF) and the ....

M. G. J. van den Brand, H. A. de Jong, P. Klint, and P. A. Olivier. Efficient annotated terms. Software, Practice & Experience, 30(3):259--291, 2000.

....a uniform exchange format to share data (including parse trees) between components. The ATerm format is a term representation suitable as exchange format for which an efficient representation exists. Therefore AsFix trees are encoded as ATerms to obtain space efficient exchangeable parse trees ([5] reports compression rates of over 90 percent) In Section 3.2 we will discuss tree representation using ATerms in more detail. Pretty printing We u se GPP, a generic pretty printing toolset that has been defined in [13] This set of meta tools provides the generation of customizable ....

....to preempt integration with typeless, generic components. For instance, a generic tree viewer should be able to read the intermediate trees without explicit knowledge of their types. ASTs are therefore represented in the ATerm format, which is a generic format for representing annotated trees. In [5] a 2 level API is defined for ATerms. This API hides a space efficient binary representation of ATerms (BAF) behind interface functions for building, traversing and inspecting ATerms. The binary representation format is based on maximal subtree sharing. Apart from the binary representation, a ....

[Article contains additional citation context not shown here]

M. G. J. van den Brand, H. A. de Jong, P. Klint, and P. A. Olivier. Efficient annotated terms. Software, Practice & Experience, 30(3):259--291, 2000.

....of program transformation systems. Its purpose is to minimize installation effort, verify that all components work together, and to provide extensive documentation and instructions about how to use this tooling together. The following tool packages are bundled and distributed by XT: ATERMs [2] This is a generic format for representing annotated trees and is used within XT as common tree exchange format to connect individual components to form transformation systems. There are two representations for ATERMs: a human readable, textual representation and a space efficient binary ....

M.G.J. van den Brand, H.A. de Jong, P. Klint, and P.A. Olivier. Efficient Annotated Terms. Software, Practice & Experience, 30(3):259--291, 2000.

....communication between processes. For the purposes of this paper we will limit ourselves to the most commonly used synchronous actions. These are snd msg(T) and rec msg(T) for sending and receiving messages, respectively. These actions are parameterized with arbitrary data T, represented as ATerms [6]. A successful synchronous communication occurs when a term that is sent matches a term that is received. For instance, the closed term snd msg(f(a) can match the closed term rec msg(f(a) or the open term rec msg(f(T ) At successful communication, variables in the data of the receiving process ....

M.G.J. van den Brand, H.A. de Jong, P. Klint, and P.A. Olivier. Efficient Annotated Terms. Software, Practice & Experience, 30(3):259--291, 2000.

....a uniform exchange format to share data (including parse trees) between components. The ATERM format is a term representation suitable as exchange format for which an efficient representation exists. Therefore ASFIX trees are encoded as ATERMS to obtain space efficient exchangeable parse trees ([28] reports compression rates of over 90 percent) In Section 2.3.2 we will discuss tree representation using ATERMS in more detail. Pretty printing We use GPP, a generic pretty printing toolset that will be discussed in Chapter 4, Pretty Printing for Software Reengineering . This set of meta tools ....

.... var (Identifier) fcall (Identifier, Exp ) let (Defs, Exp) where (Exp, Defs) Identifier Exp) Figure 2.6 Generated ABSTRACTSDF definition. ASTs are therefore represented in the ATERM format, which is a generic format for representing annotated trees (see Figure 2. 7) In [28] a 2 level API is defined for ATERMS. This API hides a space efficient binary representation of ATERMS (BAF) behind interface functions for building, traversing and inspecting ATERMS. The binary representation format is based on maximal subtree sharing. Apart from the binary representation, a ....

[Article contains additional citation context not shown here]

M. G. J. van den Brand, H. A. de Jong, P. Klint, and P. A. Olivier. Efficient Annotated Terms. Software, Practice & Experience, 30(3):259--291, 2000.

....add additional information to a term for later usage. Examples are coordinates in the source code, the focus of an editor, pointer to documentation node, etc. Two steps are needed to achieve rewriting with annotations. First, the term representation has to be extended with annotations [9]. Second, the rewriting process has to be extended to transparently handle annotations. The idea of rewriting with annotation was first proposed in [28] where annotations are called labels. Application of rewriting with annotations to the origin tracking problem (to be discussed shortly in Section ....

M. G. J. van den Brand, H. A. de Jong, P. Klint, and P. Olivier. Efficient Annotated Terms. Software, Practice & Experience, 30:259--291, 2000.

.... data types (booleans, integers, reals, lists) The Discrete Time TOOLBUS has been used for the restructuring of the ASF SDF MetaEnvironment [11] A first version was released in 2001 [10] In the meantime, the exchange format has also evolved from the TOOLBUS terms mentioned above to ATerms [12]: a term format that supports maximal subterm sharing and a very concise, sharing preserving, binary exchange format. ATerms decrease memory usage thanks to sharing and they permit a very fast equality test since structural equality can be replaced by pointer equality thanks to the maximal subterm ....

M.G.J. van den Brand, H.A. de Jong, P. Klint, and P. Olivier. Efficient Annotated Terms. Software, Practice & Experience, 30:259--291, 2000.

....ASF SDF Meta Environment is an integrated programming environment to develop these language definitions and to generate a programming environment given a language definition. Three technical developments of ASF SDF proved to be very useful for the development of an ELAN environment, namely ATerms [5], ToolBus [1] and the generic parsing technology [7] The ATerms format is a generic formalism for the representation of structured information, like (abstract) syntax tree, parse tables, environments, etc. The ToolBus is a software coordination architecture, which module BasicStrategies[Sort] ....

M.G.J. van den Brand, H.A. de Jong, P. Klint, and P.A. Olivier. Efficient Annotated Terms. Software, Practice & Experience, 30(3):259--291, 2000.

....cooperation protocol between components while computation is expressed in components that may be written in any language. We thus obtain interoperability of heterogeneous components in a (possibly) distributed system. ATerms Coordination protocol and components have to share data. We use ATerms [BJKO00] for this purpose. These are trees with optional annotations on each node. The annotations are used to store tool specific information like text coordinates or color attributes. The implementation of ATerms has two essential properties: terms are stored using maximal subterm sharing (reducing ....

M.G.J. van den Brand, H.A. de Jong, P. Klint, and P. Olivier. Efficient Annotated Terms. Software, Practice & Experience, 30:259--291, 2000.

....new surroundings we have to have detailed knowledge about its technical background and its design. The following sections discuss the parts of the system that are important to our project. ATerms and AsFix In order to exchange data between its components the Meta Environment uses Annotated Terms [BJKO99]. Annotated terms, or just ATerms, form a data structure that is ideal for communication between tools because they are platform and language independent and simple to create, compact and extend. To make ATerms available to other applications a C library [JO99] has been developed that provides ....

....memory seems to be zero by default; within Windows NT however the bug started to become a problem because memory is explicitly initialized to a different value and the library started to crash at unpredictable moments. The garbage collector within the ATerm library uses the mark sweep technique [BJKO99]. In the mark phase the memory must be checked for ATerms in order to mark them. This includes checking the stack and the registers. In Unix the sigsetjmp function places the registers in a data structure which is (automatically) placed on the stack. The stack can then be checked from top to ....

M.G.J. van den Brand, H.A. de Jong, P. Klint and P.A. Olivier. Efficient Annotated Terms. Submitted 1999.

....cooperation protocol between components while computation is expressed in components that may be written in any language. We thus obtain interoperability of heterogeneous components in a (possibly) distributed system. ATerms Coordination protocol and components have to share data. We use ATerms [4] for this purpose. These are trees with optional annotations on each node. The annotations are used to store tool specific information like text coordinates or color attributes. The implementation of ATerms has two essential properties: terms are stored using maximal subterm sharing (reducing ....

M.G.J. van den Brand, H.A. de Jong, P. Klint, and P. Olivier. Efficient Annotated Terms. Software, Practice & Experience, 30:259--291, 2000.

No context found.

M. G. J. van den Brand, H. A. de Jong, P. Klint, and P. A. Olivier. Efficient annotated terms. Software---Practice & Experience, 30:259--291, 2000.

No context found.

M. G. J. van den Brand, H. A. de Jong, P. Klint, and P. A. Olivier. Efficient annotated terms. Software---Practice & Experience, 30:259--291, 2000.

No context found.

M. G. J. van den Brand, H. A. de Jong, P. Klint, and P. A. Olivier. Efficient annotated terms. Software---Practice & Experience, 30:259--291, 2000.

No context found.

M. G. J. van den Brand, H. A. de Jong, P. Klint, and P. A. Olivier. Efficient annotated terms. Software---Practice & Experience, 30:259--291, 2000.

No context found.

M. G. J. van den Brand, H.A. de Jong, P. Klint, and P.A. Olivier. Efficient annotated terms. Software, Practice & Experience, 30(3):259--291, 2000.

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