# A Context-sensitive Graph Grammar Formalism for the Specification of Visual Languages

@article{Zhang2001ACG, title={A Context-sensitive Graph Grammar Formalism for the Specification of Visual Languages}, author={Da-Qian Zhang and Kang Zhang and Jiannong Cao}, journal={Comput. J.}, year={2001}, volume={44}, pages={186-200} }

Graph grammars may be used as natural and powerful syntax-definition formalisms for visual programming languages. Yet most graph-grammar parsing algorithms presented so far are either unable to recognize interesting visual languages or tend to be inefficient (with exponential time complexity) when applied to graphs with a large number of nodes and edges. This paper presents a context-sensitive graph grammar called reserved graph grammar, which can explicitly and completely describe the syntax…

## Figures and Tables from this paper

## 110 Citations

Partial precedence of context-sensitive graph grammars

- Computer ScienceVINCI
- 2017

The notion of partial precedence is introduced, the partial precedence graph of a graph grammar is defined and theoretically unveils the existence of a valid parsing path conforming to the topological orderings of thepartial precedence graph.

Edge-based graph grammar: theory and support system

- Computer ScienceJournal of Visual Languages and Sentient Systems
- 2018

A new context-sensitive graph grammar formalism called Edge-based Graph Grammar or EGG is proposed, in which a new methodology is proposed to tackle issues, such as the embedding problem, the membership problem and the parsing algorithm.

Improving the graph grammar parser of Rekers and Schürr

- Computer ScienceIET Softw.
- 2011

Experimental results show that for some (meaningful) graph grammars, the proposed improvements can enhance the parser's performance by orders of magnitude, and will hopefully increase both theparser's applicability and the interest in visual language parsing in general.

An Edge-based Graph Grammar Formalism and its Support System

- Computer ScienceDMSVIVA
- 2018

A new context-sensitive graph grammar formalism called Edge-based Graph Grammar or EGG is proposed, in which a new methodology is proposed to tackle issues, such as the embedding problem, the membership problem and the parsing algorithm.

Context Computation for Implicit Context-Sensitive Graph Grammars: Algorithms and Complexities

- Computer ScienceJ. Vis. Lang. Comput.
- 2019

The proposed approach paves the way for the practical applications of context in implicit context-sensitive graph grammar formalisms, such as facilitating the comprehension of graph grammars and improving parsing performance of general parsing algorithms.

Parsing Strategies for Context-Sensitive Graph Grammars

- Computer ScienceVINCI
- 2019

Two strategies for general parsing algorithms are presented, one is context matching, and the other is partitioning of productions, which can considerably improve the parsing performance.

Graph Grammar Induction on Structural Data for Visual Programming

- Computer Science2006 18th IEEE International Conference on Tools with Artificial Intelligence (ICTAI'06)
- 2006

An induction method is given to infer node replacement graph grammars from various structural representations and the correctness of an inferred grammar is verified by parsing graphs not present in the training set.

Constructing Confluent Context-sensitive Graph Grammars from Non-confluent Productions for Parsing Efficiency

- Computer ScienceVINCI
- 2009

An extended formalism XRGG is proposed which allows imposing constraints characterizing application situations on graph productions, and can be easily generalized to other context-sensitive graph grammar formalisms, making the efficient parsing algorithm of the RGG that depends on confluent graph grammars more widely applicable.

Research on context of implicit context-sensitive graph grammars

- Computer ScienceJ. Comput. Lang.
- 2019

## References

SHOWING 1-10 OF 26 REFERENCES

Viability of a Parsing Algorithm for Context-Sensitive Graph Grammars

- Computer Science
- 1996

A first implementation of this algorithm for parsing a large class of context-sensitive graph grammars is described as well as several improvements, additional work, examples, theory of operation and performance characteristics.

Defining and Parsing Visual Languages with Layered Graph Grammars

- Computer ScienceJ. Vis. Lang. Comput.
- 1997

The notion of layeredcontext-sensitive graph grammars, together with a bottom-up/top-down parsing algorithm, which can be used to generate syntax directed VL editors, which support "free editing' and parsing of their underlying graph structures.

Graph-Grammars and Their Application to Computer Science

- Computer ScienceLecture Notes in Computer Science
- 1986

An efficient algorithm for the solution of hierarchical networks of constraints and a software development environment based on graph technology are introduced.

A method for the specification and parsing of visual languages

- Computer Science
- 1991

This dissertation develops the attributed multiset grammar model and gives a spatial parsing algorithm for picture layout grammars and describes the GREEN environment, which combines an object-oriented graphics editor with the spatial parser to form a grammar-based visual programming environment.

A predictive parser for visual languages specified by relation grammars

- Computer ScienceProceedings of 1994 IEEE Symposium on Visual Languages
- 1994

A class of relation grammars that satisfy the context-freeness property is defined, which is an essential condition to solve the membership problem in polynomial time, and a predictive parsing algorithm is designed for such Grammars.

Boundary NLC Graph Grammars-Basic Definitions, Normal Forms, and Complexity

- Computer ScienceInf. Control.
- 1986

Relational Grammars: Theory and Practice in a Visual Language Interface for Process Modeling

- Computer Science
- 1996

This paper serves as an overview of the Relational Grammars formalism as well as a case study of its application in a visual language interface (VLI) for process modeling and discusses how grammatical representation and parsing is used dynamically in creating aggregations for process encapsulation and visual focusing.

Unification-based grammars and tabular parsing for graphical languages

- Computer ScienceJ. Vis. Lang. Comput.
- 1991

Parsing of graphs in linear time

- Computer ScienceGraph-Grammars and Their Application to Computer Science
- 1982

Conditions of parsing in linear time using the well-known Wirth/Weber precedence approach are discussed, and a special graph grammar class satisfying these conditions as well as an appropriate linear time precedence parser is presented.

Automated program recognition by graph parsing

- Computer Science
- 1992

A graph parsing approach to automating program recognition in which programs are represented as attributed dataflow graphs and a library of cliches is encoded as an attributed graph grammar is developed and studied.