aufbau 0.1.2

Generalized prefix parsing for a class of context-dependent languages
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
194
195
196
197
198
199
200
201
202
203
204
205
206
207
208
209
210
211
212
213
214
215
216
217
218
219
220
221
222
223
224
225
226
227
228
229
230
231
232
233
234
235
236
237
238
239
240
241
242
243
244
245
246
247
248
249
250
251
252
253
254
255
256
257
258
259
260

//! End-to-end parse correctness tests.
//!
//! These tests drive `TypedParser::parse` directly and inspect the `FusionAST`
//! that comes back. They cover the main structural guarantees: complete parses,
//! ambiguity, left recursion, type rejection, and the invariant that every node
//! in the arena carries a concrete type.

use super::*;
use crate::logic::grammar::Grammar;

// ---------------------------------------------------------------------------
// Basic terminal matching
// ---------------------------------------------------------------------------

#[test]
fn parse_single_terminal_succeeds() {
    let grammar = Grammar::load("Start ::= 'a'").unwrap();
    let mut parser = TypedParser::new(grammar, StubTyping);
    let ast = parser.parse("a", 0).unwrap();
    assert!(!ast.is_empty(), "should produce at least one root");
    assert!(ast.is_complete(), "parse of full input should be complete");
}

#[test]
fn parse_single_terminal_wrong_input_returns_err() {
    // "b" cannot be recognized at all by 'a' — not even as a partial prefix.
    // parse() returns Err, not Ok(empty), when no node is produced.
    let grammar = Grammar::load("Start ::= 'a'").unwrap();
    let mut parser = TypedParser::new(grammar, StubTyping);
    assert!(
        parser.parse("b", 0).is_err(),
        "completely unrecognized input should return Err, not Ok(empty)"
    );
}

#[test]
fn parse_empty_input_yields_no_complete_roots() {
    let grammar = Grammar::load("Start ::= 'a'").unwrap();
    let mut parser = TypedParser::new(grammar, StubTyping);
    let ast = parser.parse("", 0).unwrap();
    assert!(
        !ast.is_complete(),
        "empty input against non-epsilon grammar has no complete root"
    );
}

#[test]
fn parse_sequence_succeeds() {
    let grammar = Grammar::load("Start ::= 'x' 'y'").unwrap();
    let mut parser = TypedParser::new(grammar, StubTyping);
    let ast = parser.parse("x y", 0).unwrap();
    assert!(ast.is_complete());
}

#[test]
fn parse_sequence_partial_input_yields_no_complete_root() {
    let grammar = Grammar::load("Start ::= 'x' 'y'").unwrap();
    let mut parser = TypedParser::new(grammar, StubTyping);
    let ast = parser.parse("x", 0).unwrap();
    assert!(
        !ast.is_complete(),
        "only half the sequence consumed — no complete root"
    );
}

#[test]
fn parse_alternatives_first_branch() {
    let grammar = Grammar::load("Start ::= 'a' | 'b'").unwrap();
    let mut parser = TypedParser::new(grammar, StubTyping);
    let ast = parser.parse("a", 0).unwrap();
    assert!(ast.is_complete());
}

#[test]
fn parse_alternatives_second_branch() {
    let grammar = Grammar::load("Start ::= 'a' | 'b'").unwrap();
    let mut parser = TypedParser::new(grammar, StubTyping);
    let ast = parser.parse("b", 0).unwrap();
    assert!(ast.is_complete());
}

// ---------------------------------------------------------------------------
// Epsilon productions
// ---------------------------------------------------------------------------

#[test]
fn parse_epsilon_alternative_matches_empty_span() {
    // ExprTail ::= ε means it matches the empty continuation.
    let grammar =
        Grammar::load("ExprTail ::= '+' Term | ε\nTerm ::= 'x'\nStart ::= Term ExprTail").unwrap();
    let mut parser = TypedParser::new(grammar, StubTyping);
    // Just "x": ExprTail should match ε
    let ast = parser.parse("x", 0).unwrap();
    assert!(
        ast.is_complete(),
        "epsilon alternative should handle absent suffix"
    );
}

#[test]
fn parse_epsilon_alternative_matches_non_empty_span() {
    let grammar =
        Grammar::load("ExprTail ::= '+' Term | ε\nTerm ::= 'x'\nStart ::= Term ExprTail").unwrap();
    let mut parser = TypedParser::new(grammar, StubTyping);
    let ast = parser.parse("x + x", 0).unwrap();
    assert!(ast.is_complete(), "non-epsilon branch should also parse");
}

// ---------------------------------------------------------------------------
// Left recursion
// ---------------------------------------------------------------------------

#[test]
fn parse_direct_left_recursion_base_case() {
    // A ::= 'a' | A 'x'
    let grammar = Grammar::load("A ::= 'a' | A 'x'\nStart ::= A").unwrap();
    let mut parser = TypedParser::new(grammar, StubTyping);
    let ast = parser.parse("a", 0).unwrap();
    assert!(ast.is_complete(), "base case of left-recursive grammar");
}

#[test]
fn parse_direct_left_recursion_extended() {
    let grammar = Grammar::load("A ::= 'a' | A 'x'\nStart ::= A").unwrap();
    let mut parser = TypedParser::new(grammar, StubTyping);
    let ast = parser.parse("a x x", 0).unwrap();
    assert!(ast.is_complete(), "extended left-recursive chain");
}

#[test]
fn parse_direct_left_recursion_terminates() {
    // Ensure the agenda-based parser doesn't loop infinitely on left recursion.
    let grammar = Grammar::load("A ::= 'a' | A 'x'\nStart ::= A").unwrap();
    let mut parser = TypedParser::new(grammar, StubTyping);
    // If this returns at all the termination invariant holds.
    let _ast = parser.parse("a x x x x x", 0).unwrap();
}

// ---------------------------------------------------------------------------
// Ambiguity
// ---------------------------------------------------------------------------

#[test]
fn parse_ambiguous_grammar_produces_multiple_roots() {
    // Both A and B match 'x'; Start has two alternatives.
    let grammar = Grammar::load("A ::= 'x'\nB ::= 'x'\nStart ::= A | B").unwrap();
    let mut parser = TypedParser::new(grammar, StubTyping);
    let ast = parser.parse("x", 0).unwrap();
    // At least one root, possibly two depending on packing.
    assert!(!ast.is_empty(), "ambiguous grammar should produce roots");
    assert!(ast.is_complete());
}

#[test]
fn parse_self_ambiguous_grammar() {
    // A ::= A ':' A | 'a' — classic ambiguous grammar.
    let grammar = Grammar::load("A ::= A ':' A | 'a'\nStart ::= A").unwrap();
    let mut parser = TypedParser::new(grammar, StubTyping);
    let ast = parser.parse("a : a : a", 0).unwrap();
    assert!(
        ast.is_complete(),
        "self-ambiguous grammar should still parse"
    );
}

// ---------------------------------------------------------------------------
// Typing constraints
// ---------------------------------------------------------------------------

#[test]
fn rejecting_typing_returns_err() {
    // RejectingTyping always rejects finish_production, so finalize produces
    // no nodes — not even partial ones. parse() returns Err when no node can
    // be created for the start symbol at any span.
    let grammar = Grammar::load("Start ::= 'a'").unwrap();
    let mut parser = TypedParser::new(grammar, RejectingTyping);
    assert!(
        parser.parse("a", 0).is_err(),
        "rejected typing must return Err — no partial node can be produced"
    );
}

#[test]
fn rejecting_all_typing_returns_err() {
    let grammar = Grammar::load("Start ::= 'x'").unwrap();
    let mut parser = TypedParser::new(grammar, RejectingTyping);
    assert!(
        parser.parse("x", 0).is_err(),
        "rejected typing should produce Err"
    );
}

#[test]
fn rejecting_typing_allows_other_branch() {
    let grammar = Grammar::load("Start ::= 'a' | 'b'").unwrap();
    let mut parser = TypedParser::new(grammar, StubTyping);
    let ast = parser.parse("a", 0).unwrap();
    assert!(ast.is_complete(), "non-rejected branch should still parse");
}

// ---------------------------------------------------------------------------
// Every node has a concrete type (invariant)
// ---------------------------------------------------------------------------

#[test]
fn every_root_node_has_a_type() {
    // StubTyping sets inferred = Some(prod.0) (NT index), so all nodes are typed.
    let grammar = Grammar::load("A ::= 'x'\nStart ::= A 'y'").unwrap();
    let mut parser = TypedParser::new(grammar, StubTyping);
    let ast = parser.parse("x y", 0).unwrap();
    assert!(ast.is_complete());

    let arena = ast.arena();
    for &root_id in ast.root_ids() {
        let node = arena.node(root_id).expect("root node must exist in arena");
        // TypeId is a concrete usize; StubTyping always sets Some(nt_idx).
        // The finalize invariant ensures every arena node has a concrete type.
        let _ = node.ty; // accessing ty implicitly asserts it's present
    }
}

// ---------------------------------------------------------------------------
// Regex terminals
// ---------------------------------------------------------------------------

#[test]
fn parse_regex_terminal_matches_pattern() {
    let grammar = Grammar::load("Start ::= /[0-9]+/").unwrap();
    let mut parser = TypedParser::new(grammar, StubTyping);
    let ast = parser.parse("42", 0).unwrap();
    assert!(ast.is_complete());
}

#[test]
fn parse_regex_terminal_rejects_non_match() {
    let grammar = Grammar::load("Start ::= /[0-9]+/").unwrap();
    let mut parser = TypedParser::new(grammar, StubTyping);
    assert!(parser.parse("abc", 0).is_err());
}

// ---------------------------------------------------------------------------
// Nested nonterminals
// ---------------------------------------------------------------------------

#[test]
fn parse_nested_nonterminals() {
    let grammar =
        Grammar::load("Atom ::= 'x'\nExpr ::= Atom | '(' Expr ')'\nStart ::= Expr").unwrap();
    let mut parser = TypedParser::new(grammar, StubTyping);
    let ast = parser.parse("( ( x ) )", 0).unwrap();
    assert!(ast.is_complete());
}

#[test]
fn parse_returns_correct_text() {
    let grammar = Grammar::load("Start ::= 'hello'").unwrap();
    let mut parser = TypedParser::new(grammar, StubTyping);
    let ast = parser.parse("hello", 0).unwrap();
    assert_eq!(ast.text(), "hello");
}