Symbol-Relation Grammars: A Formalism for Graphical Languages

Information and Computation

Volumn 131, Issue 1, 1996, Pages 1-46

  Ferrucci, F ^a   Pacini, G ^b   Satta, G ^c   Sessa, M I ^a   Tortora, G ^a   Tucci, M ^a   Vitiello, G ^a  

^a UNIVERSITY OF SALERNO   (Italy)

^b CA' FOSCARI UNIVERSITY OF VENICE   (Italy)

^c UNIVERSITY OF PADOVA   (Italy)

Author keywords

[No Author keywords available]

Indexed keywords

EID: 0002182941     PISSN: 08905401     EISSN: None     Source Type: Journal    
DOI: 10.1006/inco.1996.0090     Document Type: Article

References (53)

1. Aho, A. V., Sethi, R., and Ullman, J. D. (1986), "Compilers - Principles, Techniques and Tools," Addison-Wesley, Reading, MA.
2. Angelaccio, M., Catarci, T., and Santucci, G. (1990), QBD*: A graphical query language with recursion, IEEE Trans. Software Enging. 16, No. 10, 1150-1163.
3. Barbar, K. (1993), Attributed tree grammars, Theoret. Comput. Sci. 119, 3-22.
4. Brandenburg, F. J. (1983), The computational complexity of certain graph grammars, in "Lecture Notes in Computer Science," Vol. 145, pp. 91-99, Springer-Verlag, Berlin/New York.
5. Brandenburg, F. J. (1988), On polynomial time graph grammars, in "Lecture Notes in Computer Science," Vol. 294, pp. 227-236, Springer-Verlag, Berlin/New York.
6. Bunke, H. (1982), Attributed programmed graph grammars and their applications to schematic diagram interpretation, IEEE Trans. Pattern Anal. Mach. Intell. PAMI-4, 6, No. 6, 574-582.
7. Chang, S. K., Ed. (1990a), "Visual Languages and Visual Programming," Plenum, New York.
8. Chang, S. K. (1990b), A visual language compiler for information retrieval by visual reasoning, IEEE Trans. Software Eng. 16, No. 10, 1136-1149.
9. Chok, S. S., and Marriott, K. (1995), Parsing visual languages, in "18th Australasian Computer Science Conference, Glenolg."
10. Costagliola, G., De Lucia, A., Orefice, S., and Tortora, G. (1995), Automatic generation of visual programming environments, IEEE Comput. 28, 56-66.
11. Courcelle, B. (1987), An axiomatic definition of context-free rewriting and its application to NLC graph grammars, Theoret. Comput. Sci. 55, 141-181.
12. Crimi, C. Guercio, A., Nota, G., Pacini, G., Tortora, G., and Tucci, M. (1991), Relation grammars and their application to multi-dimensional languages, J. Visual Languages Comput. 2, 333-346.
13. Crimi, C. Guercio, A., Pacini, G., Tortora, G., and Tucci, M. (1990), Automating visual language generation, IEEE Trans. Software Enging. 16, No. 10, 1122-1135.
14. Earley, J. (1970), An efficient context-free parsing algorithm, Comm. ACM 13, 94-102.
15. Ehrenfeucht, A., and Rozenberg, G. (1984), Restrictions on NLC graph grammars, Theoret. Comput. Sci. 31, 211-223.
16. Engelfriet, J. (1990), Context-free NCE graph grammars, in "Lecture Notes in Computer Science," Vol. 380, pp. 148-161, Springer-Verlag, Berlin/New York.
17. Engelfriet, J., and Filè, G. (1981), The formal power of one-visit attribute grammars, Acta Informat. 16, 275-302.
18. Engelfriet, J., and Leih, G. (1989), Linear graph grammars: Power and complexity, Inform. and Comput. 81, 88-121.
19. Engelfriet, J., Leih G., and Welzl, E. (1990), Boundary graph grammars with dynamic edge relabelling, J. Comput. System Sci. 40, 307-345.
20. Ferrucci, F., Pacini, G., Tortota, G., Tucci, M., and Vitiello, G. (1991), Efficient parsing of multi-dimensional structures, in "Proceedings, IEEE Workshop on Visual Languages, Kobe," pp. 105-110.
21. Ferrucci, F., Tortota, G., and Tucci, M. (1994a), Semantics of visual languages, in "Proceedings of International Workshop on Advanced Visual Interfaces, Bari," pp. 219-221.
22. Ferrucci, F., Tortota, G., Tucci, M., and Vitiello, G. (1994b), A predictive parser for visual languages specified by relation grammars, in "Proceedings, IEEE Symposium on Visual Languages, St. Louis, Missouri," pp. 245-252.
23. Glinert, E. P., and Tanimoto, S. L. (1984), Pict: An interactive graphical programming environment, IEEE Comput. 17, 7-25.
24. Golin, E. J., and Reiss, S. P. (1990), The specification of visual language syntax, J. Visual Languages Comput. 1, 141-157.
25. Gottler, H. (1982), Attributed graph grammars for graphics, in "Proceedings, 2nd Int. Workshop on Graph Grammars and their Applications to Computer Science" (H. Ehrig, M. Nagl, and G. Rozenberg, Eds.), Lecture Notes in Computer Science, Vol. 153, pp. 130-142, Springer-Verlag, Berlin/New York.
26. Gottler, H. (1989), Graph grammars, a new paradigm for implementing visual languages, in "Proceedings, 2nd European Software Engineering Conference" (C. Ghezzi and J. A. McDermid, Eds.), Lecture Notes in Computer Science, Vol. 387, pp. 336-350, Springer-Verlag, Berlin/New York.
27. Harel, D. (1987), StateCharts: A visual formalism for complex systems, Sci. Comput. Programming 8, 231-274.
28. Harel, D. (1988), On visual formalisms, Comm. ACM 31, 514-530.
29. Hirakawa, M., Tanaka, M., and Ichikawa, T. (1990), An iconic programming system, HI-VISUAL, IEEE Trans. Software Enging. 16, No. 10, 1178-1184.
30. Hopcroft, J. E., and Ullman, J. D. (1979), "Introduction to Automata Theory, Languages, and Computation," Addison-Wesley, Reading, MA.
31. Jacob, R. J. K. (1985), A state transition diagram language for visual programming, IEEE Comput. 18, No. 8, 51-59.
32. Janssens, D., and Rozenberg, G. (1980a), On the structure of node-label controlled graph languages, Inform. Sci. 20, 191-216.
33. Janssens, D., and Rozenberg, G. (1980b), Restrictions, extensions and variations of NLC grammars, Inform. Sci. 20, 217-244.
34. Janssens, D., and Rozenberg, G. (1983), Graph grammars with node-label controlled rewriting and embedding, in "Proceedings of the 2nd International Workshop on Graph-Grammars and Their Application to Computer Science" (H. Ehrig, M. Nagl, and G. Rozenberg, Eds.), Lecture Notes in Computer Science, Vol. 153, pp. 186-205, Springer-Verlag, Berlin.
35. Janssens, D., Rozenberg, G., and Verraedt, R. (1982), On sequential and parallel node-rewriting graph grammars, Comput. Graphics Image Process. 18, 279-304.
36. Kaplan, S. M., Goering, S. K., and Campbell, R. H. (1987), Supporting the software development process with attributed NLC grammars, in "Proceedings, 3rd International Workshop on Graph Grammars and Their Applications to Computer Science" (H. Ehrig, M. Nagl, and G. Rozenberg, Eds.), Lecture Notes in Computer Science, Vol. 291, pp. 309-325, Springer-Verlag, Berlin/New York.
37. Knuth, D. E. (1968), Semantics of context-free languages, Math. Systems Theory 2, 127-145.
38. Kreowski, H. J., and Rozenberg, G. (1990a), On structured graph grammars. I, Inform. Sci. 52, 185-210.
39. Kreowski, H. J., and Rozenberg, G. (1990b), On structured graph grammars. II, Inform. Sci. 52, 221-246.
40. Marriott, K. (1994), Constraint multiset grammars, in "Proceedings, IEEE Symposium on Visual Languages, St. Louis, Missouri," pp. 118-125.
41. Penttonen, M. (1974), One-sided and two-sided context in formal grammars, Inform, and Control 25, 371-392.
42. Pfeiffer, J. J. (1992), Parsing graphs representing two dimensional figures, in "Proceedings of the 1992 IEEE Workshop on Visual Languages, Seattle," pp. 200-206.
43. Rekers, J., and Schürr, A. (1995a), "A Parsing Algorithm for Context-Sensitive Graph Grammars" (long version), Technical Report 95-05, Leiden University, The Netherlands.
44. Rekers, J., and Schürr, A. (1995b), A graph grammar approach to graphical parsing, in "Proceedings of the 1995 IEEE Symposium on Visual Languages, Darmstadt."
45. Rozenberg, G. (1987), An introduction to the NLC way of rewriting graphs, in "Lecture Notes in Computer Science," Vol. 291, pp. 55-66, Springer-Verlag, Berlin/New York.
46. Rozenberg, G., and Welzl, E. (1986), Boundary NLC graph grammars - Basic definitions, normal forms, and complexity, Inform, and Control 69, 136-167.
47. Shi, Q. Y., and Fu, K. S. (1983), Parsing and translation of attribute expansive graph languages for scene analysis, IEEE Trans. Pattern Anal. Mach. Intell. 5, 472-485.
48. Slisenko, A. O. (1982), Context-free grammars as a tool for describing polynomial-time subclasses of hard problems, Inform. Process. Lett. 14, 52-56.
49. Tucci, M., Vitiello, G., and Costagliola, G. (1994), Parsing nonlinear languages, IEEE Trans. Software Enging. 20, No. 9, 720-739.
50. Welzl, E., (1984), Encoding graphs by derivations and implications for the theory of graph grammars, in "Lecture Notes in Computer Science," Vol. 172, pp. 503-513, Springer-Verlag, Berlin/New York.
51. Wittenburg, K. and Weitzman, L. (1990), Visual grammars and incremental parsing for interface languages, in "Proceedings, IEEE Workshop on Visual Languages, Skokie, Illinois," pp. 111-118.
52. Wittenburg, K. (1992), Earley-style parsing for relational grammars, in "Proceedings, IEEE Workshop on Visual Languages, Seattle," pp. 192-199.
53. Yamazaki, K., and Yaku, T. (1993), A pumping lemma and the structure of derivations in the Boundary NLC graph languages, Inform. Sci. 75, 81-97.