Orkuncakilkaya
647dfec334
- `[a, b, c]` list literals (E_LIST → emit_list); static_type learns slice-element, `new T`, list, string and literal kinds - `x op= y` lowers through the same path as `x = x op y` (emit_bin_vals): fixed `*=`/`/=` use the Q16.16 64-bit paths, string `+=` concatenates, int→long widens; unary `-` keeps a fixed operand's type (arith_ty) - one `unescape()` table for "strings", 'chars' and `interpolation`; `'\''`, `'\\'`, `'\"'` no longer read as 0; unterminated char literals and unexpected characters are errors instead of silently skipped - every diagnostic is `file:line: error: msg` (g_parse_file / g_err_file, Node.file + Node.line set by node()); tok_desc() in expectation errors; duplicate `function` names and unknown `phase` names are reported in source terms (phase_id used to default unknown phases to Overlay) - interpolation holes skip braces inside string literals - hand-IR preludes move from the user `@fn_` prefix to `@lp_` so a user `is_ws` / `str_eq` / `path_join` no longer collides at link time - `@ClearColor(expr)` accepts any constant expression; `Os.pid()` added (docs page + inventory); `str_starts()` in support/str - main.ludic: `else if` flag ladder, char literals, stale script comments - examples/lang/operators.ludic covers all of the above; os.ludic covers Os.pid; docs pages for Os.pid and the Overlay phase; ten changesets - reseeded: selfhost/ludicc.seed.ll is the new compiler's own fixpoint Co-Authored-By: Claude Fable 5.1 <noreply@anthropic.com>
50 lines
1.5 KiB
Text
50 lines
1.5 KiB
Text
program T {
|
|
# a tagged-union enum (issue #56): variants carry payloads, are constructed by
|
|
# name, and destructure in `match` with the payload names bound in each arm.
|
|
enum Tile { Empty, Wall, Door(int), Portal(int, int) }
|
|
|
|
# match binds each variant's payload; the arms are exhaustive (no `_`).
|
|
function walk_cost(t: Tile) -> int {
|
|
match t {
|
|
Empty => { return 1 }
|
|
Wall => { return 0 }
|
|
Door(n) => { return 10 + n }
|
|
Portal(x, y) => { return x + y }
|
|
}
|
|
return -1
|
|
}
|
|
|
|
# a nested match and an enum flowing through a return
|
|
function open(t: Tile) -> Tile {
|
|
match t {
|
|
Door(n) => { return Portal(n, n) }
|
|
_ => { return t }
|
|
}
|
|
return t
|
|
}
|
|
|
|
entry {
|
|
print(walk_cost(Empty)) # 1
|
|
print(walk_cost(Wall)) # 0
|
|
print(walk_cost(Door(5))) # 15
|
|
print(walk_cost(Portal(3, 4))) # 7
|
|
|
|
let d = Door(9)
|
|
print(walk_cost(d)) # 19
|
|
print(walk_cost(open(d))) # 18 (Door(9) -> Portal(9,9) -> 18)
|
|
print(walk_cost(open(Wall))) # 0 (default arm returns t unchanged)
|
|
|
|
# a match with a default arm, OR-ed nullary patterns, and a bound arm
|
|
let t = Portal(2, 40)
|
|
match t {
|
|
Empty, Wall => { print(100) }
|
|
Portal(x, y) => { print(x * y) } # 80
|
|
_ => { print(999) }
|
|
}
|
|
|
|
# payload-less variant boxed and matched
|
|
var here: Tile = Empty
|
|
here = Door(7)
|
|
print(walk_cost(here)) # 17
|
|
}
|
|
}
|