21 search results - page 1 / 5 » Hyperedge Replacement, Graph Grammars |
ECEASST
2008
13 years 6 months ago
2008
: Graph parsing is known to be computationally expensive. For this reason the construction of special-purpose parsers may be beneficial for particular graph languages. In the domai...
GG
1997
Springer
13 years 10 months ago
1997
Springer
JOLLI
2010
13 years 4 months ago
2010
rder Abstract Categorial Grammars as Hyperedge Replacement Grammars Makoto Kanazawa National Institute of Informatics 2–1–2 Hitotsubashi, Chiyoda-ku, Tokyo, 101–8430, Japan A...
TAGT
1994
Springer
13 years 10 months ago
1994
Springer
An operation of concatenation is introduced for graphs. Then strings are viewed as expressions denoting graphs, and string languages are interpreted as graph languages. For a clas...
ECEASST
2010
13 years 3 months ago
2010
Abstract. The precise specification of software models is a major concern in model-driven design of object-oriented software. In this paper, we investigate how program graphs, a la...