lisette-semantics 0.2.14

Little language inspired by Rust that compiles to Go
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

use diagnostics::LocalSink;
use syntax::ast::{Expression, Literal};

pub(crate) fn run(typed_ast: &[Expression], sink: &LocalSink) {
    for item in typed_ast {
        visit_expression(item, sink);
    }
}

fn visit_expression(expression: &Expression, sink: &LocalSink) {
    check(expression, sink);
    for child in expression.children() {
        visit_expression(child, sink);
    }
}

fn check(expression: &Expression, sink: &LocalSink) {
    let Expression::IndexedAccess {
        expression: receiver,
        index,
        from_colon_syntax,
        span,
        ..
    } = expression
    else {
        return;
    };

    if *from_colon_syntax {
        return;
    }

    if !receiver.get_type().is_slice() {
        return;
    }

    if let Expression::Literal {
        literal: Literal::Slice(elements),
        ..
    } = receiver.unwrap_parens()
        && let Expression::Literal {
            literal: Literal::Integer { value, .. },
            ..
        } = index.unwrap_parens()
        && *value >= elements.len() as u64
    {
        sink.push(diagnostics::infer::index_out_of_bounds(
            span,
            &value.to_string(),
        ));
        return;
    }

    if let Expression::Call {
        expression: callee,
        args,
        ..
    } = index.unwrap_parens()
        && args.is_empty()
        && let Expression::DotAccess {
            expression: call_receiver,
            member,
            ..
        } = callee.unwrap_parens()
        && member == "length"
        && expressions_equivalent(receiver, call_receiver)
    {
        let receiver_text = receiver.root_identifier().unwrap_or("xs");
        sink.push(diagnostics::infer::index_out_of_bounds(
            span,
            &format!("{receiver_text}.length()"),
        ));
    }
}

fn expressions_equivalent(a: &Expression, b: &Expression) -> bool {
    let a = a.unwrap_parens();
    let b = b.unwrap_parens();
    match (a, b) {
        (Expression::Identifier { value: av, .. }, Expression::Identifier { value: bv, .. }) => {
            av == bv
        }
        (
            Expression::DotAccess {
                expression: ae,
                member: am,
                ..
            },
            Expression::DotAccess {
                expression: be,
                member: bm,
                ..
            },
        ) => am == bm && expressions_equivalent(ae, be),
        _ => false,
    }
}