989e18b760
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.
28 lines
1.2 KiB
Plaintext
28 lines
1.2 KiB
Plaintext
// A closure VALUE (a pre-bound variable) cannot be passed into a bare
|
|
// function-pointer slot `(...) -> ...` (ERR E5.1). The bare ABI calls
|
|
// `fn_ptr(ctx, args)` with no env channel, so a closure's environment can't be
|
|
// carried — passing one is unsound (drops env / shifts args / segfaults on a
|
|
// capturing closure). Only a closure LITERAL crosses this boundary (lowerLambda
|
|
// emits a static adapter); a variable is rejected with a pointer to the idiom.
|
|
//
|
|
// The fix for these is either to pass the literal directly, or to type the
|
|
// parameter `Closure(...)` so the environment is carried (the idiomatic form).
|
|
|
|
#import "modules/std.sx";
|
|
|
|
E :: error { Z }
|
|
|
|
bare :: (cb: (i64) -> i64, n: i64) -> i64 { return cb(n); }
|
|
baref :: (cb: (i64) -> i64 !E, n: i64) -> i64 { return cb(n) catch (e) -1; }
|
|
|
|
main :: () -> i32 {
|
|
inc := closure((x: i64) -> i64 => x + 1); // capture-free closure var
|
|
base := 100;
|
|
add := closure((x: i64) -> i64 => x + base); // CAPTURING closure var
|
|
|
|
_ := bare(inc, 9); // reject: closure value → bare slot
|
|
_ := baref(inc, 9); // reject: also the ∅-widening crossing
|
|
_ := bare(add, 9); // reject: capturing closure → bare slot
|
|
return 0;
|
|
}
|