Sciweavers

8 search results - page 1 / 2
» Parsing Expression Grammar as a Primitive Recursive-Descent ...
Sort
View
81
Voted
FUIN
2007
138views more  FUIN 2007»
15 years 12 days ago
Parsing Expression Grammar as a Primitive Recursive-Descent Parser with Backtracking
Two recent developments in the field of formal languages are Parsing Expression Grammar (PEG) and packrat parsing. The PEG formalism is similar to BNF, but defines syntax in ter...
Roman R. Redziejowski
90
Voted
ESOP
2010
Springer
15 years 3 months ago
TRX: A Formally Verified Parser Interpreter
Parsing is an important problem in computer science and yet surprisingly little attention has been devoted to its formal verification. In this paper, we present TRX: a parser inter...
Adam Koprowski, Henri Binsztok
101
Voted
ICFP
2002
ACM
16 years 12 days ago
Packrat parsing: : simple, powerful, lazy, linear time, functional pearl
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
CORR
2006
Springer
132views Education» more  CORR 2006»
15 years 14 days 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
85
Voted
ECEASST
2008
88views more  ECEASST 2008»
15 years 15 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