Change search
ReferencesLink to record
Permanent link

Direct link
Contextual Hyperedge Replacement
Umeå University, Faculty of Science and Technology, Department of Computing Science. (Natural and Formal Languages)
Universität Bremen.
2014 (English)Report (Other academic)
Abstract [en]

Contextual hyperedge-replacement grammars (contextual grammars, for short) are an extension of hyperedge replacement grammars. They have recently been proposed as a grammatical method for capturing the structure of object-oriented programs, thus serving as an alternative to the use of meta-models like UML class diagrams in model-driven software design.In this paper, we study the properties of contextual grammars. Even though these grammars are not context-free, one can show that they inherit several of the nice properties of hyperedge replacement grammars. In particular, they possess useful normal forms and their membership problem is in NP.

Place, publisher, year, edition, pages
Umeå: Umeå universitet , 2014. , 28 p.
Report / UMINF, ISSN 0348-0542 ; 14.04
Keyword [en]
graph grammar, hyperedge replacement, context, contextual grammar
National Category
Computer Science
Research subject
Computer Science
URN: urn:nbn:se:umu:diva-85532OAI: diva2:694251
Available from: 2014-02-06 Created: 2014-02-06 Last updated: 2014-02-11Bibliographically approved

Open Access in DiVA

fulltext(461 kB)119 downloads
File information
File name FULLTEXT02.pdfFile size 461 kBChecksum SHA-512
Type fulltextMimetype application/pdf

Search in DiVA

By author/editor
Drewes, Frank
By organisation
Department of Computing Science
Computer Science

Search outside of DiVA

GoogleGoogle Scholar
Total: 119 downloads
The number of downloads is the sum of all downloads of full texts. It may include eg previous versions that are now no longer available

Total: 63 hits
ReferencesLink to record
Permanent link

Direct link