Orkuncakilkaya
70ab79a4e9
`null` is now a real pointer literal and null-tests are comparisons, instead of `ptr_null()` and `ptr_is_null(x)`: ptr_null() -> null ptr_is_null(x) -> (x == null) not ptr_is_null(x) -> (x != null) Mechanics: a new E_NULL primary (`null`, like true/false) lowers to the `null` pointer; emit_bin's comparison path now picks `ptr` vs `i32` from operand type (via llty), so `==`/`!=` work on any pointer/record/slice. The two intrinsics are deleted. Two reseeds: (A) add the literal + ptr comparison keeping the intrinsics; (B) migrate all 182 call sites (compiler + runtime, via a balanced-paren script that skips string-literal args and rewrites `not ptr_is_null` to `!= null`) and delete the intrinsics. Node/Val/Buf/Tok field defaults now read `ptr = null`. Vocabulary drops the two from LUDIC_INTRINSICS; `null` joins true/false as a language constant (grammar + ludic_syntax.h). LANGUAGE.md notes the literal. Reseeded (21664 lines); C-free fixpoint holds; goldens identical; 17/17; vocab + doc-fences clean. Co-Authored-By: Claude Opus 4.8 <noreply@anthropic.com>
71 lines
2 KiB
Text
71 lines
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)
|
|
# 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
|
|
|
|
property Node {
|
|
kind: int = 0
|
|
s: ptr = null # name / operator / string / type-of-new
|
|
ival: int = 0 # int literal, bool, flags
|
|
ty: 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
|
|
}
|