symboscript-optimizer 0.7.21

SymboScript optimizer
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
75
76
77
78
79
80
81
82
83
84
85
86
87
88
89
90
91
92
93
94
95
96
97
98
99
100
101
102
103
104
105
106
107
108
109
110
111
112
113
114
115
116
117
118
119
120
121
122
123
124
125
126
127
128
129
130
131
132
133
134
135
136
137
138
139
140
141
142
143
144
145
146
147
148
149
150
151
152
153
154
155
156
157
158
159

use symboscript_types::parser::*;

pub fn optim_expression(expression_stmt: &Expression) -> Expression {
    match expression_stmt {
        Expression::BinaryExpression(binary_expression) => {
            optim_binary_expression(&sort_plus_binary_expression(binary_expression))
        }
        _ => expression_stmt.clone(),
    }
}

pub fn optim_expression_sub(expression_stmt: &Expression) -> Expression {
    match expression_stmt {
        Expression::BinaryExpression(binary_expression) => {
            optim_binary_expression(&sort_plus_binary_expression(binary_expression))
        }
        _ => expression_stmt.clone(),
    }
}

pub fn optim_binary_expression(binary_expression: &BinaryExpression) -> Expression {
    let left = optim_expression_sub(&binary_expression.left);
    let right = optim_expression_sub(&binary_expression.right);

    match (left.clone(), right.clone()) {
        (Expression::Literal(left), Expression::Literal(right)) => {
            match binary_expression.operator {
                BinaryOperator::Add => {
                    return Expression::Literal(Literal {
                        node: binary_expression.node.clone(),
                        value: left.value + right.value,
                    })
                }
                BinaryOperator::Substract => {
                    return Expression::Literal(Literal {
                        node: binary_expression.node.clone(),
                        value: left.value - right.value,
                    })
                }
                BinaryOperator::Multiply => {
                    return Expression::Literal(Literal {
                        node: binary_expression.node.clone(),
                        value: left.value * right.value,
                    })
                }
                BinaryOperator::Divide => {
                    return Expression::Literal(Literal {
                        node: binary_expression.node.clone(),
                        value: left.value / right.value,
                    })
                }
                _ => {}
            }
        }
        _ => {}
    }

    Expression::BinaryExpression(Box::new(BinaryExpression {
        left,
        right,
        operator: binary_expression.operator.clone(),
        node: binary_expression.node.clone(),
    }))
}

fn sort_plus_binary_expression(binary_expression: &BinaryExpression) -> BinaryExpression {
    let mut flat = flatten_plus_binary_expression(binary_expression);

    flat.sort_by(|a, b| {
        let left = match a.clone() {
            Expression::Literal(_) => -1,
            _ => 1,
        };

        let right = match b.clone() {
            Expression::Literal(_) => 1,
            Expression::BinaryExpression(_) => 2,
            _ => 0,
        };

        left.cmp(&right)
    });

    unflat_plus_binary_expression(&flat)
}

fn unflat_plus_binary_expression(flat: &Vec<Expression>) -> BinaryExpression {
    let mut flat = flat.clone();

    flat.reverse();

    let mut node = BinaryExpression {
        right: flat.pop().unwrap(),
        left: flat.pop().unwrap(),
        operator: BinaryOperator::Add,
        node: Node::new(0, 0),
    };

    flat.reverse();

    for expression in flat {
        node = BinaryExpression {
            right: expression.clone(),
            left: Expression::BinaryExpression(Box::new(node)),
            operator: BinaryOperator::Add,
            node: Node::new(0, 0),
        }
    }

    node
}

fn flatten_plus_binary_expression(binary_expression: &BinaryExpression) -> Vec<Expression> {
    let op = binary_expression.operator;

    let left = binary_expression.left.clone();
    let right = binary_expression.right.clone();

    // println!("A: {} {} {}", left, op, right);

    if op == BinaryOperator::Add {
        match (left.clone(), right.clone()) {
            (Expression::BinaryExpression(left), Expression::BinaryExpression(right)) => {
                let mut vec = vec![];

                vec.append(&mut flatten_plus_binary_expression(&left));
                vec.append(&mut flatten_plus_binary_expression(&right));

                return vec;
            }

            (_, Expression::BinaryExpression(right)) => {
                let mut vec = vec![];

                vec.push(left);
                vec.append(&mut flatten_plus_binary_expression(&right));

                return vec;
            }

            (Expression::BinaryExpression(left), _) => {
                let mut vec = vec![];

                vec.append(&mut flatten_plus_binary_expression(&left));
                vec.push(right.clone());

                return vec;
            }

            _ => {
                return vec![left, right];
            }
        }
    }

    vec![Expression::BinaryExpression(Box::new(
        binary_expression.clone(),
    ))]
}