dynparser 0.2.1

Dynamic parser. You can define rules at run time. It's possible to use peg format
Documentation 
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42

#![warn(missing_docs)]

use std;

pub(crate) trait IVec<T> {
    fn ipush(self, T) -> Self;
}

impl<T> IVec<T> for Vec<T>
where
    T: std::fmt::Debug,
{
    fn ipush(mut self, v: T) -> Self {
        self.push(v);
        self
    }
}

//-----------------------------------------------------------------------
//  TailCall
//-----------------------------------------------------------------------
pub(crate) enum TailCall<T, R> {
    Call(T),
    Return(R),
}

pub(crate) fn tail_call<T, R, F>(seed: T, recursive_function: F) -> R
where
    F: Fn(T) -> TailCall<T, R>,
{
    let mut state = TailCall::Call(seed);
    loop {
        match state {
            TailCall::Call(arg) => {
                state = recursive_function(arg);
            }
            TailCall::Return(result) => {
                return result;
            }
        }
    }
}