Abstract
Formal grammars have been widely used for the formal description of visual languages and for the implementation of general lexical analyzers, parsers, semantic analyzers, syntax-driven visual programming environments, etc. This chapter analyzes the formalism ofsymbol relation grammarsand compares its features with the ones of other existing models. In this formalism each sentence is composed of a set ofsymbol occurrencesrepresenting visual elementary objects, which are related through a set of binaryrelational items.The main feature of symbol relation grammars is the uniform way they use context-free productions to rewrite symbol occurrences as well as relational items. The clearness and uniformity of the derivation process for symbol relation grammars allows syntactic tree structures to be easily defined as a natural extension of the traditional syntactic trees of context-free string grammars. The main application of these structures is to extend well established techniques of syntactic and semantic analysis to the case of symbol relation grammars and prove properties of their derivation process.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
Similar content being viewed by others
References
K. Barbar. Attributed tree grammars.Theoretical Computer Science119:3–22, 1993.
F. Brandenburg. On polynomial time graph grammars. In G. Goos and J. Hartmanis, editorsSTACS 88: 5th Annual Symposium on Theoretical Aspects of Computer Sciencepages 227–236. Springer-Verlag, New York, 1988.
H. Bunke. Attributed programmed graph grammars and their applications to schematic diagram interpretation.IEEE Transaction on Pattern Analysis and Machine Intelligence4(6):574–582, 1982.
S.-K. ChangVisual Languages and Visual Programming.Plenum Publishing Corporation, New York, 1990.
G. Costagliola, A. De Lucia, S. Orefice, and G. Tortora. Automatic generation of visual programming environments.IEEE Computer28:56–66, 1995.
C. Crimi, A. Guercio, G. Nota, G. Pacini, G. Tortora, and M. Tucci. Relation grammars and their application to multi-dimensional languages.Journal of Visual Languages and Computing2:333–346, 1991.
J. Engelfriet. Context-free nce graph grammars. In J. Csirik, J. Demetrovics, and F. Gecseg, editorsFundamentals of Computation Theoryvolume 380 ofLecture Notes in Computer Sciencepages 148–161. Springer-Verlag, New York, 1989.
J. Engelfriet and G. Filé. The formal power of one-visit attribute grammars.Acta Informatica16:275–302, 1981.
J. Engelfriet, G. Leih, and E. Welzl. Boundary graph grammars with dynamic edge relabelling.Journal of Computer and System Sciences40:307–345, 1990.
F. Ferrucci, G. Pacini, G. Satta, G. Tortora M. Sessa, M. Tucci, and G. Vitiello. Symbol-relation grammars- A formalism for graphical languages.Information and Computation131:1–46, 1996.
F. Ferrucci, G. Pacini, G. Tortora, M. Tucci, and G. Vitiello. Efficient parsing of multi-dimensional structures. InProcs. IEEE Workshop on Visual Languagespages 105–110, Kobe, Japan, 1991.
F. Ferrucci, G. Tortora, and M. Tucci. Semantics of visual languages. InProceedings of International Workshop on Advanced Visual Interfacespages 219–221, Bari, Italy, 1994.
F. Ferrucci, G. Tortora, M. Tucci, and G. Vitiello. A predictive parser for visual languages specified by relation grammars. InProcs. IEEE Symposium on Visual Languagespages 245–252, St. Louis, Missouri, 1994.
E.J. Golin and S.P. Reiss. The specification of visual language syntax.Journal of Visual Languages and Computing1:141–157, 1990.
H. Göttler. Attributed graph grammars for graphics. In H. Ehrig, M. Nagl, and G. Rozenberg, editorsProceedings 2nd Int. Workshop on Graph Grammars and their Applications to Computer Sciencevolume 153 ofLecture Notes in Computer Sciencepages 130–142. Springer-Verlag, New York, 1982.
H. Göttler. Graph grammars, a new paradigm for implementing visual languages. In C. Ghezzi and J.A. McDermid, editorsProceedings 2nd European Software Engineering Conf.volume 387 ofLecture Notes in Computer Sciencepages 336–350. Springer-Verlag, New York, 1989.
R. Helm and K. Marriott. A declarative specification of visual languages.Journal of Visual Languages and Computing2:311–331, 1991.
D. Janssens and G. Rozenberg. On the structure of node-label controlled graph languages.Information Sciences20:191–216, 1980.
D. Janssens, G. Rozenberg, and R. Verraedt. On sequential and parallel node-rewriting graph grammars.Computer Graphics and Image Processing18:279–304, 1982.
M. Kaul. Practical applications of precedence graph grammars. In E. Ehrig et al., editorProceedings 3rd International Workshop on Graph Grammarsvolume 291 ofLecture Notes in Computer Sciencepages 326–342. Springer-Verlag, New York, 1987.
D.E. Knuth. Semantics of context-free languages.Math. Syst. Theor.2:127–145, 1968.
H.J. Kreowski and G. Rozenberg. On structured graph grammars.Information Sciences52:185–210, 1990.
U. Lichtblau. Recognizing rooted context-free flowgraph languages in polynomial time. InProceedings 4th International Workshop on Graph Grammarsvolume 532 ofLecture Notes in Computer Sciencepages 538–548. Springer-Verlag, New York, 1991.
K. Marriott. Constraint multiset grammars. InProcs. IEEE Symposium on Visual Languagespages 118–125, St. Louis, USA, 1994.
J.J. Pfeiffer. Parsing graphs representing two dimensional figures. InProcs.of the 1992 IEEE Workshop on Visual Languagespages 200–206, Seattle, USA, 1992.
J. Rekers and A. Schurr. A graph grammar approach to graphical parsing. InProcs. IEEE Symposium on Visual LanguagesDarmstadt, Germany, 1995.
J. Rekers and A. Scharr. A parsing algorithm for context-sensitive graph grammars (long version). Technical Report Technical Report 95–05, Leiden University, The Netherlandshttp://www.wi.leidenuniv.nl/TechRep/tr96-09.html Journal of Visual Languages and Computin
M. Tucci, G. Vitiello, and G. Costagliola. Parsing nonlinear languages.IEEE Trans. on Software Engineering20(9):720–739, 1994.
K. Wittenburg. Earley-style parsing for relational grammars InProcs.of the 1992 IEEE Workshop on Visual Languagespages 192–199, Seattle, USA, 1992.
K. Wittenburg and L. Weitzman. Visual grammars and incremental parsing for interface languages. InProcs. IEEE Workshop on Visual Languagespages 111–118, Skokie, USA, 1990.
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 1998 Springer Science+Business Media New York
About this chapter
Cite this chapter
Ferrucci, F., Tortora, G., Tucci, M., Vitiello, G. (1998). Relation Grammars: A Formalism for Syntactic and Semantic Analysis of Visual Languages. In: Marriott, K., Meyer, B. (eds) Visual Language Theory. Springer, New York, NY. https://doi.org/10.1007/978-1-4612-1676-6_7
Download citation
DOI: https://doi.org/10.1007/978-1-4612-1676-6_7
Publisher Name: Springer, New York, NY
Print ISBN: 978-1-4612-7240-3
Online ISBN: 978-1-4612-1676-6
eBook Packages: Springer Book Archive