harn-parser 0.10.167

Parser, AST, and type checker for the Harn programming language
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 crate::ast::{spanned, BinaryOperator, Node, SNode, UnaryOperator};
use harn_lexer::Span;

// Precedence levels forward the same allocation. Materializing nodes here
// keeps large enum temporaries out of frames held across recursive descent.
pub(super) type Expression = Box<SNode>;

#[cfg_attr(debug_assertions, inline(never))]
pub(super) fn expression(make: impl FnOnce() -> Node, span: Span) -> Expression {
    Box::new(spanned(make(), span))
}

#[cfg_attr(debug_assertions, inline(never))]
pub(super) fn binary(
    op: BinaryOperator,
    left: Expression,
    right: Expression,
    span: Span,
) -> Expression {
    Box::new(spanned(Node::BinaryOp { op, left, right }, span))
}

#[cfg_attr(debug_assertions, inline(never))]
pub(super) fn unary(op: UnaryOperator, operand: Expression, span: Span) -> Expression {
    Box::new(spanned(Node::UnaryOp { op, operand }, span))
}

#[cfg_attr(debug_assertions, inline(never))]
pub(super) fn ternary(
    condition: Expression,
    true_expr: Expression,
    false_expr: Expression,
    span: Span,
) -> Expression {
    Box::new(spanned(
        Node::Ternary {
            condition,
            true_expr,
            false_expr,
        },
        span,
    ))
}

#[cfg_attr(debug_assertions, inline(never))]
pub(super) fn range(start: Expression, end: Expression, inclusive: bool, span: Span) -> Expression {
    Box::new(spanned(
        Node::RangeExpr {
            start,
            end,
            inclusive,
        },
        span,
    ))
}