peggen-core 0.2.0

Generate recursive-descent & precedence climbing parsers. (traits)
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

use crate::*;

macro_rules! Impl {
    ($($($A: ident)*, $($B: ident)*;)*) => {$(
        impl<Extra: Copy, $($A, )*> AstImpl<Extra> for ($($A, )*)
            where $($A: AstImpl<Extra>, )*
        {
            fn ast<'a>(
                input: &'a str, 
                stack: &'a [Tag], 
                with: Extra
            ) -> (&'a [Tag], Self) {
                $(
                    // Because tag code is suffix coding, we have to parse from tail to head
                    let (stack, casey::lower!($B)) = $B::ast(input, stack, with);
                )*
                (stack, ($(casey::lower!($A), )*))
            }
        }
    )*};
}

Impl!(
    A, A;
    A B, B A;
    A B C, C B A;
    A B C D, D C B A;
    A B C D E, E D C B A;
    A B C D E F, F E D C B A;
    A B C D E F G, G F E D C B A;
);