sjabloon 0.8.0 → 0.9.0

package/lib/core.js

@@ -8,7 +8,7 @@
  * backs every entry, so the WeakSet below authenticates diagnostics across all
  * of them.
  */
-import { compile, isDiagnostic as isXprsnDiagnostic } from 'xprsn';
+import { compile, isDiagnostic as isXprsnDiagnostic, relocate as relocateXprsn } from "xprsn";
 
 /**
  * @import { SjabloonDiagnostic, SjabloonErrorCode, SjabloonFunctions, SjabloonRenderer, SjabloonValues } from './types.js'
@@ -44,42 +44,67 @@ const owns = DIAGNOSTICS.has.bind(DIAGNOSTICS);
  * @param {unknown} error Any thrown value.
  * @returns {error is SjabloonDiagnostic} Whether `error` is an authentic sjabloon diagnostic.
  */
-export const isDiagnostic = error => owns(error);
+export const isDiagnostic = owns;
 
-// Linear scan into text/tag/raw tokens. Dashes hug braces (`{{- x -}}` trims;
-// `{{ -x }}` stays unary minus). Prefer {{{ }}} over {{ }}. `triple` latches
-// off once }}} is gone so {{{...}}×N does not rescan to EOF (stays O(n)).
 /**
- * @param {string} s
- * @returns {Tok[]}
+ * Intrinsics captured at module load, exactly as `mark` is: a copy is built
+ * from a captured prototype table rather than through the original's
+ * `constructor`, so replacing a prototype's `constructor` cannot make
+ * `relocate` mint an authenticated value that is not an Error. Only
+ * `SyntaxError` is listed because `fault` mints nothing else; every other
+ * class a sjabloon diagnostic can carry arrives via xprsn and is relocated by
+ * xprsn above.
  */
-let lex = s => {
-	const out = /** @type {Tok[]} */ ([]);
-	for (let i = 0, triple = 1; i < s.length; ) {
-		const a = s.indexOf('{{', i);
-		if (a < 0) { out.push([0, s.slice(i)]); break; }
-		if (a > i) out.push([0, s.slice(i, a)]);
-		let raw = +(s[a + 2] === '{'), p = a + 2 + raw, l = s[p] === '-', b = -1;
-		if (l) p++;
-		if (raw && triple) { b = s.indexOf('}}}', p); if (b < 0) triple = 0; }
-		if (b < 0) {
-			if (raw) { raw = 0; p = a + 2; l = s[p] === '-'; if (l) p++; }
-			b = s.indexOf('}}', p);
-		}
-		if (b < 0) { out.push([0, s.slice(a)]); break; }
-		const r = b > p && s[b - 1] === '-';
-		const q = r ? b - 1 : b, whole = s.slice(p, q), body = whole.trim();
-		const start = p + whole.length - whole.trimStart().length, end = b + 2 + raw;
-		const t = [raw ? 1 : 2, body, a, end, start];
-		const prev = out.at(-1);
-		if (l && prev?.[0] === 0 && prev[1]) prev[1] = prev[1].trimEnd();
-		out.push(t);
-		i = end;
-		if (r) while (/\s/.test(s[i])) i++;
-	}
-	return out;
+const DESCS = Object.getOwnPropertyDescriptors,
+  DEFINE = Object.defineProperties,
+  PROTO = Object.getPrototypeOf,
+  SYNTAX = SyntaxError.prototype;
+/** @type {(p: any) => (msg: string) => Error} */
+const kindOf = (p) => (p === SYNTAX ? SyntaxError : Error);
+/**
+ * Copy a diagnostic into an embedder's coordinates.
+ *
+ * Relocation lives here, beside the authentication it has to satisfy: the copy
+ * is registered in the same WeakSet as the original, so it passes
+ * `isDiagnostic`. The original is never mutated, and every own field comes
+ * across by descriptor — the frozen `blocks` context stays frozen and
+ * non-writable — so a field added here is never a field an embedder forgets.
+ *
+ * @param {unknown} diag A diagnostic produced or translated by sjabloon.
+ * @param {{ prefix?: string, offset?: number }} [opts] `prefix` is prepended to
+ *   the message verbatim; `offset` shifts `start` and `end`.
+ * @returns {SjabloonDiagnostic} The relocated copy.
+ * @throws {TypeError} When `diag` is not a sjabloon diagnostic.
+ */
+export const relocate = (diag, { prefix = "", offset = 0 } = {}) => {
+  if (!isDiagnostic(diag)) throw TypeError("Not a sjabloon diagnostic");
+  // Most diagnostics here are xprsn errors translated into template
+  // coordinates, and those are registered in both stores. Letting xprsn make
+  // that half of the copy is what keeps the copy registered in both — the same
+  // reason relocation lives with authentication in the first place. Bare
+  // `mark`, not `attach`: the descriptors already carried `blocks` across,
+  // and attach would redefine a non-configurable property.
+  if (isXprsnDiagnostic(diag)) {
+    const moved = relocateXprsn(diag, { prefix, offset });
+    return (mark(moved), /** @type {SjabloonDiagnostic} */ (moved));
+  }
+  let d = /** @type {any} */ (diag),
+    props = DESCS(d),
+    copy = kindOf(PROTO(d))(prefix + d.message);
+  delete props.message;
+  delete props.stack;
+  if (props.start) {
+    props.start.value += offset;
+    props.end.value += offset;
+  }
+  DEFINE(copy, props);
+  return (mark(copy), /** @type {SjabloonDiagnostic} */ (copy));
 };
 
+// Linear scan into text/tag/raw tokens. Dashes hug braces (`{{- x -}}` trims;
+// `{{ -x }}` stays unary minus). Prefer {{{ }}} over {{ }}. `triple` latches
+// off once }}} is gone so {{{...}}×N does not rescan to EOF (stays O(n)).
+
 // One shared prototype for renders that omit `values` — the shape an embedder
 // passing `{ root, item }` hits on every cell. A fresh `{}` here would give each
 // wrapper its own hidden class, so lookups go megamorphic and such a render
@@ -88,11 +113,10 @@ let lex = s => {
 const EMPTY = Object.freeze({});
 
 // Shared parser state; parsing is synchronous so this is safe.
-// `nms` collects free variables, `fnms` the registry functions called.
 // LIT/VAL/RAW are the compiling profile's node builders — read only while
 // parsing, never at render time, so the hot path stays free of indirection.
 /** @type {Tok[]} */
-let toks;
+let tokens;
 /** @type {number} */
 let i;
 /** @type {SjabloonFunctions | undefined} */
@@ -102,13 +126,16 @@ let last;
 /** @type {string[]} */
 let bound;
 /** @type {Set<string>} */
-let nms;
+let names;
 /** @type {Set<string>} */
-let fnms;
+let functions;
 /** @type {string} */
-let src;
-/** @type {any[]} */
+let source;
+/** @type {{ type: string, start: number, end: number }[]} */
 let blocks;
+/** Nesting budget shared by `#if`/`#each`/`#elif` (see DEPTH). */
+/** @type {number} */
+let nest;
 // The profile's node builders. `any` rather than `Node<A>`: `make()` is generic
 // per edition, but these are module-level and shared across all three, so no
 // single A applies here.
@@ -118,6 +145,61 @@ let LIT;
 let VAL;
 /** @type {any} */
 let RAW;
+let lexTriple = 1,
+  lxRaw = 0,
+  lxP = 0,
+  lxL = 0,
+  lxB = 0;
+
+/** @param {number} a */
+let findEnd = (a) => {
+  lxB = lxRaw & lexTriple ? source.indexOf("}}}", lxP) : -1;
+  // oxlint-disable-next-line no-unused-expressions
+  lxB < 0 &&
+    (lxRaw &&
+      ((lexTriple = 0), (lxRaw = 0), (lxP = a + 2), (lxL = +(source[lxP] === "-")), (lxP += lxL)),
+    (lxB = source.indexOf("}}", lxP)));
+};
+
+let trimPrev = (prev = tokens.at(-1)) => {
+  // oxlint-disable-next-line no-unused-expressions
+  prev && prev[0] === 0 && prev[1] && (prev[1] = prev[1].trimEnd());
+};
+
+/** @param {number} a */
+let takeScanned = (a) => {
+  const r = +(lxB > lxP) & +(source[lxB - 1] === "-"),
+    whole = source.slice(lxP, lxB - r),
+    body = whole.trim(),
+    start = lxP + whole.length - whole.trimStart().length,
+    end = lxB + 2 + lxRaw;
+  // oxlint-disable-next-line no-unused-expressions
+  lxL && trimPrev();
+  tokens.push([2 - lxRaw, body, a, end, start]);
+  i = end;
+  if (r) while (/\s/.test(source[i])) i++;
+};
+
+/** @param {number} [a] */
+let lexStep = (a = source.indexOf("{{", i)) => {
+  if (a < 0) return (tokens.push([0, source.slice(i)]), 0);
+  if (a > i) tokens.push([0, source.slice(i, a)]);
+  lxRaw = +(source[a + 2] === "{");
+  lxP = a + 2 + lxRaw;
+  lxL = +(source[lxP] === "-");
+  lxP += lxL;
+  findEnd(a);
+  if (lxB < 0) return (tokens.push([0, source.slice(a)]), 0);
+  takeScanned(a);
+  return 1;
+};
+
+let lex = () => {
+  tokens = [];
+  i = 0;
+  lexTriple = 1;
+  while (i < source.length && lexStep());
+};
 
 let snap = () => Object.freeze(blocks.slice());
 // Block nesting is capped so a pathological template fails as a deterministic
@@ -128,8 +210,10 @@ const DEPTH = 256;
  * @param {Tok} t
  */
 let opener = (type, t) => {
-	blocks.length < DEPTH || fault('Template too deeply nested', 'SJABLOON_TOO_DEEP', t);
-	return Object.freeze({ type, start: t[2], end: t[3] });
+  // oxlint-disable-next-line no-unused-expressions
+  nest < DEPTH || fault("Template too deeply nested", "SJABLOON_TOO_DEEP", t);
+  nest++;
+  return Object.freeze({ type, start: t[2], end: t[3] });
 };
 /**
  * @template {object} E
@@ -138,9 +222,9 @@ let opener = (type, t) => {
  * @returns {E}
  */
 let attach = (e, context) => {
-	Object.defineProperty(e, 'blocks', { value: context, enumerable: true });
-	mark(e);
-	return e;
+  Object.defineProperty(e, "blocks", { value: context, enumerable: true });
+  mark(e);
+  return e;
 };
 /**
  * Throw a located compile-time diagnostic. `code` is typed to the published
@@ -153,12 +237,20 @@ let attach = (e, context) => {
  * @param {any[]} [t] The token to point at; omitted for end-of-source faults.
  * @returns {never}
  */
-const fault = (msg, code, t, start = t?.[2] ?? src.length, end = t?.[3] ?? src.length) => {
-	const e = /** @type {SyntaxError & { code: SjabloonErrorCode, start: number, end: number }} */ (SyntaxError(msg));
-	e.code = code;
-	e.start = start;
-	e.end = end;
-	throw attach(e, snap());
+const fault = (
+  msg,
+  code,
+  t,
+  start = t == null ? source.length : t[2],
+  end = t == null ? source.length : t[3],
+) => {
+  const e = /** @type {SyntaxError & { code: SjabloonErrorCode, start: number, end: number }} */ (
+    SyntaxError(msg)
+  );
+  e.code = code;
+  e.start = start;
+  e.end = end;
+  throw attach(e, snap());
 };
 /**
  * Re-locate a diagnostic thrown by a nested compile or render into this
@@ -171,170 +263,271 @@ const fault = (msg, code, t, start = t?.[2] ?? src.length, end = t?.[3] ?? src.l
  * @type {(e: any, start: number, context: any, owns?: (e: unknown) => boolean) => never}
  */
 const translated = (e, start, context, owns = isXprsnDiagnostic) => {
-	if (!owns(e)) throw e;
-	e.start += start;
-	e.end += start;
-	throw attach(e, context);
+  if (!owns(e)) throw e;
+  throw attach(relocateXprsn(e, { offset: start }), context);
 };
 /**
  * @param {Tok} t
  * @returns {never}
  */
-let unexpected = t => fault('Unexpected {{' + t[1] + '}}', 'SJABLOON_UNEXPECTED_TAG', t);
+let unexpected = (t) => fault("Unexpected {{" + t[1] + "}}", "SJABLOON_UNEXPECTED_TAG", t);
 
-// Append every node's output into the accumulator `o`, which the root wrapper
+// Append every node's output into the accumulator `acc`, which the root wrapper
 // creates once per render and threads all the way down. Nodes return nothing:
 // no intermediate array per node list, no join, and render order is just push
 // order.
 /**
  * @param {Node<any>[]} nodes
- * @param {any} v
- * @param {any} o
- */
-let run = (nodes, v, o) => { for (const n of nodes) n(v, o); };
-
-// A leaf interpolation node: compile the expression, then let the profile turn
-// the evaluated value into output. `k` is VAL for `{{ }}`, RAW for `{{{ }}}`.
-/**
- * @param {Tok} t
- * @param {any} k
- * @returns {Node<any>}
+ * @param {any} scope
+ * @param {any} acc
  */
-let interp = (t, k) => k(cp(t[1], t[4], snap()));
+let run = (nodes, scope, acc) => {
+  for (const n of nodes) n(scope, acc);
+};
 
 // Compile one expression and collect its free variables (minus the loop
 // variables currently in scope, which belong to the template) and the registry
 // functions it calls.
 /**
- * @param {string} s
+ * @param {string} expr
  * @param {number} start
  * @param {any} context
  * @returns {(v: any) => any}
  */
-let cp = (s, start, context) => {
-	/** @type {ReturnType<typeof compile>} */
-	let e;
-	try {
-		// `SjabloonFunctions` is `Record<string, Function>`; xprsn's registry wants
-		// `Record<string, (...args: any[]) => any>`, and TypeScript deliberately
-		// refuses `Function` against a call signature. The registry is passed
-		// straight through untouched, so this is a published-type mismatch rather
-		// than a real one — narrowing `SjabloonFunctions` would change the API.
-		e = compile(s, /** @type {any} */ (fns));
-	} catch (x) {
-		translated(x, start, context);
-	}
-	for (const n of e.names) bound.includes(n) || nms.add(n);
-	for (const fn of e.functions) fnms.add(fn);
-	return v => {
-		try {
-			return e(v);
-		} catch (x) {
-			translated(x, start, context, e.isDiagnostic);
-		}
-	};
+let compileExpr = (expr, start, context) => {
+  /** @type {ReturnType<typeof compile>} */
+  let e;
+  try {
+    // `SjabloonFunctions` is `Record<string, Function>`; xprsn's registry wants
+    // `Record<string, (...args: any[]) => any>`, and TypeScript deliberately
+    // refuses `Function` against a call signature. The registry is passed
+    // straight through untouched, so this is a published-type mismatch rather
+    // than a real one — narrowing `SjabloonFunctions` would change the API.
+    e = compile(expr, /** @type {any} */ (fns));
+  } catch (x) {
+    translated(x, start, context);
+  }
+  e.names.forEach((n) => {
+    // oxlint-disable-next-line no-unused-expressions
+    bound.includes(n) || names.add(n);
+  });
+  for (const fn of e.functions) functions.add(fn);
+  return (v) => {
+    try {
+      return e(v);
+    } catch (x) {
+      // Read off the compiled expression to pass along, never called through
+      // `e` — xprsn's `isDiagnostic` is a closure over a WeakSet, not a method.
+      // oxlint-disable-next-line typescript/unbound-method
+      translated(x, start, context, e.isDiagnostic);
+    }
+  };
 };
 
+/**
+ * @param {string} stop
+ * @param {Node<any>[]} [nodes]
+ */
+let closeTail = (stop, nodes = parse([stop])) =>
+  // oxlint-disable-next-line no-unused-expressions
+  (last[1] === stop || unexpected(last), nodes);
+
 // One `#if`/`#elif` link: parse its branch, then recurse on the chain tail.
+/**
+ * @param {string} tag
+ * @param {Tok} [t]
+ * @returns {Node<any>[]}
+ */
+let nestElif = (tag, t = last) => {
+  // Elif chains share the nest budget so they fail closed before the native
+  // stack, without appearing as extra `#if` frames in diagnostic context.
+  // oxlint-disable-next-line no-unused-expressions
+  nest < DEPTH || fault("Template too deeply nested", "SJABLOON_TOO_DEEP", t);
+  nest++;
+  const next = branch(compileExpr(tag.slice(6), t[4] + 6, snap()));
+  nest--;
+  return [next];
+};
+
+/** @param {string} tag @returns {Node<any>[]} */
+let elseChain = (tag) => {
+  if (tag.startsWith("#elif ")) return nestElif(tag);
+  if (tag === "#else") return closeTail("/if");
+  // oxlint-disable-next-line no-unused-expressions
+  tag === "/if" || unexpected(last);
+  return [];
+};
+
 /**
  * @param {(v: any) => any} cond
  * @returns {Node<any>}
  */
-let branch = cond => {
-	const then = parse(['#elif', '#else', '/if']);
-	const tag = last[1];
-	let els = /** @type {Node<any>[]} */ ([]);
-	if (tag.startsWith('#elif ')) els = [branch(cp(tag.slice(6), last[4] + 6, snap()))];
-	else if (tag === '#else') {
-		els = parse(['/if']);
-		last[1] === '/if' || unexpected(last);
-	} else if (tag !== '/if') unexpected(last);
-	return (v, o) => run(cond(v) ? then : els, v, o);
+let branch = (cond) => {
+  const then = parse(["#elif", "#else", "/if"]);
+  const els = elseChain(last[1]);
+  return (scope, acc) => run(cond(scope) ? then : els, scope, acc);
+};
+
+/**
+ * @param {any} listValue
+ */
+let eachPairs = (listValue) => {
+  if (Array.isArray(listValue)) return listValue.slice();
+  if (listValue && typeof listValue === "object")
+    return Object.keys(listValue).map((k) => [listValue[k], k]);
+  return [];
+};
+
+let eachEmpty = () =>
+  last[1] === "#else" ? closeTail("/each") : last[1] === "/each" ? [] : unexpected(last);
+
+/**
+ * @param {Tok} t
+ * @param {string} tag
+ * @param {string} name
+ * @param {number} at
+ */
+let checkBinding = (t, tag, name, at) => {
+  // oxlint-disable-next-line no-unused-expressions
+  BLOCKED.test(name) &&
+    fault("Bad {{" + tag + "}}", "SJABLOON_BLOCKED_BINDING", t, at, at + name.length);
+};
+
+/**
+ * @param {Tok} t
+ * @param {string} tag
+ * @param {Node<any>[]} nodes
+ */
+let parseEach = (t, tag, nodes) => {
+  blocks.push(opener("each", t));
+  const m =
+    /^#each ([\s\S]+) as ((\w+)(?:\s*,\s*(\w+))?)$/.exec(tag) ||
+    fault("Bad {{" + tag + "}}", "SJABLOON_EACH_SYNTAX", t);
+  const name = m[3],
+    idx = m[4],
+    at = t[4] + tag.length - m[2].length;
+  checkBinding(t, tag, name, at);
+  const list = compileExpr(m[1], t[4] + 6, snap());
+  const mark = bound.length;
+  bound.push(name);
+  if (idx) {
+    checkBinding(t, tag, idx, t[4] + tag.length - idx.length);
+    bound.push(idx);
+  }
+  bound.push("loop");
+  const body = parse(["#else", "/each"]);
+  bound.length = mark;
+  const empty = eachEmpty();
+  blocks.pop();
+  nest--;
+  nodes.push((scope, acc) => {
+    const listValue = list(scope),
+      arr = Array.isArray(listValue);
+    const pairs = eachPairs(listValue);
+    if (!pairs.length) return run(empty, scope, acc);
+    pairs.forEach((x, j) => {
+      const item = arr ? x : x[0],
+        key = arr ? j : x[1];
+      const child = Object.create(scope);
+      child[name] = item;
+      if (idx) child[idx] = key;
+      child["@"] = item;
+      child.loop = {
+        index: j + 1,
+        index0: j,
+        first: !j,
+        last: j === pairs.length - 1,
+        length: pairs.length,
+      };
+      run(body, child, acc);
+    });
+  });
+};
+
+/**
+ * @param {Tok} t
+ * @param {Node<any>[]} nodes
+ */
+let emitLeaf = (t, nodes) => {
+  if (!t[0]) {
+    // oxlint-disable-next-line no-unused-expressions
+    t[1] && nodes.push(LIT(t[1]));
+    return;
+  }
+  // oxlint-disable-next-line no-unused-expressions
+  RAW ||
+    fault(
+      "Raw {{{" + t[1] + "}}} is not available here; {{ " + t[1] + " }} is already raw",
+      "SJABLOON_RAW_TAG",
+      t,
+    );
+  nodes.push(RAW(compileExpr(t[1], t[4], snap())));
+};
+
+/**
+ * @param {Tok} t
+ * @param {string} tag
+ * @param {Node<any>[]} nodes
+ */
+let emitBlock = (t, tag, nodes) => {
+  if (tag.startsWith("#if ")) {
+    blocks.push(opener("if", t));
+    nodes.push(branch(compileExpr(tag.slice(4), t[4] + 4, snap())));
+    blocks.pop();
+    nest--;
+    return;
+  }
+  if (/^#each(?:\s|$)/.test(tag)) return parseEach(t, tag, nodes);
+  if (/^#(?:if|elif|else)(?:\s|$)/.test(tag)) unexpected(t);
+  fault("Unknown {{" + tag + "}}", "SJABLOON_UNKNOWN_BLOCK", t);
+};
+
+/**
+ * @param {Tok} t
+ * @param {string} tag
+ * @param {Node<any>[]} nodes
+ */
+let emitTag = (t, tag, nodes) => {
+  if (tag[0] === "!") return;
+  if (tag[0] === "#") return emitBlock(t, tag, nodes);
+  if (tag[0] === "/") unexpected(t);
+  nodes.push(VAL(compileExpr(t[1], t[4], snap())));
+};
+
+/**
+ * @param {Tok} t
+ * @param {string[]} stops
+ * @param {Node<any>[]} nodes
+ */
+let takeToken = (t, stops, nodes) => {
+  if (t[0] < 2) return (emitLeaf(t, nodes), 0);
+  if (stops.includes(t[1].split(" ")[0])) return ((last = t), 1);
+  emitTag(t, t[1], nodes);
+  return 0;
 };
 
 /**
  * @param {string[]} stops
  * @returns {Node<any>[]}
  */
-let parse = stops => {
-	const nodes = /** @type {Node<any>[]} */ ([]);
-	for (let t; (t = toks[i++]); ) {
-		const tag = t[1];
-		if (!t[0]) {
-			// Left-trim can shave a text run down to nothing; never emit it.
-			tag && nodes.push(LIT(tag));
-		} else if (t[0] === 1) {
-			// The lexer always tokenizes `}}}` — dropping it would cost the
-			// `triple` latch that keeps lexing linear — so editions without a
-			// raw form reject it here, at the parser, with a located span.
-			RAW || fault('Raw {{{' + tag + '}}} is not available here; {{ ' + tag + ' }} is already raw', 'SJABLOON_RAW_TAG', t);
-			nodes.push(interp(t, RAW));
-		} else if (stops.includes(tag.split(' ')[0])) {
-			last = t;
-			return nodes;
-		} else if (tag[0] === '!') {
-			// comment
-		} else if (tag.startsWith('#if ')) {
-			blocks.push(opener('if', t));
-			nodes.push(branch(cp(tag.slice(4), t[4] + 4, snap())));
-			blocks.pop();
-		} else if (/^#each(?:\s|$)/.test(tag)) {
-			blocks.push(opener('each', t));
-			// `|| fault()` in the initializer, not as a follow-up statement: fault
-			// returns never, so `m` is non-null from here without a second check.
-			const m = /^#each ([\s\S]+) as ((\w+)(?:\s*,\s*(\w+))?)$/.exec(tag) || fault('Bad {{' + tag + '}}', 'SJABLOON_EACH_SYNTAX', t);
-			const name = m[3], idx = m[4], at = t[4] + tag.length - m[2].length;
-			if (BLOCKED.test(name)) fault('Bad {{' + tag + '}}', 'SJABLOON_BLOCKED_BINDING', t, at, at + name.length);
-			if (idx && BLOCKED.test(idx)) {
-				const p = t[4] + tag.length - idx.length;
-				fault('Bad {{' + tag + '}}', 'SJABLOON_BLOCKED_BINDING', t, p, p + idx.length);
-			}
-			const list = cp(m[1], t[4] + 6, snap());
-			// `name`, `idx`, and `loop` are engine-bound inside the body, so
-			// exclude them from names there and restore outer bindings after.
-			const mark = bound.length;
-			bound.push(name);
-			if (idx) bound.push(idx);
-			bound.push('loop');
-			const body = parse(['#else', '/each']);
-			bound.length = mark;
-			let empty = /** @type {Node<any>[]} */ ([]);
-			if (last[1] === '#else') {
-				empty = parse(['/each']);
-				last[1] === '/each' || unexpected(last);
-			} else if (last[1] !== '/each') unexpected(last);
-			blocks.pop();
-			// Child scopes inherit the parent via the prototype chain, so outer
-			// variables stay visible inside the loop body. `@` re-points to the
-			// current item at each level, `$` (root) rides the chain, and `loop`
-			// carries the iteration metadata (index/first/last/length).
-			nodes.push((v, o) => {
-				const lv = list(v), arr = Array.isArray(lv);
-				const ps = arr ? lv.slice() : lv && typeof lv === 'object' ? Object.keys(lv).map(k => [lv[k], k]) : [];
-				if (!ps.length) return run(empty, v, o);
-				// forEach, not a counted loop: `slice()` keeps holes and forEach
-				// skips them exactly as the `.map()` this replaced did, so sparse
-				// arrays iterate the same way with surrounding indexes unshifted.
-				ps.forEach((x, j) => {
-					const item = arr ? x : x[0], key = arr ? j : x[1];
-					const s = Object.create(v);
-					s[name] = item;
-					if (idx) s[idx] = key;
-					s['@'] = item;
-					s.loop = { index: j + 1, index0: j, first: !j, last: j === ps.length - 1, length: ps.length };
-					run(body, s, o);
-				});
-			});
-		} else if (/^#(?:if|elif|else)(?:\s|$)/.test(tag) || tag[0] === '/') {
-			unexpected(t);
-		} else if (tag[0] === '#') {
-			fault('Unknown {{' + tag + '}}', 'SJABLOON_UNKNOWN_BLOCK', t);
-		} else {
-			nodes.push(interp(t, VAL));
-		}
-	}
-	stops.length && fault('Missing {{' + stops[stops.length - 1] + '}}', 'SJABLOON_UNCLOSED_BLOCK');
-	return nodes;
+let parse = (stops) => {
+  const nodes = /** @type {Node<any>[]} */ ([]);
+  for (let t; (t = tokens[i++]);) {
+    if (takeToken(t, stops, nodes)) return nodes;
+  }
+  // oxlint-disable-next-line no-unused-expressions
+  stops.length && fault("Missing {{" + stops[stops.length - 1] + "}}", "SJABLOON_UNCLOSED_BLOCK");
+  return nodes;
+};
+
+/**
+ * Literal text node for the string editions: append `text` onto `acc.text`.
+ *
+ * @param {string} text
+ * @returns {Node<{ text: string }>}
+ */
+export const litNode = (text) => (scope, acc) => {
+  acc.text += text;
 };
 
 /**
@@ -389,58 +582,51 @@ let parse = stops => {
  *   or bad expressions.
  */
 export let make = ([lit, val, raw, seed, take]) => {
-	/**
-	 * @param {string} str
-	 * @param {SjabloonFunctions} [funcs]
-	 * @returns {SjabloonRenderer<T>}
-	 */
-	function template(str, funcs) {
-		LIT = lit, VAL = val, RAW = raw;
-		fns = funcs;
-		// `$` (root) and `@` (current item) are engine-bound anchors, always in
-		// scope, so they never count as caller-supplied `names`.
-		bound = ['$', '@'];
-		nms = new Set();
-		fnms = new Set();
-		src = String(str);
-		blocks = [];
-		toks = lex(src);
-		i = 0;
-		// Deeply nested blocks overflow the recursive-descent parser; surface that
-		// as a SyntaxError so malformed input keeps its documented compile-time
-		// contract (mirroring xprsn's XPRSN_TOO_DEEP for expressions).
-		let nodes;
-		try {
-			nodes = parse([]);
-		} catch (x) {
-			// An empty span at the end, like an unclosed block.
-			if (x instanceof RangeError) fault('Template too deeply nested', 'SJABLOON_TOO_DEEP');
-			throw x;
-		}
-		// Wrap the values in a root scope carrying the anchors, without mutating
-		// what the caller passed: by default `$` and `@` both point at the root.
-		// An embedder can override the anchors with a `{ root, item }` second arg:
-		// `$` = root, `@` = item (distinct objects). Omitting `item` leaves `@`
-		// unbound, so `@.x` throws through xprsn's guard — a group-header band that
-		// has no current row wants exactly that.
-		const f = (/** @type {any} */ v, /** @type {any} */ o) => {
-			v = v || EMPTY;
-			const r = Object.create(v);
-			r['$'] = o ? o.root : v;
-			if (!o) r['@'] = v;
-			else if ('item' in o) r['@'] = o.item;
-			// One accumulator per render, owned here and threaded down. A registry
-			// function that renders another template gets its own, so re-entrancy
-			// needs no bookkeeping.
-			const acc = seed();
-			run(nodes, r, acc);
-			return take(acc);
-		};
-		// Array.from, not a spread: the bundler's transpile turns `[...set]` into
-		// `[].concat(set)`, which wraps the Set instead of unpacking it.
-		f.names = Array.from(nms);
-		f.functions = Array.from(fnms);
-		return f;
-	}
-	return { template, render: (str, values, funcs) => template(str, funcs)(values) };
+  /**
+   * @param {string} str
+   * @param {SjabloonFunctions} [funcs]
+   * @returns {SjabloonRenderer<T>}
+   */
+  function template(str, funcs) {
+    // oxlint-disable-next-line no-unused-expressions
+    ((LIT = lit), (VAL = val), (RAW = raw));
+    fns = funcs;
+    // `$` (root) and `@` (current item) are engine-bound anchors, always in
+    // scope, so they never count as caller-supplied `names`.
+    bound = ["$", "@"];
+    names = new Set();
+    functions = new Set();
+    source = String(str);
+    blocks = [];
+    nest = 0;
+    lex();
+    i = 0;
+    // Deeply nested blocks fail as SJABLOON_TOO_DEEP at DEPTH via opener(),
+    // including elif chains — well below the native stack.
+    let nodes = parse([]);
+    // Wrap the values in a root scope carrying the anchors, without mutating
+    // what the caller passed: by default `$` and `@` both point at the root.
+    // An embedder can override the anchors with a `{ root, item }` second arg:
+    // `$` = root, `@` = item (distinct objects). Omitting `item` leaves `@`
+    // unbound, so `@.x` throws through xprsn's guard — a group-header band that
+    // has no current row wants exactly that.
+    const f = (/** @type {any} */ values, /** @type {any} */ anchors) => {
+      values = values || EMPTY;
+      const r = Object.create(values);
+      r["$"] = anchors ? anchors.root : values;
+      r["@"] = anchors ? anchors.item : values;
+      // One accumulator per render, owned here and threaded down. A registry
+      // function that renders another template gets its own, so re-entrancy
+      // needs no bookkeeping.
+      const acc = seed();
+      run(nodes, r, acc);
+      return take(acc);
+    };
+    // Array.from, not a spread: the bundler's transpile turns `[...set]` into
+    // `[].concat(set)`, which wraps the Set instead of unpacking it.
+    f.names = Array.from(names);
+    f.functions = Array.from(functions);
+    return f;
+  }
+  return { template, render: (str, values, funcs) => template(str, funcs)(values) };
 };