Sciweavers

667 search results - page 6 / 134
» Total parser combinators
Sort
View
ENTCS
2007
107views more  ENTCS 2007»
15 years 5 months ago
Executable Grammars in Newspeak
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...
Gilad Bracha
ESOP
2010
Springer
15 years 9 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
AGP
1998
IEEE
15 years 10 months ago
Parsing with Non-Deterministic Functions
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...
Rafael Caballero, Francisco Javier López-Fr...
151
Voted
NAACL
2001
15 years 7 months ago
A Probabilistic Earley Parser as a Psycholinguistic Model
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...
John Hale
MPC
2010
Springer
165views Mathematics» more  MPC 2010»
15 years 10 months ago
Dependently Typed Grammars
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...
Kasper Brink, Stefan Holdermans, Andres Löh