celsium 0.1.7

A library for building interpreters
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

use std::collections::LinkedList;
mod mathops;
use crate::{bytecode::BINOP, BuiltinTypes};

#[derive(Debug, Clone)]
pub struct TypeStack {
    stack: LinkedList<BuiltinTypes>,
}
impl TypeStack {
    pub fn new() -> TypeStack {
        TypeStack {
            stack: LinkedList::new(),
        }
    }
    pub fn push(&mut self, pushable_type: BuiltinTypes) {
        self.stack.push_back(pushable_type);
    }
    pub fn pop(&mut self) -> Option<BuiltinTypes> {
        self.stack.pop_back()
    }
    pub fn peek(self) -> Option<BuiltinTypes>{
        self.stack.back().cloned()
    }
    pub fn peek_level(self, depth: usize) -> Option<BuiltinTypes> {
        self.stack.iter().nth_back(depth).cloned()
    }
    pub fn binop(&mut self, binop: BINOP) -> Option<BuiltinTypes> {
        /*
        Subtraction, multiplication, division and getting remainder
        are identical in the way types ar handled
        */
        let result_type = match binop {
            BINOP::Add => self.add(),
            BINOP::Subtract => self.subtract(),
            BINOP::Multiply => self.subtract(),
            BINOP::Divide => self.subtract(),
            BINOP::Remainder => self.subtract(),
            BINOP::LessThan => self.compare(),
            BINOP::LargerThan => self.compare(),
            BINOP::LessOrEq => self.compare(),
            BINOP::LargerOrEq => self.compare(),
            BINOP::NotEq => self.compare(),
            BINOP::Eq => self.compare(),
            BINOP::And => self.compare(),
            BINOP::Or => self.compare(),
            BINOP::Xor => self.compare(),
        };
        if result_type.is_some() {
            self.stack.push_back(result_type.clone().unwrap());
            return result_type;
        } else {
            return None;
        }
    }
}