tree-builder 0.0.3

Parser Generator library which uses Nom and procedural macros to generate recursive-descent parsers.
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

use tree_builder_macro::rule;
macro_rules! mk_test {
    ($x:tt) => {
        rule!{
            Test$x => #$x, #$x+, #$x*, #$x?
        }
    };
}
macro_rules! mk_sqbr_test {
    ($name:ident, $x:tt) => {
        rule!{
            Test$name => $x+, $x*, $x, $x?
        }
    };
}

mk_test!{D}
mk_test!{d}
mk_test!{S}
mk_test!{s}
mk_test!{W}
mk_test!{w}
rule!{
    TestPoint => .+, .*, .?, .
}
mk_sqbr_test!{az, [a-z]}
mk_sqbr_test!{AZ, [A-Z]}
mk_sqbr_test!{AZaz, [a-zA-Z]}
mk_sqbr_test!{nonAZaz, [^a-zA-Z]}
mk_sqbr_test!{nonabc, [^abc]}

fn main(){}