Orkuncakilkaya
23726afa90
Split the flat 38-file selfhost/ into concern-based subdirectories:
frontend/ lex, parse, parse_game, ast
support/ str, buf, io
backend/ core IR + expression/statement lowering
backend/game/ ECS/scene/event/world lowering
backend/stdlib/ the namespaced Math.*/Text.*/Crypto.*/… intrinsics
and split the three oversized emitters at responsibility boundaries so
no file mixes concerns:
emit_game.ludic -> + emit_world.ludic (reflection world table,
tick helpers, @main synthesis)
emit_expr.ludic -> + emit_call.ludic (namespaced builtins, call
lowering, expr dispatch)
emit_text.ludic -> + emit_text_prelude.ludic (emitted string-builder runtime)
FRAGS in tools/x/selfhost.ludic is updated to the new paths with the link
order preserved, and the Python doc/vocabulary tooling is updated to walk
the new layout. Because the build is a plain in-order concatenation and
every split lands on a blank-line boundary, the regenerated seed is
byte-identical: `x reseed` leaves selfhost/ludicc.seed.ll unchanged,
`x bootstrap-cfree` still reaches its fixed point, and both `x test` (56)
and `x selfhost-test` (29, incl. golden renders) stay green.
Closes #29
Co-Authored-By: Claude Opus 4.8 <noreply@anthropic.com>
84 lines
3.2 KiB
Text
84 lines
3.2 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)
|
|
const N_SCENE: int = 45 # scene Name [start] { on enter{} on exit{} layer L { handlers } }
|
|
# s=name ival=scene id a=on-enter block b=on-exit block
|
|
const S_ATTACH: int = 46 # attach P on e [{ overrides }] — add a property to a live entity
|
|
# s=property a=entity expr b=override record (E_REC) or null
|
|
const S_DETACH: int = 47 # detach P on e — remove a property from a live entity
|
|
# s=property a=entity expr
|
|
const N_EVENT: int = 48 # event Name { field: T = default, ... } — a public event payload
|
|
# s=name kids=payload fields (N_FIELD)
|
|
const S_EMIT: int = 49 # emit E(field: v, ...) — fire event E (calls its @On listeners)
|
|
# s=event name a=E_REC of named args; also usable as an
|
|
# expression (a cancellable event returns its cancelled flag)
|
|
const S_CANCEL: int = 50 # cancel — inside a listener, veto a `cancellable` event
|
|
# 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
|
|
const E_NULL: int = 43 # the `null` pointer literal
|
|
const E_SLICE: int = 44 # s[a..b] — substring (a=base, b=start, c=end)
|
|
|
|
property Node {
|
|
kind: int = 0
|
|
s: pointer = null # name / operator / string / type-of-new
|
|
ival: int = 0 # int literal, bool, flags
|
|
ty: pointer = 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
|
|
}
|
|
|
|
function node(kind: int) -> Node {
|
|
let n = new Node
|
|
n.kind = kind
|
|
n.kids = new []Node
|
|
return n
|
|
}
|