The parser now requires a newline or ';' between statements (block() in selfhost/parse.ludic); two statements may no longer sit adjacent with only spaces. Also fixed if-without-else swallowing its trailing separator. Migration: tools/ludic-tools/migrate_separators.c inserts ';' at statement boundaries corpus-wide (examples, runtime, 25 self-host fragments, ~1100 boundaries). Verified semantically identical — the migrated compiler compiles itself to IR byte-identical to the pre-migration seed, and every golden game renders identically. Reseeded to the strict compiler; C-free fixpoint holds; test.sh 14/14. Docs: Rule B documented in LANGUAGE.md; BOOTSTRAP.md R1 + stale fences updated; check-docs green across all docs. Fixed a multi-line string literal in emit_expr.ludic (byte-identical \n escape) that the C toolchain lexer mis-lexes. Co-Authored-By: Claude Opus 4.8 <noreply@anthropic.com>
39 lines
1.6 KiB
Text
39 lines
1.6 KiB
Text
# emit_machine.ludic — `machine <reg> { state Name = v { .. } }` dispatches on a
|
|
# register's value; `become Name` stores the target state's value back. Both are
|
|
# reg()/setreg() calls, resolved to the runtime like any other builtin.
|
|
|
|
fn emit_machine(st: Node) -> void {
|
|
let regv = emit_expr(st.a)
|
|
let s = emit_bind(sconcat("call i32 @fn_rt_reg(i32 ", sconcat(regv.code, ")")))
|
|
if nmach < len(mach_stk) { mach_stk[nmach] = st } else { push(mach_stk, st) }
|
|
nmach = nmach + 1
|
|
let endl = lbl("smend")
|
|
let i = 0
|
|
while i < len(st.kids) {
|
|
let state = st.kids[i]
|
|
let v = emit_expr(state.b)
|
|
let c = emit_bind(sconcat("icmp eq i32 ", sconcat(s, sconcat(", ", v.code))))
|
|
let body = lbl("sbody"); let nxt = lbl("sarm")
|
|
emit(" br i1 "); emit(c); emit(", label %"); emit(body); emit(", label %"); emit(nxt); emit("\n")
|
|
emit(body); emit(":\n"); g_term = false
|
|
emit_block(state.a)
|
|
if not g_term { emit(" br label %"); emit(endl); emit("\n") }
|
|
emit(nxt); emit(":\n"); g_term = false
|
|
i = i + 1
|
|
}
|
|
if not g_term { emit(" br label %"); emit(endl); emit("\n") }
|
|
emit(endl); emit(":\n"); g_term = false
|
|
nmach = nmach - 1
|
|
}
|
|
|
|
fn emit_become(st: Node) -> void {
|
|
if nmach == 0 { perr("'become' outside a machine") }
|
|
let m = mach_stk[nmach - 1]
|
|
let target: Node = ptr_null()
|
|
let i = 0
|
|
while i < len(m.kids) { if streq(m.kids[i].s, st.s) { target = m.kids[i] }; i = i + 1 }
|
|
if ptr_is_null(target) { perr(sconcat("become: no state ", st.s)) }
|
|
let regv = emit_expr(m.a)
|
|
let sv = emit_expr(target.b)
|
|
emit(" call void @fn_rt_setreg(i32 "); emit(regv.code); emit(", i32 "); emit(sv.code); emit(")\n")
|
|
}
|