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.
31 lines
1.4 KiB
Plaintext
31 lines
1.4 KiB
Plaintext
// Reserved/builtin type names are rejected as binding NAMES across every
|
|
// control-flow and destructuring form, not just plain `var`/param decls: a
|
|
// destructure name (`i2`), an `if`/`while` optional binding (`u8`/`i16`), a
|
|
// `for` capture and index name (`bool`/`i32`), and a match-arm capture
|
|
// (`string`). Each spelling parses as a `.type_expr`, so the address-of family
|
|
// in lowering mis-lowers it (a loaded aggregate passed by value to a `ptr`
|
|
// param → LLVM verifier abort). The declaration-site diagnostic comes from one
|
|
// EXHAUSTIVE binding-name walk, so no syntactic binding form can slip through.
|
|
//
|
|
// Regression (issue 0076, attempt-4 coverage). Expected: one error per
|
|
// offending name; exit 1 — NOT an LLVM verifier abort.
|
|
#import "modules/std.sx";
|
|
|
|
pair :: () -> Tuple(i64, i64) { .(1, 2) }
|
|
maybe :: () -> ?i64 { return null; }
|
|
|
|
main :: () -> i32 {
|
|
i2, rest := pair(); // destructure name
|
|
if u8 := maybe() { } // if optional binding
|
|
while i16 := maybe() { break; } // while optional binding
|
|
xs := [3]i64.{ 10, 20, 30 };
|
|
for xs (bool) { } // for capture name
|
|
for xs, 0.. (v, i32) { } // for index name
|
|
opt: ?i64 = 5;
|
|
r := if opt == { // match-arm capture
|
|
case .some: (string) { 0 }
|
|
case .none: { 0 }
|
|
};
|
|
return 0;
|
|
}
|