Reserved Graph Grammar: A Specification Tool for Diagrammatic VPLs

Authors:
Daqian Zhang;Kang Zhang
Affiliations:
-;-
Venue:
VL '97 Proceedings of the 1997 IEEE Symposium on Visual Languages (VL '97)
Year:
1997

Citing 0
Cited 10

Design, Construction, and Application of a Generic Visual Language Generation Environment

IEEE Transactions on Software Engineering
Graphical Transformation of Multimedia XML Documents

Annals of Software Engineering
Grammar-Based Layout for a Visual Programming Language Generation System

DIAGRAMS '02 Proceedings of the Second International Conference on Diagrammatic Representation and Inference
Using graph grammar to implement global layout for a visual programming language generation system

VIP '01 Proceedings of the Pan-Sydney area workshop on Visual information processing - Volume 11
Compiled visual programs by VisPro

VIP '05 Proceedings of the Pan-Sydney area workshop on Visual information processing
Syntax-Directed Implementation of Visual Languages Based on Automaton Graphical Grammars

Programming and Computing Software
Visual language semantics specification in the VisPro system

VIP '02 Selected papers from the 2002 Pan-Sydney workshop on Visualisation - Volume 22
AutoGen: Easing model management through two levels of abstraction

Journal of Visual Languages and Computing
Defining the abstract syntax of visual languages with advanced graph grammars-A case study based on behavior trees

Journal of Visual Languages and Computing
Unit-level test adequacy criteria for visual dataflow languages and a testing methodology

ACM Transactions on Software Engineering and Methodology (TOSEM)

Quantified Score

Hi-index	0.00

Visualization

Abstract

When implementing textual languages, formal grammars are commonly used to facilitate understanding languages and creating parsers. In the implementation of a diagrammatic visual programming language (VPL), this rarely happens, though graph grammars with their well-established theoretical background may be used as a naturally and powerful syntax-definition formalism. Yet all graph grammar parsing algorithms presented up to now are either unable to recognize interesting visual languages or tend to be hopelessly 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, efficiently and completely describe the syntax of a wide range of diagrams using labeled graphs. Moreover, its parsing algorithm is of polynomial time complexity in most cases.