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
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
81
82
83
84
85
86
87
//! Abstract syntax tree
//!
//! ```text
//! Expr   -> expr
//!
//! BinOp  -> expr + expr
//!         | expr - expr
//!         | expr * expr
//!         | expr / expr
//!
//! Neg    -> - expr
//!
//! Pair   -> ( expr )
//!
//! Number -> number
//! ```
use crate::lexer::Token;

/// `expr`
#[derive(Debug, PartialEq)]
pub enum Expr {
    Pair(Pair),
    BinOp(BinOp),
    Neg(Neg),
    Num(Number),
}

/// `( expr )`
#[derive(Debug, PartialEq)]
pub struct Pair {
    pub expr: Box<Expr>
}

impl Pair {
    pub fn new(expr: Expr) -> Expr {
        Expr::Pair(Pair{expr: Box::new(expr)})
    }
}

/// `lhs op rhs`
///
/// op is `+` `-` `*` or `/`
#[derive(Debug, PartialEq)]
pub struct BinOp{
    pub lhs: Box<Expr>,
    pub rhs: Box<Expr>,
    pub op: Token
}

impl BinOp {
    pub fn new(lhs: Expr, rhs: Expr, token: Token) -> Expr {
        Expr::BinOp(BinOp{
            lhs: Box::new(lhs),
            rhs: Box::new(rhs),
            op: token
        })
    }
}

/// `- expr`
#[derive(Debug, PartialEq)]
pub struct Neg{
    pub expr: Box<Expr>
}

impl Neg {
    pub fn new(expr: Expr) -> Expr {
        Expr::Neg(Neg{expr: Box::new(expr)})
    }
}

/// number store as `u64`
#[derive(Debug, PartialEq)]
pub struct Number{
    pub num: u64
}

impl Number {
    pub fn new(num: u64) -> Expr {
        Expr::Num(Number{num})
    }
}

#[derive(Debug, PartialEq)]
pub struct AST{
    pub root: Expr
}