Crate parcours

source ·
Expand description

Parser Combinators for Unique Results.

Modules

  • Create new parsers by combining existing ones.
  • Precedence climbing for parsing expressions with binary operators.
  • Parsers for slice input.
  • Parsers for &str input.

Macros

  • Lazily construct a parser from a function.
  • Pattern matching for successful cases.

Structs

Traits

  • A combinator combines parsers to form new ones.
  • A parser takes input and mutable state, and maybe yields an output and remaining input.

Functions

  • Return outputs of all provided parsers, if all succeed.
  • Return output of the first provided parser that succeeds.
  • Construct a parser from a function.
  • Lazily construct a parser from a function.
  • Apply a parser p() as often as possible.
  • Apply a parser p() as often as possible, separated by sep().