aufbau 0.1.0

Type-aware constrained decoding for LLMs using context-dependent grammars with typing rules
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
160
161
162
163
164
165
166
167
168
169
170
171
172
173
174
175
176
177
178
179
180
181
182
183
184
185
186
187
188
189
190
191
192
193

//! STLC Parseability Tests
//!
//! Fast tests for Simply Typed Lambda Calculus that verify
//! all prefixes are parseable without doing full completion search.
//! Focuses on left-recursive application parsing.

use super::*;

// Empirical bound for STLC parseability prefixes. This intentionally over-approximates
// to stay on the safe side for left-recursive lambda/application prefixes.
const STLC_PARSE_MAX_DEPTH: usize = 62;

/// Note: These tests focus on parsing only, not type checking.
/// For type checking tests, see the typing module tests.
///
/// The valid() method is used instead of valid() to avoid type checking
/// overhead and focus on the core parsing performance.

#[cfg(test)]
fn stlc_grammar() -> Grammar {
    load_example_grammar("stlc")
}

pub fn valid_expressions_cases() -> Vec<ParseTestCase> {
    let cases = vec![
        // === Simple partial cases ===
        ParseTestCase::valid("empty lambda", "λ"),
        ParseTestCase::valid("lambda var", "λx"),
        ParseTestCase::valid("lambda colon", "λx:"),
        ParseTestCase::valid("partial no body after dot", "λx:A."),
        // === Identity functions ===
        ParseTestCase::valid("identity A", "λx:A.x"),
        ParseTestCase::valid("identity B", "λx:B.x"),
        ParseTestCase::valid("identity C", "λx:C.x"),
        ParseTestCase::valid("identity with parens", "(λx:A.x)"),
        // === Nested lambdas (2 deep) ===
        ParseTestCase::valid("nested return outer", "λx:A.λy:B.x"),
        ParseTestCase::valid("nested return inner", "λx:A.λy:B.y"),
        // === Nested lambdas (3 deep) ===
        ParseTestCase::valid("triple return first", "λx:A.λy:B.λz:C.x"),
        ParseTestCase::valid("triple return third", "λx:A.λy:B.λz:C.z"),
        // === Simple arrow types ===
        ParseTestCase::valid("arrow A->B", "λf:A->B.f"),
        ParseTestCase::valid("arrow B->C", "λf:B->C.f"),
        // === Nested arrow types (right associative) ===
        ParseTestCase::valid("arrow A->B->C", "λf:A->B->C.f"),
        ParseTestCase::valid("arrow A->B->C->D", "λf:A->B->C->D.f"),
        // === Applications in lambda bodies ===
        // Left-recursive application chains need extra depth: each application
        // step adds ~2 recursion levels, so depth ≈ 10 + 2*num_args.
        ParseTestCase::valid("lambda with app", "λf:A->B.λx:A.f x").with_parse_max_depth(30),
        ParseTestCase::valid("lambda with double app", "λf:A->B->C.λx:A.λy:B.f x y")
            .with_parse_max_depth(30),
        // === Complex nested cases ===
        ParseTestCase::valid("nested lambda with app", "λx:A.λy:B.f x y")
            .with_context(vec![("f", "A->B->C")])
            .with_parse_max_depth(30),
        // === Parenthesized applications ===
        // non typed
        ParseTestCase::structural("paren app", "(f x)"),
        ParseTestCase::structural("paren double app", "((f x) y)"),
        ParseTestCase::structural("paren nested app", "x t y u r"),
    ];

    cases
        .into_iter()
        .map(|c| c.with_parse_max_depth(STLC_PARSE_MAX_DEPTH))
        .collect()
}

pub fn invalid_expressions_cases() -> Vec<ParseTestCase> {
    vec![
        // === Invalid variable names ===
        ParseTestCase::invalid("number only", "123"),
        ParseTestCase::invalid("symbol only", "!@#"),
        // === Invalid lambda syntax ===
        ParseTestCase::invalid("lambda no var", "λ:"),
        ParseTestCase::invalid("double colon", "λx::A"),
        ParseTestCase::invalid("missing var", "λ:A"),
        ParseTestCase::invalid("missing type", "λx:.x"),
        ParseTestCase::invalid("double dot", "λx:A..x"),
        ParseTestCase::invalid("double lambda", "λλx:A.x"),
        ParseTestCase::invalid("colon before lambda", ":λx:A.x"),
        ParseTestCase::invalid("dot before lambda", ".λx:A.x"),
        // === Invalid type syntax ===
        ParseTestCase::invalid("arrow no rhs", "λf:A->.f"),
        ParseTestCase::invalid("arrow no lhs", "λf:->B.f"),
        ParseTestCase::invalid("arrow first", "->A"),
        ParseTestCase::invalid("double arrow", "λx:A-->B.x"),
        ParseTestCase::invalid("just arrow", "->"),
        // === Invalid parentheses ===
        ParseTestCase::invalid("empty paren", "()"),
        ParseTestCase::invalid("paren no content", "( )"),
        ParseTestCase::invalid("close paren first", ")"),
        ParseTestCase::invalid("extra close paren", "(λx:A.x))"),
        ParseTestCase::invalid("close in type", "λx:).x"),
        ParseTestCase::invalid("just colon", ":"),
        ParseTestCase::invalid("just dot", "."),
        ParseTestCase::invalid("semicolon", "λx:A;x"),
        ParseTestCase::invalid("hash", "#x"),
        ParseTestCase::invalid("dollar", "$x"),
        ParseTestCase::invalid("backslash", "\\x"),
        ParseTestCase::type_error("unbound variable", "x"),
        ParseTestCase::type_error("unbound in app", "f x"),
        ParseTestCase::type_error("unbound func", "f"),
        ParseTestCase::type_error("var outside scope", "λx:A.y"),
        ParseTestCase::type_error("shadowed var used outside", "λx:A.(λy:B.x) y"),
    ]
}

pub fn left_recursive_application_cases() -> Vec<ParseTestCase> {
    let cases = vec![
        // === Test left-associative application parsing ===
        // Each application step adds ~2 recursion levels in the left-recursive grammar,
        // so we set depth = 10 + 2 * num_args as a safe budget.
        ParseTestCase::valid("simple left app", "f x")
            .with_context(vec![("f", "A->B"), ("x", "A")])
            .with_parse_max_depth(20),
        ParseTestCase::valid("chained left app", "f x y")
            .with_context(vec![("f", "A->B->C"), ("x", "A"), ("y", "B")])
            .with_parse_max_depth(25),
        ParseTestCase::valid("long chain left app", "f x y z w v u")
            .with_context(vec![
                ("f", "A->B->C->D->E->F->G"),
                ("x", "A"),
                ("y", "B"),
                ("z", "C"),
                ("w", "D"),
                ("v", "E"),
                ("u", "F"),
            ])
            .with_parse_max_depth(30),
        // === Test in lambda contexts ===
        ParseTestCase::valid("lambda with chain", "λf:A->B->C.λx:A.λy:B.f x y")
            .with_parse_max_depth(30),
    ];

    cases
        .into_iter()
        .map(|c| c.with_parse_max_depth(STLC_PARSE_MAX_DEPTH))
        .collect()
}

#[test]
fn valid_expressions_stlc() {
    let grammar = stlc_grammar();
    let cases = valid_expressions_cases();
    println!("\n=== STLC Valid Expressions ({} cases) ===", cases.len());
    let (res, _cases_json) = run_parse_batch(&grammar, &cases);
    assert_eq!(res.failed, 0, "{}", res.format_failures());
    println!(
        "✓ All {} cases passed in {:?} (avg {:?})\n",
        res.passed, res.total_duration, res.avg_duration
    );
    println!(
        "  Performance: {:?} per test, {} tests\n",
        res.avg_duration, res.passed
    );
}

#[test]
fn invalid_expressions_stlc() {
    let grammar = stlc_grammar();
    let cases = invalid_expressions_cases();
    println!("\n=== STLC Invalid Expressions ({} cases) ===", cases.len());
    let (res, _cases_json) = run_parse_batch(&grammar, &cases);
    assert_eq!(res.failed, 0, "{}", res.format_failures());
    println!(
        "✓ All {} cases passed in {:?} (avg {:?})\n",
        res.passed, res.total_duration, res.avg_duration
    );
}

#[test]
fn left_recursive_application_tests() {
    let grammar = stlc_grammar();
    let cases = left_recursive_application_cases();
    println!(
        "\n=== STLC Left-Recursive Applications ({} cases) ===",
        cases.len()
    );
    let (res, _cases_json) = run_parse_batch(&grammar, &cases);
    assert_eq!(res.failed, 0, "{}", res.format_failures());
    println!(
        "✓ All {} cases passed in {:?} (avg {:?})\n",
        res.passed, res.total_duration, res.avg_duration
    );
    println!(
        "  Performance: {:?} per test, {} tests\n",
        res.avg_duration, res.passed
    );
    println!("  This demonstrates efficient left-recursion handling via memoization.\n");
}