Orkuncakilkaya
dc475b17c2
`struct` and `property` had identical syntax and differed only in semantics, so
they are now one keyword: `property`. How a property is stored follows from how
it is used —
- listed in a `model` or attached by `spawn` -> an ECS component, kept in the
engine's per-entity @S_/@H_ arrays and bound in queries (as before);
- constructed with `new` -> a heap record with reference
semantics (what `struct` used to be).
A program that declares only `property` records and functions — no `model`, no
`handler` — is not an ECS program: it gets record layouts and `new`, but no
entity storage, allocator, snapshot, or runtime splice. This is exactly the
shape of the Ludic compiler itself, whose Node/Tok/Buf/Val are now `property`.
Mechanics:
- record layout (%Cmp_) now always emitted in the header (emit_head), so `new`
works with or without the ECS; the per-entity arrays stay in
emit_ecs_storage. %Str_ is gone — one layout prefix.
- has_ecs() is now `has_systems() or has_models()`, not "any component"; a
property alone no longer drags in the ECS runtime. Added has_models().
- emit_new / member access / layout_ty / layout_node collapse onto find_comp.
Dropped struct keyword, parse_struct, find_struct, is_struct_ty, N_STRUCT
emission (the const stays at kind 0, the default node kind).
Migration done as two reseeds (the old compiler treats any component as ECS, so
it cannot see `property` records in the compiler source until has_ecs is fixed):
A) teach the compiler property-as-record + fix has_ecs, keeping `struct`;
B) migrate the compiler's own records to `property` and remove `struct`.
selfhost/tests/structs.ludic migrated (still prints 7 9 109 2 42). Vocabulary
drops `struct` from DECL (ludic_syntax.h, grammar, LudicTokens.kt). LANGUAGE.md
"Records" section rewritten. Reseeded (21613 lines); C-free fixpoint holds;
goldens identical; 17/17; vocab + doc-fences clean.
Co-Authored-By: Claude Opus 4.8 <noreply@anthropic.com>
70 lines
1.9 KiB
Text
70 lines
1.9 KiB
Text
# ast.ludic — the node kinds and the single Node shape they share, plus the
|
|
# declaration tables the emitter reads. Mirrors compiler/front/ast.h + sem/.
|
|
|
|
# declarations
|
|
const N_STRUCT: int = 0
|
|
const N_FIELD: int = 1
|
|
const N_VAR: int = 2
|
|
const N_CONST: int = 3
|
|
const N_FN: int = 4
|
|
const N_PARAM: int = 5
|
|
const N_MAIN: int = 6
|
|
const N_BLOCK: int = 7
|
|
const N_COMP: int = 8
|
|
const N_SYS: int = 9
|
|
const N_ARCH: int = 10
|
|
const N_EXTERN: int = 11
|
|
const N_UI: int = 12
|
|
const N_ENUM: int = 27 # enum Name { A, B, ... } — named int constants
|
|
const S_TOGGLE: int = 28 # enable/disable (ival: 1=enable 0=disable; s=target; a=entity or null)
|
|
# statements
|
|
const S_LET: int = 10
|
|
const S_ASSIGN: int = 11
|
|
const S_IF: int = 12
|
|
const S_WHILE: int = 13
|
|
const S_FOR: int = 14
|
|
const S_RETURN: int = 15
|
|
const S_EXPR: int = 16
|
|
const S_BREAK: int = 17
|
|
const S_CONTINUE: int = 18
|
|
const S_MATCH: int = 19
|
|
const S_MARM: int = 20
|
|
const S_QUERY: int = 21
|
|
const S_SPAWN: int = 22
|
|
const S_DESPAWN: int = 23
|
|
const S_MACHINE: int = 24
|
|
const S_STATE: int = 25
|
|
const S_BECOME: int = 26
|
|
# expressions
|
|
const E_INT: int = 30
|
|
const E_STR: int = 31
|
|
const E_BOOL: int = 32
|
|
const E_ID: int = 33
|
|
const E_CALL: int = 34
|
|
const E_MEMBER: int = 35
|
|
const E_INDEX: int = 36
|
|
const E_BIN: int = 37
|
|
const E_UN: int = 38
|
|
const E_NEW: int = 39
|
|
const E_FLOAT: int = 40
|
|
const E_REC: int = 41
|
|
const E_FINIT: int = 42
|
|
|
|
property Node {
|
|
kind: int = 0
|
|
s: ptr = ptr_null() # name / operator / string / type-of-new
|
|
ival: int = 0 # int literal, bool, flags
|
|
ty: ptr = ptr_null() # declared type (let/param/field/fn/var/const)
|
|
a: Node # fixed children (meaning per kind)
|
|
b: Node
|
|
c: Node
|
|
kids: []Node # variadic children
|
|
line: int = 0
|
|
}
|
|
|
|
fn node(kind: int) -> Node {
|
|
let n = new Node
|
|
n.kind = kind
|
|
n.kids = new []Node
|
|
return n
|
|
}
|