Expand description
Contains predefined parsers and combinators.
Structs
- Parser combinator.
Functions
- Match any symbol.
- Call a parser factory, can be used to create recursive parsers.
- Always succeeds, consume no input.
- Success when end of input is reached.
- Success when predicate returns true on current input symbol.
- Parse separated list.
- Success when current input symbol is none of the set.
- Success when predicate returns false on current input symbol.
- Success when current input symbol is one of the set.
- Success when sequence of symbols matches current input.
- Skip n symbols.
- Success when current input symbol equals
t
. - Success when tag matches current input.
- Read n symbols.