15 citations found. Retrieving documents...
K. Wittenberg and L. Weitzman, `Visual grammars and incremental parsing for interface languages', IEEE Workshop on Visual Languages, Skokie, IL, 1990, pp. 111--118.

 Home/Search   Document Not in Database   Summary   Related Articles   Check  

This paper is cited in the following contexts:
Application of Graph Transformation to Visual Languages - Bardohl, Taentzer, Minas.. (1999)   (20 citations)  (Correct)

....determines then the whole visual language. There are several different graph transformation formalisms (compare [88] A subset of them being applied to visual language definition is discussed in this chapter. The theory of visual languages, e.g. a language hierarchy [67] and parsing algorithms [46,118,25,20] are very much oriented at the pendants for textual languages. Using graph grammars for visual language definition, the type of visual languages is usually not restricted to be context free, but more general types of languages are often used. Theoretical results concerning independency of graph ....

K. Wittenburg and L. Weitzman. Visual grammars and incremental parsing for interface languages. In [109], pages 111--118, 1990.


On the Classification of Visual Languages by Grammar Hierarchies - Marriott, Meyer (1997)   (7 citations)  (Correct)

....for the specification of visual languages have been investigated for more than two decades now. Grammar like formalisms range from early approaches like web and array grammars [1] and shape grammars [2] to recent formalisms like positional grammars [3] relation grammars [4] unification grammars [5, 6, 7], attributed multiset grammars [8] constraint multiset grammars [9] and several types of graph grammars [10] There are also a variety of non grammar like formalisms, including algebraic approaches [11] and logic based approaches [12, 13, 14] In order to understand the tradeo#s and comparative ....

....formula that defines the relation immediately. It is important that G # would then not need to use the aggregative attribute prop. This property of relations is, however, not guaranteed for arbitrary 1NS RGs. 2.1. 3 Unification Grammars Visual unification grammars have been introduced in [5]. Their successor, atomic relational grammars (ARGs) is presented in [6, 7] ARGs are rewrite systems operating on a single set of symbols and (evaluable) relations. An ARG production has the form A # # # F where A is a non terminal, # a string of non terminals and terminals, # a set of ....

K. Wittenburg and L. Weitzmann (1990) Visual grammars and incremental parsing for interface languages. In IEEE Symposium on Visual Languages, 111-118.


Logic and the Structure of Space - Towards a Visual Logic for.. - Meyer (1993)   (Correct)

....general picture programming, reasoning about pictures, as well as picture parsing and translation. In the context of visual languages for human computer interaction an important issue for the future will be the development of efficient incremental parsing techniques for interactive picture input [WW90]. ....

Kent Wittenburg and Louis Weitzman. Visual Grammars and Incremental Parsing for Interface Languages. In 1990 IEEE Workshop on Visual Languages, pp. 111 --- 118. superstate ( [] , ) . superstate( [ Z|Zs] , superstate ( Zs, ) .


Graphical Scanning of Diagrams - A Spatial Relations Analyzer - Bierman   (Correct)

....whether or not a line object touches a circle, a text object is contained in an ellipse object, etc. Related work regarding graphical parsing concentrates on topics like graphical parsing of visual languages and textual parsing with use of graph grammars. The approach of Wittenburg and Weitzman [12] is to use a grammar formalism and incremental parsing algorithm for the purposes of defining and processing visually based languages. They leave the problem of symbol recognition to the neural net modules. For the problem of the derivation of spatial relations, they assign a module called the ....

....representation graphs. The formal description of the manipulation is done by programmed attributed graph grammars. The field of graphical analysis consist of topics like neural network recognition. Neural networks can be used to recognize objects drawn in the diagram. Wittenburg and Weitzman [12] describe the interpretation of a diagram in their work with the aid of a neural network. The first step in recognizing a diagram is what they call segmentation and smoothing of the diagram. In this phase, points close to each other in the diagram are connected. The points connected form line ....

K. Wittenburg and L. Weitzman. Visual grammars and incremental parsing for interface languages. In Proceedings 1990 IEEE Workshop Visual Languages, pages 111--118, Skokie, Illinois, October 1990.


Formal Classification of Visual Languages - Marriott, Meyer   (Correct)

....however, came at a certain price. VL specification is now faced with a Babel of di#erent formalisms that are very hard to compare. Most of them are grammar like (such as Web and Array Grammars [15] Shape Grammars [7] Positional Grammars [4] Relational Grammars [6] Unification Grammars [18, 17], Attributed Multiset Grammars [8] Constraint Multiset Grammars [12] and several types of graph grammars [5] but logic based methods [10, 14, 9] and algebraical formalisms [16] are also used. Even when the discussion is restricted to grammar like formalisms, there is such a diversity in the ....

....mappings of other formalisms to CMGs have to be established. We have analyzed some considerably di#erent well established grammar formalisms, and all of them can be mapped to CMGs. The full paper will discuss mappings for Positional Grammars [4] Relational Grammars [6] and Unification Grammars [18, 17] in detail. Theorem 14 Let G be either a Positional Grammar, a 1NS Relational Grammar, or an Atomic Relation Grammar. There is a Constraint Multiset Grammar G # such that L(G) L(G # ) 5.1 Positional Grammars Positional grammars (PGs) are rewrite systems working on sets of symbols that ....

K. Wittenburg and L. Weitzmann. Visual grammars and incremental parsing for interface languages. In IEEE Symposium on Visual Languages, 1990. 9


Pictures Depicting Pictures - On the Specification of Visual.. - Meyer (1992)   (4 citations)  (Correct)

....may be used in. Furthermore, unification would provide an interesting and elegant way to talk about impossible pictures: infinitely recursive pictures like X in Figure 12, etc. X = X Figure 12 A second direction for further research is to investigate parsing of interactive visual languages [18] with logic grammars, i.e. to develop incremental deductive parsing techniques. Of course, the last topics are only visions for a longterm future. Though the formalism presented here is just a first step on this way, we are confident that the combination of logic grammars and picture variables ....

K. Wittenburg and L. Weitzman. Visual Grammars and Incremental Parsing for Interface Languages. In 1990 WOVL.


Towards a Hierarchy of Visual Languages - Marriott, Meyer (1996)   (7 citations)  (Correct)

....the specification of visual languages have been investigated for more than two decades now. Grammar like formalisms range from early approaches like web and array grammars [15] and shape grammars [6] to recent formalisms like positional grammars [3] relational grammars [5] unification grammars [18, 17], attributed multiset grammars [7] constraint multiset grammars [12] and several types of graph grammars [4] There are also a variety of non grammar like formalisms, including algebraic approaches [16] and logic based approaches [10, 14, 9] In order to understand the tradeo#s and comparative ....

....geometric attributes and that all admissible relation symbols have a geometric interpretation such that they can be tested by computations on these attributes, This is, however, not guaranteed for arbitrary 1NS RGs. 2.1. 3 Unification Grammars Visual unification grammars have been introduced in [18]. Their successor, atomic relational grammars (ARGs) is presented in [17] ARGs are rewrite systems operating on a single set of symbols and (evaluable) relations. An ARG production has the form A # # # F where A is a nonterminal, # a string of non terminals and terminals, # a set of ....

K. Wittenburg and L. Weitzmann. Visual grammars and incremental parsing for interface languages. In IEEE Symposium on Visual Languages, 1990.


Pictures Depicting Pictures - On the Specification of Visual.. - Meyer (1992)   (4 citations)  (Correct)

....or the positions they may be used in. Furthermore, unification would provide an interesting and elegant way to talk about impossible pictures: infinitely recursive pictures like X in Figure 14, etc. A second direction for further research is to investigate parsing of interactive visual languages [WW90] with logic grammars, i.e. to develop incremental deductive parsing techniques that employ some kind of intelligent backtracking algorithm so that not the entire input picture must be reinterpreted when changes are made to it, but only relevant portions of the picture need to be reconsidered. ....

Kent Wittenburg and Louis Weitzman. Visual Grammars and Incremental Parsing for Interface Languages. In 1990 IEEE Workshop on Visual Languages, pp. 111 --- 118.


Visual Language Syntax and Semantics for Complex Reactive.. - Lewis Chau Chan   (Correct)

....Helm and Marriott[14] have described the declarative constraint based visual languages. Visual specifications are compiled into constraint logic programs for execution. Other constraint based visual grammatical formalisms include Relation Grammars[7] and visual grammars by Wittenburg and Weitzman[19]. Previous approaches for behavioral specification of reactive systems such as statecharts[12] and Estelle[8] rest on finite state automata and their extension. Although the computational model is rigorous, the formal semantics of the language is difficult to express. For example, in [13] the ....

....of time instants corresponding to the sampling rate of the system under description. Moreover finding a way to execute the specification is not straightforward. Another approach is to employ an executable and declarative programming language such as constraint logic programming proposed in [7, 14, 19]. As pointed out in [5] the expressive power of logic programming is limited to first order, and many properties of complex reactive systems are difficult to specify. Automata have a very close relationship with grammar rules (rewrite rules) In automata theory [16] the equivalence between a ....

Wittenburg, K., and L. Weitzman, "Visual grammars and incremental parsing for interface languages", Proc. 1990 IEEE Workshop on Visual Languages, Chicago, Illinois, 4-6 October, pp. 111-118.


Application of Graph Transformation to Visual Languages - Bardohl, Taentzer, Minas.. (1998)   (20 citations)  (Correct)

....determines then the whole visual language. There are several different graph transformation formalisms (compare [7] A subset of them being applied to visual language definition is discussed in this chapter. The theory of visual languages, e.g. a language hierarchy [8] and parsing algorithms [5,9,10,11] are very much oriented at the pendants for textual languages. Using graph grammars for visual language definition, the type of visual languages is usually not restricted to be context free, but more general types of languages are often used. Theoretical results concerning independency of graph ....

K. Wittenburg and L. Weitzman. Visual grammars and incremental parsing for interface languages. In [108], pages 111--118, 1990.


Visual Programming - Burnett (1999)   (10 citations)  (Correct)

....VPL examples were drawn from an IEEE tutorial presented jointly by Burnett and Rebecca Walpole Djang in 1997 in Capri, Italy. The discussion of VPL specification presented here is summarized from [15] other approaches to formal syntax issues and also to formal semantics issues can be found in [2, 6, 8, 10, 23]. The discussions of cognitive dimensions and of representation design benchmarks are due to [24] The summary of empirical studies is derived from [3] and from [22] ....

K. Wittenburg and L. Weitzmann, Visual grammars and incremental parsing for interface languages. IEEE Workstop on Visual Languages, Skokie, Illinois: 111-118, October 4-6, - 1990.


On the use of Graph Grammars for defining the Syntax of Graphical .. - Rekers (1994)   (17 citations)  (Correct)

....4 RELATED WORK The approach of Helm and Marriott [10, 11] towards graphical parsing is to define the graphical syntax entirely in a logic formalism. They do not split the translation in separate phases. Their parsers are implemented by a constraint solver such as prolog. Wittenburg et al. [16, 17, 18] propose relational unification grammars to specify the parsing of pictorial objects and their spatial relations. They implement the parsers defined by these grammars with a chart based relational parsing algorithm which has been developed by them also. Golin et al. 5, 6, 7, 8] present a compiler ....

....to use graph rewriting to implement the parser. Due to the general nature of graph rewriting, we expect this to be less efficient than a more specific graphical parsing algorithm. We can imagine that a translation of our graph grammar transformation rules to the relational grammars of Wittenburg [17] could lead to more efficient parsing. ACKNOWLEDGEMENT I would like to thank Gregor Engels for his numerous stimulating remarks and ideas. ....

K. Wittenburg and L. Weitzman. Visual grammars and incremental parsing for interface languages. In Proceedings 1990 IEEE Workshop Visual Languages, pages 111--118, Skokie, Illinois, October 1990.


The Architecture of Information - The interpretation and.. - Weitzman   Self-citation (Weitzman)   (Correct)

No context found.

Wittenburg, K. and Weitzman, L. 1990. Visual Grammars and Incremental Parsing for Interface Languages, IEEE Workshop on Visual Languages, pp. 111-118, October 4-6, Skokie, Illinois.


Using Formalized Temporal Message-flow Diagrams - Citrin, Cockburn, Känel, Hauser (1995)   (1 citation)  (Correct)

No context found.

K. Wittenberg and L. Weitzman, `Visual grammars and incremental parsing for interface languages', IEEE Workshop on Visual Languages, Skokie, IL, 1990, pp. 111--118.


A C++ Implementation of a Parser for Visual Languages based on.. - Paalder   (Correct)

No context found.

K. Wittenburg and L. Weitzman. Visual grammars and incremental parsing for interface languages. In Proceedings of the 1990 IEEE Workshop on Visual Languages, pages 111-118, Skokie, Illinois, October 1990.

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