Yap: Yet another (rust) parsing library
This small, zero-dependency crate helps you to parse input strings, slices and (some) iterators of tokens
by building on the Iterator interface.
The aim of this crate is to provide the sorts of functions you'd come to expect from a parser combinator library, but without immersing you into a world of parser combinators, and forcing you to use a novel return type, library-provided errors or parser-combinator based control flow. It hopes to sacrifice conciseness in exchange for simplicity.
Some specific features/goals:
- Lots of examples. Every function provided comes with example usage.
- Prioritise simplicity at the cost of verbosity.
- Be iterator-centric. Where applicable, combinators return iterators, so you can lean on the
Iteratorinterface to parse as much or as little as you want from the input, and collect up the output however you wish. - Allow user defined errors to be returned anywhere that it might make sense. Some functions have
_errvariants incase you need error information when they don't otherwise hand back errors for simplicity. - Location information should always be available, so that you can tell users where something went wrong.
see
Tokens::offset - Backtracking by default. Coming from Haskell's Parsec, this feels like the sensible default. It means that if one of the provided parsing functions fails to parse what you asked for, it won't consume any input trying.
- Expose all of the "low level" functions. You can save and rewind to locations as needed (see
Token::location), and implement ant of the provided functions using these primitives. - Aims to be "fairly quick". Avoids allocations (and allows you to do the same via the iterator-centric interface). If you need "as fast as you can get", there are probably quicker alternatives.
Have a look at the Tokens trait for all of the parsing methods made available, and examples for each.
Have a look in the examples folder for more in depth examples.
Example
use yap::{
// This trait has all of the parsing methods on it:
Tokens,
// Allows you to use `.into_tokens()` on strings and slices,
// to get an instance of the above:
IntoTokens
};
// Step 1: convert our input into something implementing `Tokens`
// ================================================================
let mut tokens = "10 + 2 x 12-4,foobar".into_tokens();
// Step 2: Parse some things from our tokens
// =========================================
#[derive(PartialEq,Debug)]
enum Op { Plus, Minus, Multiply }
#[derive(PartialEq,Debug)]
enum OpOrDigit { Op(Op), Digit(u32) }
// The `Tokens` trait builds on `Iterator`, so we get a `next` method.
fn parse_op(t: &mut impl Tokens<Item=char>) -> Option<Op> {
match t.next()? {
'-' => Some(Op::Minus),
'+' => Some(Op::Plus),
'x' => Some(Op::Multiply),
_ => None
}
}
// We also get other useful functions..
fn parse_digits(t: &mut impl Tokens<Item=char>) -> Option<u32> {
let s: String = t
.tokens_while(|c| c.is_digit(10))
.collect();
s.parse().ok()
}
// As well as combinator functions like `sep_by_all` and `surrounded_by`..
let op_or_digit = tokens.sep_by_all(
|t| t.surrounded_by(
|t| parse_digits(t).map(OpOrDigit::Digit),
|t| { t.skip_tokens_while(|c| c.is_ascii_whitespace()); }
),
|t| parse_op(t).map(OpOrDigit::Op)
);
// Now we've parsed our input into OpOrDigits, let's calculate the result..
let mut current_op = Op::Plus;
let mut current_digit = 0;
for d in op_or_digit {
match d {
OpOrDigit::Op(op) => {
current_op = op
},
OpOrDigit::Digit(n) => {
match current_op {
Op::Plus => { current_digit += n },
Op::Minus => { current_digit -= n },
Op::Multiply => { current_digit *= n },
}
},
}
}
assert_eq!(current_digit, 140);
// Step 3: do whatever you like with the rest of the input!
// ========================================================
// This is available on the concrete type that strings
// are converted into (rather than on the `Tokens` trait):
let remaining = tokens.remaining();
assert_eq!(remaining, ",foobar");