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
33

use tree_builder_macro::rule;

#[derive(Debug)]
pub struct Eval(Box<Add>);
tree_builder::ast_parser_maker!(Eval => @Add);

rule! {Add => @Mult, @AddAux?}

rule! {
    AddAux => "+", @Mult, @AddAux? <Addition>
            |  "-", @Mult, @AddAux? <Subtraction>
}

rule! {Mult => @Atom, @MultAux?;}

rule! {
    MultAux => "*", @Atom, @MultAux? <Multiplication>
            | "/", @Atom, @MultAux? <Division>
}

rule! {
Atom => @Number
     | "(", @Add, ")" <Grouping>
   }

rule! {Number => @Float | @Integer}

rule !(Float #=> #d+, ".", #d+ , EPart?);

rule !(Integer #=> #d+, EPart?);

rule !(EPart #=> ("E" | "e"), ("-" | "+")?, #d+);
fn main(){}