Efficient Combinator Parsers

Koopman, Pieter; Plasmeijer, M.J.

doi:10.1007/3-540-48515-5_8

Cited by 9 publications

(11 citation statements)

References 5 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…Hutton and Meijer [1998] wrote a tutorial on a monadic approach to the definition of parser combinators and discussed the advantages which result from this approach. Koopman and Plasmeijer [1999] showed how the efficiency of combinator parsers can be substantially increased by use of continuations to avoid the creation of intermediate data structures and the introduction of an exclusive orelse combinator to be used to limit backtracking where it is known that only one alternative can succeed. Leijen and Meijer [2001] developed Parsec, a library of monadic parser combinators built in Haskell.…”

Section: A History Of Parser Combinators and Their Use In Nlismentioning

confidence: 99%

Realization of natural language interfaces using lazy functional programming

Frost

2006

ACM Comput. Surv.

View full text Add to dashboard Cite

The construction of natural language interfaces to computers continues to be a major challenge. The need for such interfaces is growing now that speech recognition technology is becoming more readily available, and people cannot speak those computer-oriented formal languages that are frequently used to interact with computer applications. Much of the research related to the design and implementation of natural language interfaces has involved the use of high-level declarative programming languages. This is to be expected as the task is extremely difficult, involving syntactic and semantic analysis of potentially ambiguous input. The use of LISP and Prolog in this area is well documented. However, research involving the relatively new lazy functional programming paradigm is less well known. This paper provides a comprehensive survey of that research.

show abstract

Section: A History Of Parser Combinators and Their Use In Nlismentioning

confidence: 99%

Realization of natural language interfaces using lazy functional programming

Frost

2006

ACM Comput. Surv.

View full text Add to dashboard Cite

show abstract

“…These libraries focus on producing a single result. Koopman et al [17] use a continuation-based approach to eliminate intermediate list creation.…”

Section: Dynamic Programmingmentioning

confidence: 99%

Staged parser combinators for efficient data processing

et al. 2014

View full text Add to dashboard Cite

Parsers are ubiquitous in computing, and many applications depend on their performance for decoding data efficiently. Parser combinators are an intuitive tool for writing parsers: tight integration with the host language enables grammar specifications to be interleaved with processing of parse results. Unfortunately, parser combinators are typically slow due to the high overhead of the host language abstraction mechanisms that enable composition.We present a technique for eliminating such overhead. We use staging, a form of runtime code generation, to dissociate input parsing from parser composition, and eliminate intermediate data structures and computations associated with parser composition at staging time. A key challenge is to maintain support for input dependent grammars, which have no clear stage distinction.Our approach applies to top-down recursive-descent parsers as well as bottom-up nondeterministic parsers with key applications in dynamic programming on sequences, where we auto-generate code for parallel hardware. We achieve performance comparable to specialized, hand-written parsers.

show abstract

“…Parser combinators (Burge 1975;Wadler 1985;Fairbairn 1987;Hutton 1992;Meijer 1992;Fokker 1995;Röjemo 1995;Swierstra and Duponcheel 1996;Koopman and Plasmeijer 1999;Leijen and Meijer 2001;Ljunglöf 2002;Hughes and Swierstra 2003;Claessen 2004;Frost et al 2008;Wallace 2008, and many others) can provide an elegant and declarative method for implementing parsers. When compared with typical parser generators they have some advantages: it is easy to abstract over recurring grammatical patterns, and there is no need to use a separate tool just to parse something.…”

Section: Introductionmentioning

confidence: 99%

Total parser combinators

Danielsson

2010

SIGPLAN Not.

View full text Add to dashboard Cite

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 similar to those of many other parser combinator libraries, with two important differences: one is that the interface clearly specifies which parts of the constructed parsers may be infinite, and which parts have to be finite, using dependent types and a combination of induction and coinduction; and the other is that the parser type is unusually informative.The library comes with a formal semantics, using which it is proved that the parser combinators are as expressive as possible. The implementation is supported by a machine-checked correctness proof.

show abstract

Efficient Combinator Parsers

Cited by 9 publications

References 5 publications

Realization of natural language interfaces using lazy functional programming

Realization of natural language interfaces using lazy functional programming

Staged parser combinators for efficient data processing

Total parser combinators

Contact Info

Product

Resources

About