M. Andries, G. Engels, and J. Rekers. How to represent a Visual Program? In  Home/Search   Document Details and Download   Summary   Related Articles   Check

....is desired because a user can create and modify diagrams unrestrictedly; but these diagrams may contain errors. In contrast, pure syntax directed editing provides a set of editing commands transforming correct diagrams into other correct diagrams; but the user is restricted to these commands. In [AER96] an integration of both kinds of editing modes is proposed which is captured by DiaGen as well by GenGED. Additionally, an internal representation model (a graph) is taken into account by DiaGen as it is done, e.g. by GenGED and by Kogge [Kogge] However, Kogge allows for syntax directed editing ....

M. Andries, G. Engels, and J. Rekers. How to represent a Visual Program? In

....Interactive Visual Language (IVL) is the set of visual sentences which may appear during an interaction. This approach seems general enough to encompass other proposed definitions of visual languages, derived by focusing on the parsing techniques for one dimensional and graph languages (e.g. 13] [1]) The ability to relate structures in the image to symbols in the descriptions, and to understand the relations between the characteristics of visual languages and those of one dimensional languages, are of capital importance to properly extend to it IVLs the use of those mathematical and ....

M. Andries, G. Engels, J. Rekers, How to represent a visual program?, in K. Marriott, B.Meyer eds., Theory of Visual Languages, SpringerVerlag, 1997, to appear.

....define all necessities ( 17] Many different formalisms have been proposed for the definition of VLs (cf. 12] for a survey over the common approaches. In contrast to common approaches including algebraic techniques ( 21] as well as to the graph grammar approaches presented by Rekers, Schurr ([14, 18, 1, 15]) and Minas, Viehstaedt ( 22, 13] our approach uses two different techniques for defining the alphabet on the one side and the language grammar on the other side. We use algebraic specification techniques to define graphical symbols, interrelations and layout constraints in an axiomatic way. ....

M. Andries, G. Engels, and J. Rekers. How to represent a Visual Program ? In [19], 1996.

....supported by PARCON. 5 Related Work Many different formalisms have been proposed for the definition of VLs [MM96] In contrast to existing approaches using either algebraic techniques [ Usk94] or graph grammar approaches as presented by Gottler [Got87] Andries, Engels, Rekers, Schurr [Rek94,AER96] and Minas, Viehstaedt [Min93,MV95] our approach uses both for defining an alphabet and a language grammar. We use algebraic specification techniques to define graphical symbols, links and layout constraints in an axiomatic way. This seems to meet the definition of the very basic issues of a ....

M. Andries, G. Engels, and J. Rekers. How to represent a Visual Program ? In

.... Many different formalisms have been proposed for the definition of VLs (see [MM96] for a survey over the common approaches) In contrast to common approaches including algebraic techniques ( Usk94] as well as to the graph grammar approaches presented by Gottler ( Got87] Rekers, Schurr ( Rek94, AER96] and Minas, Viehstaedt ( Min93, MV95] our approach uses two different techniques for defining the alphabet on the one side and the language grammar on the other side. We use algebraic specification techniques to define graphical symbols, links and layout constraints in an axiomatic way. This ....

M. Andries, G. Engels, and J. Rekers. How to represent a Visual Program ? In Proc. of the AVI'96 Workshop Theory of Visual Languages, Gubbio, Italy, May 30. 1996.

....in a natural way. The proper language, i.e. its grammatical structure, is described by a graph grammar techniques which is again a very natural formalism for this purpose. Our work is closely related to others applying graph grammars to visual languages. Within the work of [Rek94, Sch94, RS95, AER96, RS96] graph grammars are used to define visual languages 12 by giving the logical structure (abstract syntax) together with the spatial relations. Graphical (context sensitive) parsing is regarded, and it is defined how to represent a visual program. Attributed graphs represent the abstract ....

M. Andries, G. Engels, and J. Rekers. How to represent a Visual Program ? In

....to specific visual languages. Others take an algebraic view of modeling picture semantics [18] Work that is most closely related to this paper is Erwig s definition of visual language semantics using abstract syntax graphs [5] and the separation of concrete and abstract syntax proposed in [1, 13]. Erwig uses abstract syntax graphs that abstract from representation details of concrete diagrams. He does not restrict semantic definition to this representation, but uses different schemes, e.g. denotational semantics, to define diagram semantics based on abstract syntax. However, he does not ....

....syntax. However, he does not offer a method for translating a concrete diagram into its abstract syntax representation. Rekers et al. have proposed to use spatial relationship graphs (SRGs) to represent a diagram s concrete syntax and an abstract syntax graph (ASG) for its abstract syntax [1, 13]. The syntax of each of the graphs is represented by a graph grammar. By coupling both grammars, they are able to translate SRGs into ASGs and vice versa. The correspondence between ASG and SRG is represented by special edges connecting ASG nodes by corresponding SRG nodes. These coupled grammars ....

[Article contains additional citation context not shown here]

M. Andries, G. Engels, and J. Rekers. How to represent a visual program? In Proc. Workshop on Theory of Visual Languages, 1996.

....AE97] Graph Rewrite Systems and Visual Database Languages. Use of attributed and labeled graphs (PROGRES [Zun92, SZW95] defines syntax and semantics of a visual database language; without considerations wrt. graphical structure. 4. Rekers Schurr Engels Andries in [Rek94, Sch94, RS95b, RS95a, AER96, RS96] How to represent a Visual Program and A graph based framework for the implementation of visual environments Use of attributed and labeled graphs (PROGRES [Zun92, SZW95] defines syntax of visual languages, graphical parsing, and a graph based framework; with considerations wrt. ....

....expressions. Sch94] provides triple graph grammars to hold theses two structures, which is said to define a visual language. Within following articles graphical (context sensitive) parsing ( RS95b, RS95a] is regarded, and it is more concrete defined how to represent a visual program ( AER96] corresponding to the two structures mentioned above. Figure 6 illustrates the several representations of a visual program. Within the last contribution ( RS96] a graph based framework for the implementation of visual environments is presented. The aim of this framework is to introduce an ....

M. Andries, G. Engels, and J. Rekers. How to represent a Visual Program ? In [TVL96], 1996.

....we hope to obtain a better insight in the applicability of the developed graph grammar formalism. Furthermore, this will allow us to analyze the efficiency of the parser on actual visual sentences. The implementation will become part of a syntax directed editor toolkit for visual languages [1, 19] under development, and the graph grammar programming environment PROGRES [23, 24] Acknowledgements We would like to thank the referees of the JVLC for their extensive and helpful comments on the first version of this paper. ....

M. Andries, G. Engels, and J. Rekers. How to represent a visual program? Accepted for AVITVL, 1996.

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