[−][src]Crate parze

Modules

Declaration	A type used to separate the declaration and definition of a parser such that it may be defined in terms of itself. This type is the primary route through which recursive parsers are defined, although `call(f)` may also be used.
Parser	A type that represents a rule that may be used to parse a list of symbols. Parsers may be combined and manipulated in various ways to create new parsers.

call	A parser that invokes another parser, as generated by the given function. This function is generally used to create recursive parsers, along with `Declaration`.
declare	Declare a parser before defining it. A definition can be given later with the `.define(parser)` method. This function is generally used to create recursive parsers, along with `call`.
maybe_map	A parser that accepts one symbol provided it passes the given test, mapping it to another symbol in the process. This function is extremely powerful, and in fact it is a supset of `sym`, `not_sym`, `one_of`, `not_one_of` and `permit`. However, this power also makes it fairly awkward to you. You might be better served by one of the aforementioned functions.
not_one_of	A parser that accepts any one symbol that is not within the given set of symbols.
not_sym	A parser that accepts any one thing that is not the given symbol.
one_of	A parser that accepts one of the given set of symbols.
permit	A parser that accepts one symbol provided it passes the given test.
recursive	A wrapper function for recursive parser declarations. This function uses `Declaration` internally.
sym	A parser that accepts one a specific symbol.