667 search results - page 1 / 134 » Total parser combinators |
ICFP
2010
ACM
13 years 12 months ago
2010
ACM
A monadic parser combinator library which guarantees termination of parsing, while still allowing many forms of left recursion, is described. The library's interface is simil...
ENTCS
2000
13 years 10 months ago
2000
We develop, in a stepwise fashion, a set of parser combinators for constructing deterministic, error-correcting parsers. The only restriction on the grammar is that it is not left...
NAACL
2007
14 years 9 days ago
2007
Contemporary parser research is, to a large extent, focused on statistical parsers and deep-unification-based parsers. This paper describes an alternative, hybrid architecture in ...
ECEASST
2008
13 years 11 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...
CICLING
2003
Springer
14 years 4 months ago
2003
Springer
A new sort of generative grammar (Sec2) will be demonstrated which is more radically “lexicalist” than any earlier one (Sec1). It is a modified Unification Categorial Gramma...