Structured development of graph-grammars for icon manipulation
Pages 46 - 51
Abstract
In this work we are showing a structured process to build a grammar for icon manipulation. We presuppose that the object to be manipulated in the computer screen can be stated as a set of relations among its parts. We describe a procedure to generate a program that manipulates the object, guaranteeing that only objects with those properties will be constructed, and that every instance of that object is allowable. The formation rules for the object are stored in terms of attributed graph-grammars productions.
References
[1]
{1} M. B. Albizuri-Romero, "GRASE - A Graphical Syntax-Directed Editor for Structured Programming", SIGPLAN Notices, Vol. 19, n. 2, pp. 28-37, Feb. 1984.
[2]
{2} F. Arefi et al. "Automatically Generating Visual Syntax-Directed Editors", Comm. of the ACM, March 1990, Vol. 33, n. 3, pp. 349-360.
[3]
{3} A. Berztiss, "Formal Specification Methods and Visualization", Chap. 4 of S. K. Chang (ed.), Principles of Visual Programming Languages, Prentice-Hall, 1990.
[4]
{4} H. Bromley and R. Lamson, "LISP LORE: A Guide to Programming the Lisp Machine", 2nd ed., Kluwer Academic, 1987.
[5]
{5} H. Bunke, "Attributed Programmed Graph Grammars and Their Application to Schematic Diagram Interpretation", IEEE Trans. on Pat. Anal. and Mach. Intel. Vol. 4, n. 6, Nov. 1982, pp. 574-582.
[6]
{6} H. Bunke, "Programmed Graph Grammars", Lect. Not. in Comp. Sci., Vol. 73, pp. 155-166, Springer-Verlag 1979.
[7]
{7} J. J. Dolado et al., "Formal Manipulation of Forrester Diagrams by Graph Grammars", IEEE Trans. on Syst., Man and Cyb., Vol. 18, n. 6, pp. 981-996.
[8]
{8} J. J. Dolado, "An Interface for Qualitative Simulation of System Dynamics Models" (in Spanish), unpublished Ph.D. dissertation, 1989, University of the Basque Country, Spain.
[9]
{9} J. J. Dolado, "A Framework for the Automated Development of Graphical Mathematical Software for Systems Modeling", Proc. of the 1989 Int. Conf. of the IEEE Syst. Man and Cyb. Soc., pp. 872-874.
[10]
{10} M. Edel, "The Tinkertoy Graphical Programming Environment", IEEE Trans. on Soft. Engin., Vol. 14, No. 8, pp. 1110-1115, Aug. 1988.
[11]
{11} H. Göttler, "Attributed Graph Grammars for Graphics", in Graph-grammars and their Application to Computer Science, Lect. Not. in Comp. Sci., Vo1. 153, pp. 130-142, Springer-Verlag 1983.
[12]
{12} H. Göttler, "Graph Grammars and Diagram Editing", in Graph-grammars and their Application to Computer Science, Lect. Not. in Comp. Scie., Vol. 291, pp. 216-231, 1987, Springer-Verlag
[13]
{13} K. Halewood and M. R. WoodWard, "NSEDIT: a Syntax-Directed Editor and Testing Tool based on Nassi-Shneiderman Charts", Software - Practice and Experience, 18 (10), 987-998 (1988).
[14]
{14} B. A. Myers, "Taxonomies of Visual Programming and Program Visualization", Journal of Visual Languages and Computing, Vol. 1, n. 1, March 1990, pp. 97-123.
[15]
{15} N. C. Shu, "Visual Programming", Van Nostrand Reinhold, 1988.
Index Terms
- Structured development of graph-grammars for icon manipulation
Recommendations
Parsing expression grammars: a recognition-based syntactic foundation
POPL '04: Proceedings of the 31st ACM SIGPLAN-SIGACT symposium on Principles of programming languagesFor decades we have been using Chomsky's generative system of grammars, particularly context-free grammars (CFGs) and regular expressions (REs), to express the syntax of programming languages and protocols. The power of generative grammars to express ...
Parsing expression grammars: a recognition-based syntactic foundation
POPL '04For decades we have been using Chomsky's generative system of grammars, particularly context-free grammars (CFGs) and regular expressions (REs), to express the syntax of programming languages and protocols. The power of generative grammars to express ...
Lexicalized context-free grammars
ACL '93: Proceedings of the 31st annual meeting on Association for Computational LinguisticsLexicalized context-free grammar(LCFG) is an attractive compromise between the parsing efficiency of context-free grammar (CFG) and the elegance and lexical sensitivity of lexicalized tree adjoining grammar (LTAG). LCFG is a restricted form of LTAG that ...
Comments
Information & Contributors
Information
Published In
Copyright © 1991 Author.
Publisher
Association for Computing Machinery
New York, NY, United States
Publication History
Published: 01 July 1991
Published in SIGSOFT Volume 16, Issue 3
Check for updates
Qualifiers
- Article
Contributors
Other Metrics
Bibliometrics & Citations
Bibliometrics
Article Metrics
- 0Total Citations
- 141Total Downloads
- Downloads (Last 12 months)51
- Downloads (Last 6 weeks)7
Reflects downloads up to 12 Feb 2025
Other Metrics
Citations
View Options
Login options
Check if you have access through your login credentials or your institution to get full access on this article.
Sign in