In functional programming, a parser combinator is a higher-order function which accepts several parsers as input and returns a new parser as its output.
Papers
Monadic Parser Combinators by Graham Hutton and Erik Meijer
Functional Parsers by Jeroen Fokker
Parsec: Direct Style Monadic Parser Combinators For The Real World (DRAFT) by Daan Leijen and Erik Meijer
Parsing Permutation Phrases by Arthur Baars, Andres L¨oh, Doaitse Swierstra
Parsec, a fast combinator parser by Daan Leijen
Memoizing purely functional top-down backtracking language processors by Frost and Szydlowski
Deterministic, Error-Correcting Combinator Parsers by S. Doaitse Swierstra and Luc Duponcheel
Popular Parser Combinators
Haskell - Parsec
Scala - Scala built-in library
F# - FParsec