Sciweavers

85
Voted
ECEASST
2008
88views more  ECEASST 2008»
15 years 11 days ago
Parsing of Hyperedge Replacement Grammars with Graph Parser Combinators
: 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...
Steffen Mazanek, Mark Minas