Phase 7h: string slicing s[a..b] (retire substr)
`s[a..b]` is a fresh substring of the bytes [a, b) — the modern, end-based form of the C-style `substr(s, start, count)`: substr(src, start, i - start) -> src[start..i] substr(t, 2, len(t) - 2) -> t[2..len(t)] substr(src, i, 2) -> src[i..i + 2] Mechanics: a new E_SLICE postfix (`base[lo..hi]`, distinct from `base[i]` indexing) lowers to a @fn_str_slice prelude (malloc + copy + terminate), emitted once into any program that slices. Two reseeds: add the syntax + prelude, then migrate the 22 substr calls and delete substr. The migrator recognises the common `count == end - start` shape and emits the clean `s[start..end]` rather than `s[start..start + (end - start)]`. examples/strings.ludic gains slicing (now prints 1..9). Reseeded (22673 lines); C-free fixpoint holds; goldens identical; 18/18; vocab + doc-fences clean. Co-Authored-By: Claude Opus 4.8 <noreply@anthropic.com>
This commit is contained in:
parent
0efa06dca2
commit
1b9789630a
14 changed files with 4049 additions and 3914 deletions
|
|
@ -19,14 +19,14 @@ fn base_name(path: ptr) -> ptr {
|
|||
var last = 0 - 1
|
||||
var i = 0
|
||||
while peek8(path, i) != 0 { if peek8(path, i) == 47 { last = i }; i = i + 1 }
|
||||
return substr(path, last + 1, i - (last + 1))
|
||||
return path[last + 1..i]
|
||||
}
|
||||
|
||||
# drop a trailing ".ludic" if present
|
||||
fn strip_ludic(name: ptr) -> ptr {
|
||||
let n = len(name)
|
||||
if n > 6 {
|
||||
if (substr(name, n - 6, 6) == ".ludic") { return substr(name, 0, n - 6) }
|
||||
if (name[n - 6..n] == ".ludic") { return name[0..n - 6] }
|
||||
}
|
||||
return name
|
||||
}
|
||||
|
|
|
|||
Loading…
Add table
Add a link
Reference in a new issue