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)ORCID iD: 0000-0001-7349-7693
University of Bremen.
2015 (English)In: Acta Informatica, ISSN 0001-5903, E-ISSN 1432-0525, Vol. 52, no 6, 497-524 p.Article in journal (Refereed) Published
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
Springer, 2015. Vol. 52, no 6, 497-524 p.
Keyword [en]
Graph grammar, Hyperedge replacement, Context, Contextual grammar
National Category
Computer Science
Research subject
Computer Science
URN: urn:nbn:se:umu:diva-99085DOI: 10.1007/s00236-015-0223-4ISI: 000359813500002OAI: diva2:785761
Available from: 2015-02-03 Created: 2015-02-03 Last updated: 2015-09-21Bibliographically approved

Open Access in DiVA

No full text

Other links

Publisher's full text

Search in DiVA

By author/editor
Drewes, Frank
By organisation
Department of Computing Science
In the same journal
Acta Informatica
Computer Science

Search outside of DiVA

GoogleGoogle Scholar
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

Altmetric score

Total: 45 hits
ReferencesLink to record
Permanent link

Direct link