Parser combinator

Known as: Combinator parser, Combinatory parsing, Parser combinators 
In functional programming, a parser combinator is a higher-order function that accepts several parsers as input and returns a new parser as its… (More)
Wikipedia

Topic mentions per year

Topic mentions per year

1993-2016
051019932016

Papers overview

Semantic Scholar uses AI to extract papers important to this topic.
2014
2014
Parsers are ubiquitous in computing, and many applications depend on their performance for decoding data efficiently. Parser… (More)
  • figure 7
  • figure 8
  • figure 9
  • figure 10
  • figure 11
Is this relevant?
2010
2010
A monadic parser combinator library which guarantees termination of parsing, while still allowing many forms of left recursion… (More)
  • figure 1
Is this relevant?
2010
2010
Parser combinators are a well-known technique for constructing recursive-descent parsers through composition of other, less… (More)
  • figure 1
Is this relevant?
2008
2008
Parser combinators are well-known in functional programming languages such as Haskell. In this paper, we describe how they are… (More)
Is this relevant?
2008
2008
Parser combinators are higher-order functions used to build parsers as executable specifications of grammars. Some existing… (More)
  • figure 1
  • figure 2
Is this relevant?
2008
2008
The automatic extraction of definitions from natural language texts has various applications such as the creation of glossaries… (More)
  • figure 1
Is this relevant?
Review
2008
Review
2008
There are numerous ways to implement a parser for a given syntax; using parser combinators is a powerful approach to parsing… (More)
  • figure 5
  • figure 6
  • figure 7
  • figure 8
Is this relevant?
2004
2004
The tedium of writing pickling and unpickling functions by hand is relieved using a combinator library similar in spirit to the… (More)
  • figure 1
  • figure 4
  • figure 6
  • figure 7
Is this relevant?
Highly Cited
2001
Highly Cited
2001
Despite the long list of publications on parser combinators, there does not yet exist a monadic parser combinator library that is… (More)
  • figure 1
  • figure 2
Is this relevant?
2000
2000
We develop, in a stepwise fashion, a set of parser combinators for constructing deterministic, error-correcting parsers. The only… (More)
Is this relevant?