E. J. Golin, Parsing visual languages with picture layout grammars, Journal of Visual Languages and Computing, 2, 4, (1991) 371 -- 394.  Home/Search   Document Not in Database   Summary   Related Articles   Check

....An 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 ....

E. J. Golin, Parsing visual languages with picture layout grammars, Journal of Visual Languages and Computing, 2, 4, (1991) 371 -- 394.

....inferencing from logic programming paradigms as has Pineda (1992) Golin and Reiss (1989) working in the attribute grammar paradigm, have suggested a mechanism that allows for limited reference to broader contexts. The computational complexity of most of these approaches is unknown, although Golin (1991) has reported a polynomial bound on recognition for Picture Layout Grammars. It seems that more than context free power is needed to represent many visual languages, but as the case study of this paper will show, restricted frameworks can play useful roles in interfaces without necessarily having ....

Golin, E. (1991) Parsing Visual Languages with Picture Layout Grammars. Journal of Visual Languages and Computing 2:371-393.

....such as constraint multiset grammars [2, 8] or relational grammars [14] can also be used to define visual syntax at different levels of abstraction. We take constraint multiset grammars (CMG) as an example: this formalism is a variant of attributed multiset grammars as introduced by Golin [4]. The following CMG production could be part of a grammar for state transition diagrams, and has a similar purpose as our graph grammar production of Fig. 2: transition(string from, string label, string to) A: arrow, T: text where ( exists S1: state, S2:state where ( distance(A.mid, ....

E. Golin. Parsing visual languages with picture layout grammars. Journal of Visual Languages and Computing, 2(4):371--394, 1991.

....visual programming tools. Although visual languages are used wide spread, there is still a standard visual formalism as the Backus Naur Forms missing to define their syntax and semantics. All the currently used grammars for syntax definition of visual languages, such as picture layout grammars [45,46], or constraint multiset grammars [66] use textual instead of visual notations, i.e. multi dimensional representations have to be coded into one dimensional strings. Using graph grammars instead we have a much more natural and itself visual formalism for this purpose. Visual sentences consisting ....

....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 ....

[Article contains additional citation context not shown here]

E. Golin. Parsing visual languages with picture layout grammars. Journal of Visual Languages and Computing, 2(4):371--394, 1991.

....Since a spaceball is a 6DOF device, users can draw 3D curves at once. Buttons may be used for different types of curves. This visual scripting approach is strongly based on visual languages, for the visual script used in this approach will be parsed by a sort of attributed multiset grammar [Golin 91, Chok 95] used for traditional visual languages. However, the grammar adapted for this approach extends constraints on 3D attributes. In our approach, we restrict the sort of constraints for improving the state search time. Sketching Behaviors among Characters First, an animator draws ....

Golin, "Parsing Visual Languages with Picture Layout Grammars", JVLC, 1991.

....The method is not meaningful enough to script situations with plenty of virtual behaviors. 3. Visual Scripting Approach This visual scripting approach is strongly based on visual languages, for the visual script used in this approach will be parsed by a sort of attributed multiset grammar [Golin 91, Chok 95] used for traditional visual languages. However, the grammar adapted for this approach extends constraints on 3D attributes. In our approach, we restrict the sort of constraints for Figure 1. An interface using the textual script Figure 2. Footstep driven animation Visual Scripting ....

Golin, "Parsing Visual Languages with Picture Layout Grammars", JVLC, 1991.

....Our approach separates the constraint specification of visual lexicals from that of function specification. Thus we can define and use visual functions that are close to the intended interpretation. This is in contrast to that of many visual language syntax specification approaches (e.g. [6]) We have extended the term rewriting used in this context to include the collection sort which can be used for graph rewriting semantics. The collection sort has been influenced by graph grammar formalisms. The Relational Grammars work [18] has influenced the selection of the underlying ....

E. J. Golin. Parsing Visual Languages with Picture Layout Grammars. Journal of Visual Languages and Computing, 2(4):371--394, 1991.

....in[5] is a relational parser. 3) General relational grammar X : op a 1 a 2 . a n ) C1: Relational operator can be defined between any n symbols. Parser: Parser is general relational parser. Comment: The general parser described in[5] is a general relational parser. The Picture Layout Grammar [11] and the Web Grammar[12] are variations of general relational grammars. To extend the above definitions so that we can describe multidimensional languages, we define a relational multidimensional grammar G which describes how to generate multidimensional sentences: G = N, X, OP, S, R) where N is ....

E. J. Golin, "Parsing Visual Languages with Picture Layout Grammars," Journal of Visual Languages and Computing, vol. 2, no. 4, December 1991.

....visual programming tools. Although visual languages are used wide spread, there is still a standard visual formalism as the Backus Naur Forms missing to define their syntax and semantics. All the currently used grammars for syntax definition of visual languages, such as picture layout grammars [4,5], or constraint multiset grammars [6] use textual instead of visual notations, i.e. multi dimensional representations have to be coded into one dimensional strings. Using graph grammars instead we have a much more natural and itself visual formalism for this purpose. Visual sentences consisting ....

....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 ....

[Article contains additional citation context not shown here]

E. Golin. Parsing visual languages with picture layout grammars. Journal of Visual Languages and Computing, 2(4):371--394, 1991.

....(and to some degree semantics) of visual languages. Mostly, these are based on extensions of string grammar formalisms. A complete and recent overview is out of scope of this paper. However, we like to mention a few approaches: generalizations of attributed grammars (e.g. picture layout grammars [20]) positional grammars (e.g. 21] and graph grammars (e.g. 22, 23, 24] Other approaches closely related to this one use (constraint) logic or relational formalisms (e.g. 25, 26, 27, 28, 29, 30] to represent spatial relationships. Experience has shown (reported by Wittenburg in [29] that ....

E.J. Golin, "Parsing Visual Languages with Picture Layout Grammars", Journal of Visual Languages and Computing, vol. 2, no. 4, pp. 371--393, Dec. 1991.

....as constraint multiset grammars [CM95, Mar94] or relational grammars [Wit92] can also be used to define visual syntax at different levels of abstraction. We take constraint multiset grammars (CMG) as an example: this formalism is a variant of attributed multiset grammars as introduced by Golin [Gol91]. The following CMG production could be part of a grammar for state transition diagrams, and has a similar purpose as our graph grammar production of Fig. 2: transition(string from, string label, string to) A: arrow, T: text where ( exists S1: state, S2:state where ( distance(A.mid, T.mid) ....

E.J. Golin. Parsing visual languages with picture layout grammars. Journal of Visual Languages and Computing, 2(4):371-- 394, 1991.

....provide a syntactic specification mechanism which has formed the basis for developing parser creation tools such as yacc. Golin and Magliery [5] have taken a similar approach to visual languages by presenting a parser generator which automates the creation of parsers for picture layout grammars [6]. Their C based formalism allows for easy integration of semantic actions and the use of remote symbols makes this method suitable for generating directed parse graphs. Helm and Marriott [8, 9] use a constraint solver such as PROLOG to build graphical parsers. They use the same logic formalism ....

E. J. Golin. Parsing visual languages with picture layout grammars. Journal of Visual Languages and Computing, 2(4):371--394, December 1991.

....for more efficient parsing. However, context freeness is still required. Golin s picture lay Figure 9: Screenshot of the view after tearing the NSD of Fig. 8 apart. Note the coloring of the incorrect while block and the two correct sub diagrams, which are not a correct single NSD. out grammars [14] also provide context free rewriting of spatially related symbols. However, these grammars are more expressive since additional non context free productions may take into account some terminal context. TreeDAGs thus replace derivation trees. As a parser, an offline CYK style bottom up parser ....

E.J. Golin, "Parsing visual languages with picture layout grammars", Journal of Visual Languages and Computing, vol. 2, pp. 371--393, 1991.

....but the number of system implementations is very limited. Mostly, these approaches extend string grammar formalisms. A complete and recent overview is out of scope of this paper. However, we like to mention a few approaches: generalizations of attributed grammars (e.g. picture layout grammars [12]) positional grammars (e.g. 13] graph grammars (e.g. 14, 15, 16] and algebraic or type theoretic formalisms (e.g. 17, 18] Other work closely related to our approach uses (constraint) logic or relational formalisms (e.g. 19, 20, 21, 22, 23, 24, 25] for representing spatial ....

E.J. Golin, "Parsing Visual Languages with Picture Layout Grammars", Journal of Visual Languages and Computing, vol. 2, no. 4, pp. 371--393, Dec. 1991.

....semantics for the textual language. There are a variety of grammar based specification techniques for visual languages, among them Picture Processing Grammars [1] Relation Grammars [3] Positional Grammars [2] Fringe Relational Grammars [11] and Picture Layout Grammars. Picture Layout Grammars [6, 5] are one of the most flexible of these grammars. They are based on Attributed Mul Supported by the National Science Foundation under grant CCR9007195 tiset Grammars [4] which are similar to textual context free grammars, except that the right hand side of a production is an unordered ....

Eric J. Golin, Parsing Visual Languages with Picture Layout Grammars, Journal of Visual Languages and Computing 2 (1991), pp. 371 -- 393.

....constructs as small as possible the introduction of other loops (e.g. for, do until, etc. is avoided until they are actually needed. The syntax of CPCL is defined with the formalism of Picture Layout Grammars (PLG) References to the details of this formalism can be found [Goli 89b] Goli 90] Goli 91] Goli 89a] NODE 7 fCG;DW;FW;PWg NODE:lx = min(CG:lx; DW:lx;FW:lx;PW:lx) NODE:rx = max(CG:rx; DW:rx; FW:rx; PW:rx) NODE:by = max(CG:by; DW:by;FW:by;PW:by) NODE:ty = min(CG:ty; DW:ty; FW:ty; PW:ty) Where CG:rx min(DW:lx; FW:lx;PW:lx) DW:lx = FW:lx = PW:lx DW:rx = FW:rx = PW:rx FW:ty = ....

E. J. Golin. "Parsing visual languages with picture layout grammars". Journal of Visual Languages and Computing, Vol. 2, No. 4, pp. 371 -- 394, December 1991.

....class, and share much of their motivations. There are some key differences, however, and we discuss them in detail in Section 8. 2 Research on visual parsing of visual languages[6] also deal with spatial layouts of objects, where many rule based parsing algorithms have been proposed including [3], 5] and [7] Our work is different in that our intention is to extract emerging structure from free card layouts, whereas they intend to recover the structure of visual languages that was constructed based on a given grammar, which usually embody little ambiguity, and do not differ greatly ....

Golin,E.J., "Parsing Visual Languages with Picture Layout Grammars", Journal of Visual Languages and Computing, no. 2, 1991, pp. 371-393.

....spatial relationship between the circle and the text: the circle contains the text. The meaning of the relationship stems from the interpretation of the picture as a diagram of a FSM. The structure of pictures from the visual language describing FSM s can be described with a Picture Layout Grammar (Golin, 1991). The terminals of this grammar correspond to the graphical primitives in the pictures. A non terminal corresponds to a group of primitives that are combined according to some rules: a text and a circle are a state only if the circle contains the text. The groups are formed by productions, which ....

....The last productions define a LabelledArrow as an arrow labelled with a text and a State as a circle containing a text. Figure 2 shows the parse tree of the diagram in Figure 1. The parse tree is not really a tree but a directed acyclic graph. For a further elaboration on parsing pictures see Golin (1991), or Rekers Sch rr (1996) 2 For simplicity the representation of starting and accepting states is ignored. FSDiagram TransitionList TransitionList Transition Transition LabeledArrow Arrow a LabeledArrow Arrow b State Circle 1 State Circle 2 Arc Arc Figure 2: Parse tree for FSDiagram. I.3 ....

Golin E. (1991): "Parsing Visual Languages with Picture Layout Grammars", Journal of Visual Languages and Computing.

....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 generator for visual languages which is based on the notion of picture layout grammars. In such a grammar a syntax rule is limited to a single spatial relation which connects two symbols. This generally leads to a large number of nonterminals and syntax rules. Symbols may be ....

E. J. Golin. Parsing visual languages with picture layout grammars. Journal of Visual Languages and Computing, 2(4):371--394, December 1991.

....sides of productions with context elements, in order to be able to create edges between new vertices and preserved vertices in the rewritten host graph. This is just one popular solution of the embedding problem. The others are: ffl Implicit Embedding: formalisms like picture layout grammars [12, 13] or constraint multiset grammars [5, 4] do not distinguish between vertex and relationship objects. All needed relationships between objects are implicitly defined as constraints over their attribute values. Therefore, attribute assignments within productions have the implicit side effect to ....

....[5] does not check whether the resulting derivation is consistent. This means that a syntax specification has to be made deterministic by additional not exists constraints which prevent any possible overlap between the right hand sides of productions. The picture layout grammar approach of Golin [12, 13] allows for terminal context elements, but has a main focus on productions with one nonterminal on the left hand side and at most two (non )terminals on the right hand side, with predefined spatial relationships between them. A definition of a grammar which generates our language of connected ER ....

E. Golin. Parsing visual languages with picture layout grammars. Journal of Visual Languages and Computing, 2(4):371--394, 1991.

No context found.

Golin, E.J., Parsing Visual Languages with Picture layout Grammars. Journal of Visual Languages and Computing, 1991. 2: p. 371-393.

No context found.

Golin, E.J. (1991). "Parsing Visual Languages with Picture layout Grammars", Journal of Visual Languages and Computing , 2, pp. 371-393.

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