Parsing of adaptive star grammars

Electronic Communications of the EASST

Volumn 4, Issue , 2006, Pages

  Minas, Mark ^a  

^a BUNDESWEHR UNIVERSITY MUNICH   (Germany)

Author keywords

Adaptive star grammar; Graph parser

Indexed keywords

EID: 56449110362     PISSN: None     EISSN: 18632122     Source Type: Journal    
DOI: 10.14279/tuj.eceasst.4.17.8     Document Type: Conference Paper

References (14)

1. P. Bottoni, G. Taentzer, A. Schürr. Efficient Parsing of Visual Languages based on Critical Pair Analysis and Contextual Layered Graph Transformation. In VL '00: Proceedings of the 2000 IEEE International Symposium on Visual Languages (VL'00). Pp. 59-60. IEEE Computer Society, Washington, DC, USA, 2000
2. F. Drewes, B. Hoffmann, D. Janssens, M. Minas, N. Van Eetvelde. Adaptive Star Grammars. In Corradini et al. (eds.), Graph Transformations, Third International Conference, ICGT 2006, Natal, Rio Grande do Norte, Brazil, Sept. 17-23, 2006. LNCS 4178, pp. 77-91. Springer-Verlag, Sept. 2006
3. F. Drewes, A. Habel, H.-J. Kreowski. Hyperedge Replacement Graph Grammars. In Rozenberg (ed.), Handbook of Graph Grammars and Computing by Graph Transformation. Vol. I: Foundations. Chapter 2, pp. 95-162.World Scientific, Singapore, 1997
4. F. Drewes, B. Hoffmann, R. Klein, M. Minas. Rule-Based Programming with Dia-Plan. ENTCS 117(1), 2005. Proc. International Workshop on Graph-Based Tools (GRABATS'04)
5. F. Drewes. Recognising k-connected hypergraphs in cubic time. Theoretical Computer Science 109:83-122, 1993
6. B. Hoffmann, D. Janssens, N. Van Eetvelde. Cloning and Expanding Graph Transformation Rules for Refactoring. ENTCS 152(4), 2006. Proc. Graph and Model Transformation Workshop (GRAMOT'05)
7. J. E. Hopcroft, J. D. Ullman. Introduction To Automata Theory, Languages, And Computation. Addison-Wesley, Boston, MA, USA, 1990
8. T. Kasami. An efficient recognition and syntax analysis algorithm for context-free languages. Technical report AFCRL-65-758, Air Force Cambridge Research Laboratory, Bedford Mass., 1965
9. M. Minas. Concepts and Realization of a Diagram Editor Generator Based on Hypergraph Transformation. Science of Computer Programming 44(2):157-180, 2002
10. J. Rekers, A. Schürr. Defining and Parsing visual Languages with Layered Graph Grammars. Journal of Visual Languages and Computing 7(3), 1996/97
11. S. Seifert, I. Fischer. Parsing String Generating Hypergraph Grammars. In Ehrig et al. (eds.), Graph Transformations. LNCS 3256, pp. 352-267. Springer-Verlag, Berlin, 2004
12. A. Schürr, A. Winter, A. Zündorf. The PROGRES Approach: Language and Environment. In Engels et al. (eds.), Handbook of Graph Grammars and Computing by Graph Transformation. Vol. II: Applications, Languages, and Tools. Chapter 13, pp. 487-550. World Scientific, Singapore, 1999
13. D. Younger. Recognition and parsing of context-free Languages in Time n3. Information and Control 10(2):189-208, 1967
14. D.-Q. Zhang, K. Zhang, J. Cao. A Context-sensitive Graph Grammar Formalism for the Specification of Visual Languages. The Computer Journal 44(3):186-200, 2001