ralix 0.2.0

A simple, type-safe, tree walking interpreter
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

use crate::{Lexer, Literal, Token};

#[test]
fn test_lexer() {
    use Token::*;
    let src = r#"
        //  Values and Logic Operators
        "meow" 'a' = ! | & # @ ? == !=
        + - * / ++ -- < > <= >=

        //  Symbols
        , . .. ; : ( ) { } [ ] ::

        //  Keywords
        null if else fn const return
        true false while for continue
        break match struct interface
        out not and or
    "#;
    let expected_tokens = [
        String(Literal::from("meow")),
        Char(Literal::from("a")),
        Assign,
        Bang,
        Pipe,
        Ampersant,
        Hash,
        AtSign,
        QuestionMark,
        Equal,
        NotEqual,
        Plus,
        Minus,
        Asterisk,
        Slash,
        Increase,
        Decrease,
        LessThan,
        GreaterThan,
        LessEqual,
        GreatEqual,
        Comma,
        Dot,
        TwoDots,
        SemiColon,
        Colon,
        LParen,
        RParen,
        LBrace,
        RBrace,
        LBracket,
        RBracket,
        Namespace,
        Null,
        If,
        Else,
        Function,
        Const,
        Return,
        True,
        False,
        While,
        For,
        Continue,
        Break,
        Match,
        Struct,
        Interface,
        Out,
        Not,
        And,
        Or,
    ];

    let lexer = Lexer::new(src);

    for (t1, t2) in lexer.zip(expected_tokens) {
        assert_eq!(t1, t2)
    }
}