Sciweavers

7 search results - page 2 / 2
» Recursive descent parsing for Boolean grammars
Sort
View
CORR
2006
Springer
132views Education» more  CORR 2006»
13 years 5 months ago
Packrat Parsing: Simple, Powerful, Lazy, Linear Time
Packrat parsing is a novel technique for implementing parsers in a lazy functional programming language. A packrat parser provides the power and flexibility of top-down parsing wi...
Bryan Ford
ECEASST
2008
88views more  ECEASST 2008»
13 years 5 months 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