Replace the bare-paren tuple grammar with explicit, position-unambiguous
forms, mirroring how structs work:
type `(A, B)` -> `Tuple(A, B)` (named keeps `:`)
value `(a, b)` -> `.(a, b)` (named uses `=`)
typed (new) -> `Tuple(A, B).(a, b)` (like `Point.{...}`)
failable `-> (T, !)` -> `-> T !`
`-> (T1, T2, !)`-> `-> Tuple(T1, T2) !` (channel outside Tuple)
Bare `(...)` is now grouping only, everywhere; a comma in bare parens is a
hard error with a migration hint. Grouping, function types `(A, B) -> R`,
param lists, lambdas, and match bindings are unaffected.
`Tuple(...)` is strictly a TYPE in every position (including `size_of` /
`type_info` args); a tuple VALUE comes only from `.(...)` (anonymous) or
`Tuple(...).(...)` (explicitly typed). A bare `Tuple(1, 2)` is a tuple
type with non-type elements -> rejected.
The ~110 tuple-bearing corpus files were migrated with a one-shot
AST-aware migrator (the `sx migrate` tool from the prior commit, removed
here). New examples: 0130 (new syntax), 0131 (typed construction), 1060
(named-tuple failable return). 1116 golden updated for the new hint text.
22 lines
783 B
Plaintext
22 lines
783 B
Plaintext
// Failable `or` chain propagation (ERR step E2.4b). When every operand of a
|
|
// `try … or try …` chain fails and there is no value terminator, the final
|
|
// failure propagates to the enclosing function — here `main`, so the E4.2
|
|
// entry-point wrapper prints the unhandled-error header + return trace to
|
|
// stderr and exits 1. Each failed attempt contributes its `raise` frame plus
|
|
// the chain-attempt frame, so three all-failing attempts leave six frames
|
|
// (locations are placeholders until DWARF / E3.0). Expected exit code: 1.
|
|
|
|
#import "modules/std.sx";
|
|
|
|
E :: error { A };
|
|
|
|
fa :: (n: i32) -> i32 !E {
|
|
if n == 0 { raise error.A; }
|
|
return n;
|
|
}
|
|
|
|
main :: () -> i32 !E {
|
|
v := try fa(0) or try fa(0) or try fa(0); // all fail → propagate to main
|
|
return v;
|
|
}
|