4 citations found. Retrieving documents...
Genarro Costagliola, Andrea De Lucia, Sergio Orefice, and Genny Tortora. Positional grammars: A formalism for LR-like parsing of visual languages. In Visual Language Theory, pages 171--191. Springer-Verlag, New York, 1998.

 Home/Search   Document Not in Database   Summary   Related Articles   Check  

This paper is cited in the following contexts:
Specification and Analysis Techniques for Visual.. - Bardohl, Ermel, Weinhold (2002)   (Correct)

....Java And Back Again) are out of the scope for a comparison. Most tools for creating free hand editors analyze diagrams directly and avoid to create an internal representation model like a graph. No internal model is taken into account, for example, in VisPro [ZZ98] Penguins [Penguins] and Vlcc [CLOT98, VLCC]. Vlcc employs positional grammars and an LALR(1) like parser. In [CP00] extended positional grammars are introduced such that this approach is no longer restricted to context free grammars. In Penguins constraint multiset grammars and a Prolog like parser are used, whereas in VisPro reserved ....

....In Penguins constraint multiset grammars and a Prolog like parser are used, whereas in VisPro reserved graph grammars and a graph parser are taken into account [ZZ97] However, in VisPro the set of VLs is restricted to diagrammatic VLs, i.e. symbols can be connected by lines and arrows only. Vlcc [CLOT98, VLCC] and DiaGen [KM00, Diagen] hypergraph grammars) use restricted context sensitive rules to parse VLs. It is mentioned in several publications that all VLs can be captured by the corresponding approaches. However, critical pair analysis as it is supported by Agg GenGED is not yet regarded. ....

G. Costagliola, A.D. Lucia, S. Ore ce, and G. Totora. Positional Grammars: A Formalism for LR-Like Parsing of Visual Languages. In [MM98], pages 171-192. 1998.


Applying Compiler Techniques to Diagram Recognition - Blostein, Cordy, Zanibbi (2002)   (Correct)

.... imported include the use of grammars (array grammars [26] tree grammars [2] 13] set grammars [3] 15] graph grammars [29] and parsing technologies (for example, CYK and Early algorithms for context free grammars [13] and linear time LR and LL parsing algorithms for more restricted languages [11]) Attributes and attribute computation rules are used with all types of grammars [13] For example, Anderson uses numeric attributes for bounding box coordinates, and string attributes to record the meaning of the interpreted math notation [3] There are further possibilities for exploiting ....

....Start( locates the first symbol in a baseline, and Hor0 finds the next symbol in a baseline. Image subregions are defined around baseline symbols, and the search functions are recursively applied in these subregions. The initial inspiration for this approach came from Positional Grammars [11]; significant extensions were needed to handle the inexact symbol placement common in handwritten math expressions. We now compare the compiler passes (Figure 1) to the passes DRACULAE uses for math notation (Figure 3) DRACULAE s Layout Pass converts the set of symbols to a tree. A compiler has ....

G. Costagliola et al., "Positional Grammars: A Formalism for LR-Like Parsing of Visual Languages," in Visual Language Theory, Springer, 1998, 171-191.


Visual Language Parsing in GenGEd - Bardohl, Schultzke, Taentzer (2001)   (2 citations)  (Correct)

....the de nition of layering conditions guaranteeing termination of the parsing process. Furthermore, static analysis techniques like critical pair analysis [10,9,12] are available which can be exploited to identify a maximum set of rules which may be parsed without any need for backtracking. VLCC [3] and DiaGen [8] use restricted context sensitive rules to parse VLs. This kind of rules is successfully applied to rather simple languages but 1 Research partially supported by the German Research Council (DFG) and the projects APPLIGRAPH (ESPRIT Basic Research WG) and GRAPHIT (CNPq and DLR) ....

G. Costagliola, A.D. Lucia, S. Orece, and G. Totora. Positional Grammars: A Formalism for LR-Like Parsing of Visual Languages. In K. Marriott and B. Meyer, editors, Visual Language Theory, pages 171{ 192, Springer, 1998.


Recognition of Mathematics Notation via Computer Using Baseline.. - Zanibbi (2000)   (Correct)

No context found.

Genarro Costagliola, Andrea De Lucia, Sergio Orefice, and Genny Tortora. Positional grammars: A formalism for LR-like parsing of visual languages. In Visual Language Theory, pages 171--191. Springer-Verlag, New York, 1998.

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