The UML meta model [3] captures the abstract syntax...

Diagrams can be represented by graphs, and the animation and transformation of diagrams can be modeled by graph transformation. This paper studies extensions of graphs and graph transformation that are important for programming with graphs:

Abstract not found

Diagram editors which are tailored to a specific diagram language typically support either syntax-directed editing or free-hand editing, i.e., the user is either restricted to a collection of predefined editing operations, or he is not restricted at all, but misses the convenience of such complex editing operations. This paper describes DiaGen, a rapid prototyping tool for creating diagram editors which support both modes in order to get their combined advantages. Created editors use hypergraphs as an internal diagram model and hypergraph parsers for syntactic analysis whereas syntax-directed editing is realized by programmed hypergraph transformation of these internal hypergraphs. This approach has proven to be powerful and general in the sense that it supports quick prototyping of diagram editors and does not restrict the class of diagram languages which it can be applied to. Key words: Diagram editors, rapid prototyping, hypergraph grammar, hypergraph transformation 1

In a graphical user interface, physical layout and abstract structure are two important aspects of a graph. This article proposes a new graph grammar formalism which integrates both the spatial and structural specification mechanisms in a single framework. This formalism is equipped with a parser that performs in polynomial time with an improved parsing complexity over its nonspatial predecessor, that is, the Reserved Graph Grammar. With the extended expressive power, the formalism is suitable for many user interface applications. The article presents its application in adaptive Web design and presentation.

. Diagrams that serve as a visual input facility for programming environments have to be translated into some kind of semantic description. This paper describes such a method which is based on a specification of the translation process. The translation process starts with a diagram, which is simply represented as a collection of atomic diagram components, and it ends up with some data structure as a semantic representation of the diagram. The specification of the translation process mainly consists of two parts: the specification of spatial relationships between atomic diagram components in terms of their numeric parameters (e.g., position, size), and an attributed hypergraph grammar that describes the concrete diagram syntax as well as the rules for generating the semantic representation. 1 Introduction In Proc. of the Int'l Workshop on Applications of Graph Transformation with Industrial Relevance (AGTIVE'99) at Monastery Rolduc, NL, September 1-3, 1999. Appears in LNCS,...

This extended abstract demonstrates that creating editors and environments for visual languages becomes considerably easier when restricting the class of visual languages. The presented approach considers graph-like languages whose diagrams consist of nodes and edges with di#erent types. The specification method allows to describe such graphs in terms of their node and edge types and makes use of constraints in order to express syntactic properties. The DiaGen system is used to generate running editors from such specifications.

Within this contribution GENGED is presented, a development environment for visual languages. GENGED offers a hybrid language for defining the syntax of visual languages consisting of an alphabet and a grammar. So far, the main components of GENGED are given by an alphabet and a grammar editor. The syntax description is the input of a diagram editor allowing the syntax-directed manipulation of diagrams. The grammar definition as well as the manipulation of diagrams is based on algebraic graph transformation and graphical constraint solving. Keywords: visual language, algebraic graph transformation, constraint solving, ruleand constraint-based editor. 1 Introduction Visual languages (VLs) emerge in an increasing frequency (cf. [VLxx] for more details) . Usually, they are fixed implemented in a visual environment (VE). This is the main disadvantage when regarding VLs for e.g., software modeling or programming. Whenever the concepts of a language or visual means are changed a partly re...

The aim of this paper is to integrate typed attributed graph transformation with node type inheritance. Borrowing concepts from object oriented systems, the main idea is to enrich the attributed type graph with an inheritance relation and a set of abstract nodes. In this way, a node type inherits the attributes and edges of all its ancestors. Based on these concepts, it is possible to define abstract productions, containing abstract nodes. These productions are node types by the node types in their inheritance clan. Therefore, productions become more compact and suitable for their use in combination with meta-modelling. The main results of this paper show that attributed graph transformation with node type inheritance is fully compatible with the existing concept of typed attributed graph transformation.

This paper presents an approach to the specification of visual language syntax. Based on attributed graphs as the notion of abstract syntax, syntactical correctness is specified by a set of predicates over that structure. The proposed technique facilitates natural embedding of other visual and textual notations, the definition of complex syntactical and static-semantical properties, as well as precise error diagnosis and locating. An editing environment supporting this technique is briefly discussed.