Orkuncakilkaya
df6955e609
Answering your readability point directly: the compiler's own string-building —
left uglier by the 7c `+` migration, e.g. `emit_bind(("load i32, ptr " + ip))` —
now reads as interpolation:
emit_bind(("load i32, ptr " + ip)) -> emit_bind(`load i32, ptr {ip}`)
emit_bind(("icmp eq i32 " + (kv + (", " + itoa(ak)))))
-> emit_bind(`icmp eq i32 {kv}, {itoa(ak)}`)
perr(("assign to unknown " + t.s)) -> perr(`assign to unknown {t.s}`)
164 concat chains across selfhost converted by a tool that flattens the `+` tree,
keeps call/index parens (only grouping parens are rewritten), and converts only
**brace-free** literals — LLVM IR structure strings full of `{`/`}` stay as `+`
rather than becoming awkward `{{`/`}}`. No new language surface; interpolation
already desugars to the same concat.
Reseeded (22565 lines); C-free fixpoint holds byte-for-byte (the strongest proof
the reconstruction is exact); goldens identical; 18/18.
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()/set_reg() 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(`call i32 @fn_rt_reg(i32 {regv.code})`)
|
|
if nmach < len(mach_stk) { mach_stk[nmach] = st } else { push(mach_stk, st) }
|
|
nmach = nmach + 1
|
|
let endl = lbl("smend")
|
|
var i = 0
|
|
while i < len(st.kids) {
|
|
let state = st.kids[i]
|
|
let v = emit_expr(state.b)
|
|
let c = emit_bind(`icmp eq i32 {s}, {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]
|
|
var target: Node = null
|
|
var i = 0
|
|
while i < len(m.kids) { if (m.kids[i].s == st.s) { target = m.kids[i] }; i = i + 1 }
|
|
if (target == null) { perr(`become: no state {st.s}`) }
|
|
let regv = emit_expr(m.a)
|
|
let sv = emit_expr(target.b)
|
|
emit(" call void @fn_rt_set_reg(i32 "); emit(regv.code); emit(", i32 "); emit(sv.code); emit(")\n")
|
|
}
|