3 search results - page 1 / 1 » Parsing of Hyperedge Replacement Grammars with Graph Parser ... |
ECEASST
2008
13 years 5 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
2004
Springer
13 years 10 months ago
2004
Springer
A string generating hypergraph grammar is a hyperedge replacement grammar where the resulting language consists of string graphs i.e. hypergraphs modeling strings. With the help of...
ESSLLI
1999
Springer
13 years 9 months ago
1999
Springer
This paper presents a grammar formalism in which constituent graphs are unions of a continuous surface tree and a discontinuous deep tree. The formalism has an object-oriented desi...