667 search results - page 6 / 134 » Total parser combinators |
ENTCS
2007
13 years 8 months ago
2007
We describe the design and implementation of a parser combinator library in Newspeak, a new language in the Smalltalk family. Parsers written using our library are remarkably simi...
ESOP
2010
Springer
14 years 3 days ago
2010
Springer
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...
AGP
1998
IEEE
14 years 1 months ago
1998
IEEE
Parsing has been a traditional workbench for showing the virtues of declarative programming. Both logic and functional programming claim the ability of writing parsers in a natura...
NAACL
2001
13 years 10 months ago
2001
In human sentence processing, cognitive load can be defined many ways. This report considers a definition of cognitive load in terms of the total probability of structural options...
MPC
2010
Springer
14 years 1 months ago
2010
Springer
Parser combinators are a popular tool for designing parsers in functional programming languages. If such combinators generate an abstract representation of the grammar as an interm...