Wittenburg, K. (1992) Earley-style parsing for relational grammars. In Proc. 8th IEEE Workshop on Visual Languages, September 15--18, Seattle, WA, pp. 192--199. IEEE Computer Society Press, Los Alamitos, CA.  Home/Search   Document Not in Database   Summary   Related Articles   Check

....parsing algorithms proposed so far are either unable to recognize interesting languages of graphs, 4 Author for correspondence. or tend to be inefficient when applied to graphs with a large number of nodes and edges. Another problem is that nearly all known graph grammar parsing algorithms [2, 3, 4, 5, 6, 7] deal only with contextfree productions. A context free grammar requires that only a single non terminal is allowed on the left hand side of a production [8] A context sensitive graph grammar, on the other hand, allows left hand and right hand graphs of a production to have an arbitrary number of ....

....visual languages has motivated research in the specification and parsing of multi dimensional structures. Several specification methods have been proposed and proven to be useful in practical applications. Examples include Web and array grammars [15] positional grammars [16] relational grammars [7, 17], unification grammars [18] attributed multiset grammars [4] constraint multiset grammars [19] and layered graph grammars [9] In this section, we discuss some of the related grammars and compare them with reserved graph grammars. The relational grammars of Wittenburg [7] are restricted to ....

[Article contains additional citation context not shown here]

Wittenburg, K. (1992) Earley-style parsing for relational grammars. In Proc. 8th IEEE Workshop on Visual Languages, September 15--18, Seattle, WA, pp. 192--199. IEEE Computer Society Press, Los Alamitos, CA.

.... of VLs have been investigated for more than two decades now [MM98b] Grammar like formalisms range from early approaches like web and array grammars [Ros76] and shape grammars [Gip75] to recent formalisms like positional grammars [COP 93] relation grammars [FTTV96] relational grammars [Wit92, WW96] attributed multiset grammars [GR90] and several types of graph grammars [Cou90, Roz97] There are also a variety of non grammar like formalisms including algebraic approaches [D U96] and logic based approaches [HM90a, Mey92, Haa96] No matter which type of framework is selected, there ....

....These are grammar like and non grammar like formalisms. Grammar like formalisms range from early approaches like array and web grammars [Ros76] and shape grammars [Gip75] to recent formalisms like picturelayout grammars [Gol91b, Gol91a] positional grammars [CC91, CLOT98] relational grammars [Wit92, WW96] constraint multiset grammars [Mar94, MM98a] etc. and several types of graph grammars [Roz99] Non grammar like formalisms include algebraic approaches [D U96] and logic based approaches [HM90a, Mey92, Haa96] Most of these formalisms are described in [MM98b] the first book about Visual ....

K. Wittenburg. Earley-style Parsing for Relational Grammars. In Proc. IEEE Symp. on Visual Languages, pages 192--199, Seattle, WA., October 1992.

....for use within a syntax directed editor. We propose graph oriented representations, and show how graph grammars can be used to define the allowed graphs at the different levels. However, other syntax definition formalisms, 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 ....

K. Wittenburg. Earley-style parsing for relational grammars. In Proceedings 8th IEEE Workshop on Visual Languages -- VL'92, pages 192--199, 1992. -- 7 --

....an ASG graph grammar defines the underlying (more abstract) language of all interpretable object configurations. Other VL syntax definition approaches use relations or attributed multisets as their underlying data models. The main (dis)advantage of graph grammars compared with relational grammars [117] is that they enforce a strict distinction between objects (nodes) and relations between objects (arcs, edges) Both approaches are, therefore, more or less equivalent to each other, especially in the case of hypergraph grammars, which use hyperedges as n ary relationship objects. The differences ....

....graph one nonterminal hypergraph no fixed set of connection points (k separability [31] exponential (polynomial) Minas [69] one nonterminal hypergraph hypergraph fixed set of connection points embedding restrictions (k sep. 31] exponential (polynomial) Wittenburg [117] one nonterminal nonempty relational structure no yes explicitly def. vertex ordering by relations exponential relational Ferrucci et al. 39] one nonterminal rel. structure without nonterminal neighbours no yes (bounded degree, connected structure) exponential ....

[Article contains additional citation context not shown here]

K. Wittenburg. Earley-style parsing for relational grammars. In [110], pages 192--199, 1992. 180 CHAPTER 3. APPLICATION TO VISUAL LANGUAGES

....an ASG graph grammar defines the underlying (more abstract) language of all interpretable object configurations. Other VL syntax definition approaches use relations or attributed multisets as their underlying data models. The main (dis)advantage of graph grammars compared with relational grammars [56] is that they enforce a strict distinction between objects (nodes) and relations between objects (arcs, edges) Both approaches are, therefore, more or less equivalent to each other, especially in the case of hypergraph grammars, which use hyperedges as n ary relationship objects. The differences ....

....no exponential Hyper graph one nonterminal hypergraph no fixed set of connection points (k separability [62] exponential (polynomial) Minas [88] one nonterminal hypergraph hypergraph fixed set of connection points embedding restrictions (k sep. 62] exponential (polynomial) Wittenburg [56] one nonterminal nonempty relational structure no yes explicitly def. vertex ordering by relations exponential relational Ferrucci et al. 89] one nonterminal rel. structure without nonterminal neighbours no yes (bounded degree, connected structure) exponential (polynomial) Golin [4] one ....

[Article contains additional citation context not shown here]

K. Wittenburg. Earley-style parsing for relational grammars. In [117], pages 192--199, 1992.

....for use within a syntax directed editor. We propose graph oriented representations, and show how graph grammars can be used to define the allowed graphs at the different levels. However, other syntax definition formalisms, such 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 ....

K. Wittenburg. Earley-style parsing for relational grammars. In Proceedings 8th IEEE Workshop on Visual Languages -- VL'92, pages 192--199, 1992.

....unification based grammars [12] where visual symbols are spatially related ( above , below ) Each production is a context free symbol replacement rule with additional constraints on the symbols spatial relations. A bottom up tabular parsing method constructs derivation trees. In later work [13], an Earley style predictive parser has been proposed 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 ....

K. Wittenburg, "Earley-style parsing for relational grammars", In VL'92 [18], pp. 192--199.

....all graph grammar parsing algorithms presented so far are either unable to recognize interesting languages of graphs or tend to be hopelessly inefficient when applied to graphs with a large number of nodes and edges. Another problem is that nearly all known graph grammar parsing algorithms [2,3,4,5,6,7] deal only with context free productions. This makes them difficult to specify a large portion of VPLs. A context sensitive graph grammar, on the other hand, allows left and right side graphs of a production to have arbitrary number of nodes and edges, like a layered graph grammar proposed ....

K. Wittenburg, Earley--style parsing for relational grammars, Proceedings of 8th IEEE workshop on Visual Languages, Seattle, Washington, pp.192--199, Sep 15--18, 1992.

....all graph grammar parsing algorithms suggested up to now are either unable to recognize interesting languages of graphs, or tend to be hopelessly inefficient when applied to graphs with more than a few dozen nodes and edges 1 . Even worse, all currently known graph grammar parsing algorithms [10, 16, 12, 21, 3, 22, 7] deal with context free productions only (where the left hand side is a single non terminal node) This might be sufficient from the theoretical point of view 2 . But in practice it would be quite useful to allow arbitrary graphs in the left hand side of a production, which might even share a ....

....these examples however, as this section is too long already. 6 Related work Up to now, only a handful of proposals are published on how to parse graph like data structures generated by graph grammars [10, 16, 12, 21] or related formalisms like plex grammars [3] relational fringe grammars [22], or picture layout grammars [7] These approaches fall into two classes with respect to the overall organization of the parsing algorithm. On one side, we have Earley style [5] approaches [3, 22] which start at a single node of the given input graph and extend the already examined part of the ....

[Article contains additional citation context not shown here]

K. Wittenburg. Earley-style parsing for relational grammars. In Proceedings IEEE workshop on Visual Languages -- VL'92, pages 192--199, 1992.

....to Earley style parsing approaches. The first one by Bunke and Haller [3] uses plex grammars, which are a kind of context free graph grammars with rather restricted forms of embedding rules. Any nonterminal has only a fixed number of connection points to its context. The second one by Wittenburg [25] uses dotted rules to organize the parsing process for relational grammars, but without presenting any heuristics how to select good dotted rules. Furthermore, it is restricted to the case of relational structures, where relationships of the same type define partial orders. Finally, the approach ....

K. Wittenburg. Earley-style parsing for relational grammars. In Proceedings 8th IEEE Workshop on Visual Languages -- VL'92, pages 192--199, 1992.

.... a series of alternative frameworks including Positional Grammars (Chang 1988) Costagliola et al. 1991) Picture Layout Grammars (Golin and Reiss 1989) Constraint Set Grammars (Helm and Marriott 1991) Relation Grammars (Crimi et al. 1991) and Relational Grammars (Wittenburg et al..1991; Wittenburg 1992, 1993, 1996) One influence on some recent work in this area has come from constraint logic programming, which is evident in Helm and Marriott s work among others. Loosely speaking, a sign of context freeness in a higher dimensional grammar formalism is that the productions have a restricted ....

....parsing. The framework was first proposed as an extension to unification grammars (Wittenburg et al. Relational Grammars: Theory and Practice in a Visual Language Interface for Process Modeling 4 1990; Wittenburg 1993a) subsequently it was formalized in terms of relational structures directly (Wittenburg 1992, 1993b, 1996) Initially it was used to parse mathematical expressions and line drawings for penbased interfaces. Later applications made use of parsing for verifying multidimensional data (Wittenburg 1993b) offering interactive design support (Weitzman and Wittenburg 1993) and generating ....

[Article contains additional citation context not shown here]

Wittenburg, K. (1992) Earley-style Parsing for Relational Grammars. In Proceedings of IEEE Workshop on Visual Languages, Sept. 15-18, Seattle, Wa., USA, pp.192-199.

.... as a realization procedure that may deliver different documents under differing circumstances. Kochhar, Marks, and Friedell [Koc91] characterize the articulation of a designed artifact along the axis of automaticity, from completely manual to completely automatic. Relational Grammars [Wit91] [Wit92] [Wit93] provide a number of affordances along this axis, some of which have been explored in working prototypes. These paradigms include: Incremental improvement . Graphic design completion . Design verification and error checking . Syntax directed editing . Structural zooming, and . Automatic ....

....7 shows a rule which is utilized repeatedly in the derivation behind Figure 3. The context free backbone of this rule corresponds to the rewrite rule: Article Text Text Text Number Image. Thus 0 indicates the left hand side rule element and 1. n represent the right hand side rule elements. See [Wit92] [Wit93] for details concerning the grammar formalism. Defrule (Make Article The Grammar) 0 Article) 1 Text) 2 Text (Author Of 2 1) 3 Text (Description Of 3 1) 4 Number (Page Of 4 1) 5 Image (Image Of 5 1) OUT ( right of 1 5) right of 2 5) right of 3 5) right of 5 4) top aligned 1 ....

[Article contains additional citation context not shown here]

Wittenburg, K. Earley-style Parsing for Relational Grammars, In Proceedings of IEEE Workshop on Visual Languages (Sept. 15-18, Seattle, Wa.). 1992, pp. 192-199.

No context found.

Wittenburg, K. Earley-style Parsing for Relational Grammars, Proceedings of IEEE Workshop on Visual Languages, Sept. 15-18, 1992, Seattle, Wa.

No context found.

K. Wittenburg. Earley-style Parsing for Relational Grammars. In Proceedings of the 1992 IEEE Workshop on Visual Languages, pages 192-199, Seattle, Washington, September 1992.

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