Parser Combinator

Definitions

1. A higher-order function that takes simple parsers (matching a character, a string, a regex) and combines them into more complex parsers using operations like sequence, choice, and repetition — allowing grammars to be expressed directly in code rather than in a separate grammar file. Libraries like Parsec (Haskell), nom (Rust), and fparsec (F#) popularized the technique.

   In plain English: Small, simple text-matching functions that snap together like building blocks to create a full parser for complex formats.

   Example: "We built the config file parser with nom's parser combinators instead of writing a grammar for ANTLR — it's all just composable Rust functions."

Related Terms

• Lambda Calculus
• Formal Grammar
• Lookahead
• Parse Tree
• Parser Generator
• Persistent Data Structure
• Term Rewriting
• Thunk
• Transducer
• Type Constructor
• Custom Parser