prune-lang 0.2.3

Prune is a constraint logic programming language with branching heuristic.
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
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

use super::lit::LitType;

#[derive(Clone, Copy, Debug, Hash, Eq, PartialEq, PartialOrd, Ord)]
pub enum Compare {
    Lt,
    Le,
    Eq,
    Ge,
    Gt,
    Ne,
}

#[derive(Clone, Copy, Debug, Hash, Eq, PartialEq, PartialOrd, Ord)]
pub enum Prim {
    /// integer arithmetics
    IAdd,
    ISub,
    IMul,
    IDiv,
    IRem,
    INeg,

    /// float-point arithmetics
    // FAdd,
    // FSub,
    // FMul,
    // FDiv,
    // FNeg,

    /// comparision
    ICmp(Compare),

    /// boolean operation
    BAnd,
    BOr,
    BNot,
}

impl Prim {
    pub fn get_typ(&self) -> Vec<LitType> {
        match self {
            Prim::IAdd | Prim::ISub | Prim::IMul | Prim::IDiv | Prim::IRem => {
                vec![LitType::TyInt, LitType::TyInt, LitType::TyInt]
            }
            Prim::INeg => {
                vec![LitType::TyInt, LitType::TyInt]
            }
            Prim::ICmp(_) => {
                vec![LitType::TyInt, LitType::TyInt, LitType::TyBool]
            }
            Prim::BAnd | Prim::BOr => {
                vec![LitType::TyBool, LitType::TyBool, LitType::TyBool]
            }
            Prim::BNot => {
                vec![LitType::TyBool, LitType::TyBool]
            }
        }
    }

    pub fn get_prior(&self) -> u8 {
        match self {
            Prim::IAdd => 3,
            Prim::ISub => 3,
            Prim::IMul => 4,
            Prim::IDiv => 4,
            Prim::IRem => 4,
            Prim::INeg => 0,
            Prim::BAnd => 1,
            Prim::BOr => 1,
            Prim::BNot => 0,
            Prim::ICmp(_) => 2,
        }
    }
}