Files
cflmy e029853e32 feat(lang): implement RFC-LANG-0002 unified semantics (breaking)
One Markdown-to-program mapping, no version selector or legacy mapper.

Frontend/runtime:
- resolve @exec/@knowledge heading declarations with nearest-ancestor
  inheritance; only an Exec H2 is callable; add UnitKind::Knowledge and
  sem.* diagnostics (mode marker, unit name, exec-without-function,
  payload nesting/empty, syntax, control stack, params position,
  version directive, inferred-signature lint)
- extract Strong/Emph/inline Code as one-statement carriers, refuse
  nested carriers, and honour heading segment boundaries so an if/while
  cannot be closed across a heading
- lower if/else/while/end to the existing Branch/Loop/Return IR with a
  compile-time control stack; keep payload-relative source spans through
  expression parsing and rewrite them onto the file
- accept params(...) only as the first direct Exec H2 payload; keep the
  existing free-variable inference and named-only rule for inferred
  signatures; fix duplicate-mode/else/end and Knowledge-body inertness
- reject marqdo_semantics/syntax front matter directives

Data and tests:
- migrate stdlib/**/*.mq.md, regenerate stdlib.json digest
- migrate examples and the full semantics/negative/runtime corpus to
  the only current syntax; expected values/runtime codes preserved
- migrate Rust-embedded .mq.md fixtures, init template, CLI help and
  security-lane fixtures

Verified: cargo fmt --check, cargo clippy -D warnings and
cargo test --workspace --locked (green).
2026-11-21 12:26:46 +08:00

1.4 KiB

@exec 查值

params(三元组: List, 行: Int, 列: Int)

值 = 0

下标 = 0

while 下标 < 长度(三元组)

if 三元组[下标][0] == 行 and 三元组[下标][1] == 列

值 = 三元组[下标][2]

else

忽略 = 0

end

下标 = 下标 + 1

end

return 值

@exec 三列转稠密

params(三元组: List, 行数: Int, 列数: Int)

矩阵 = []

行号 = 0

while 行号 < 行数

行 = []

列号 = 0

while 列号 < 列数

行 = list.append(行, 查值(三元组, 行号, 列号))

列号 = 列号 + 1

end

矩阵 = list.append(矩阵, 行)

行号 = 行号 + 1

end

return 矩阵

@exec 稀疏乘法

params(左: List, 右: List, 行数: Int, 内维: Int, 列数: Int)

结果 = []

行号 = 0

while 行号 < 行数

列号 = 0

while 列号 < 列数

和 = 0

内号 = 0

while 内号 < 内维

左值 = 查值(左, 行号, 内号)

右值 = 查值(右, 内号, 列号)

和 = 和 + 左值 * 右值

内号 = 内号 + 1

end

if 和 != 0

结果 = list.append(结果, [行号, 列号, 和])

else

忽略 = 0

end

列号 = 列号 + 1

end

行号 = 行号 + 1

end

return 结果

@exec main

左 = [[0, 0, 1], [0, 2, 2], [1, 1, 3]]

右 = [[0, 0, 4], [1, 1, 5], [2, 0, 6]]

乘积 = 稀疏乘法(左, 右, 2, 3, 2)

return [乘积, 三列转稠密(乘积, 2, 2)]