The trailing-`!`-after-the-value-type spelling (`-> T !`, `-> Tuple(A,B) !`) was a
redundant second way to write a failable return that the parser folded into the
same AST as the parenthesized `(T, !)` / `(A, B, !)` result list. Remove it so
there is ONE canonical spelling: the error channel always rides as the last slot
of the parenthesized list.
- parser: `parseFnReturnType` no longer folds a trailing `!` after a value type —
it rejects it with a located diagnostic ("a failable return is written `(T, !)`
… not `T !`"). This one chokepoint covers fn declarations, lambdas, fn-pointer
types `(A) -> R`, and closure types `Closure(A) -> R`. The error-ONLY `-> !` /
`-> !ErrSet` form is unaffected (parsed by parseTypeExpr as an error_type_expr).
- migrated every usage to canonical form across library/ + examples/ + issues/ +
tests/: `-> T !E` → `-> (T, !E)`; the value-carrying `-> Tuple(A, B) !` (which
FLATTENED to a multi-value failable) → `-> (A, B, !)`, preserving behavior. A
genuine single-tuple-value failable stays `-> (Tuple(A,B), !)`.
- parser unit tests: the "bare form folds" tests become "bare form is rejected";
canonical-form parse tests retained.
- docs: specs.md §12 + scattered refs and readme.md updated to the `(T, !)` form.
Behavior-preserving (the bare form was sugar for the same AST). Adversarial review
confirmed: rejection complete across all positions, every canonical form works on
both success/error paths, error-only `-> !` intact, no crashes. Full suite green
(unit tests + 850 corpus examples).
32 lines
925 B
Plaintext
32 lines
925 B
Plaintext
// Value-slot liveness (ERR step E1.8) is analysed inside a nested lambda as its
|
|
// OWN boundary: `flowExpr` recurses into a lambda literal via `analyzeFnBody`.
|
|
// Reading a failable's value slot inside the lambda where its error is NOT
|
|
// proven absent is rejected — even though the lambda is never called and the
|
|
// outer function proves nothing for it.
|
|
//
|
|
// Negative counterpart to 1051(b): were `flowExpr`'s `.lambda` recursion
|
|
// removed, the lambda body would go un-analysed and this read would slip
|
|
// through. The program never runs (exit 1).
|
|
|
|
#import "modules/std.sx";
|
|
|
|
E :: error { Bad }
|
|
|
|
parse :: (n: i32) -> (i32, !E) {
|
|
if n < 0 { raise error.Bad; }
|
|
return n * 10;
|
|
}
|
|
|
|
build :: () {
|
|
emit := () -> i32 {
|
|
v, err := parse(5);
|
|
return v; // REJECTED: err not proven absent (inside lambda)
|
|
};
|
|
print("unreached\n");
|
|
}
|
|
|
|
main :: () -> i32 {
|
|
build();
|
|
return 0;
|
|
}
|