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

Relational Grammars (RGs) are one of the higher-dimensional grammar formalisms that have been proposed for representing visual languages (VLs). This paper serves as an overview of the formalism as well as a case study of its application in a visual language interface (VLI) for process modeling. Relational Grammars are a member of the context-free family of Constraint Multiset Grammars (Marriott and Meyer, this volume), and several subclasses of Relational Grammars have been proposed that have been motivated by the algorithmic demands of specific applications. The applications that have been explored go beyond the exercise of recognizing visual expressions that can be constructed with standard graphical editors. Here we focus on a business process modeling tool called ShowBiz and discuss how grammatical representation and parsing is used dynamically in creating aggregations for process encapsulation and visual focusing.

[1]  Geoffrey K. Pullum,et al.  Generalized Phrase Structure Grammar , 1985 .

[2]  Bernd Meyer,et al.  Pictures depicting pictures on the specification of visual languages by visual grammars , 1992, Proceedings IEEE Workshop on Visual Languages.

[3]  Manojit Sarkar,et al.  Graphical fisheye views of graphs , 1992, CHI.

[4]  James D. Hollan,et al.  Pad++: a zooming graphical interface for exploring alternate interface physics , 1994, UIST '94.

[5]  Kent Wittenburg,et al.  F-PATR: A Functional Constraints for Unification-Based Grammars , 1993, ACL.

[6]  Kent Wittenburg Predictive Parsing for Unordered Relational Languages , 1996 .

[7]  Louis Weitzman,et al.  Qualitative Visualization of Processes: Attributed Graph Layout and Focusing Techniques , 1996, Graph Drawing.

[8]  Mark D. Gross,et al.  Recognizing and interpreting diagrams in design , 1994, AVI '94.

[9]  Kent Wittenburg Earley-style parsing for relational grammars , 1992, Proceedings IEEE Workshop on Visual Languages.

[10]  Luis Alberto Pineda Reference, Synthesis and Constraint Satisfaction * , 1992, Comput. Graph. Forum.

[11]  Eric J. Golin,et al.  Parsing visual languages with picture layout grammars , 1991, J. Vis. Lang. Comput..

[12]  Jay Earley,et al.  An efficient context-free parsing algorithm , 1970, Commun. ACM.

[13]  Kent Wittenburg,et al.  Visual Language Parsing: If I Had a Hammer , 1995, Multimodal Human-Computer Communication.

[14]  Doug Kimelman,et al.  Reduction of Visual Complexity in Dynamic Graphs , 1994, Graph Drawing.

[15]  Franz-Josef Brandenburg On Polynomial Time Graph Grammars , 1988, STACS.

[16]  Louis Weitzman,et al.  Relational grammars for interactive design , 1993, Proceedings 1993 IEEE Symposium on Visual Languages.

[17]  Louis Weitzman,et al.  Unification-based grammars and tabular parsing for graphical languages , 1991, J. Vis. Lang. Comput..

[18]  Eric J. Golin,et al.  The specification of visual language syntax , 1990, J. Vis. Lang. Comput..

[19]  Jan Rekers On the use of Graph Grammars for defining the Syntax of Graphical Languages , 1994 .

[20]  L. Weitzman,et al.  Grammar-based articulation for multimedia document design : Special section on ACM Multimedia 1994 , 1996 .

[21]  Harry Bunt,et al.  Recent Advances in Parsing Technology , 1996 .