@thomasfosterau/effect-parse 0.1.0 → 0.2.0

package/dist/internal/compiler/first.js

@@ -1,235 +1,259 @@
-import { nodeOf } from "../node.js";
+import * as Predicate from "effect/Predicate";
 import { fastLimit } from "../text.js";
-import { kindOfEncoding, reachesAbove, TableSize, textSet, tokenSet } from "./sets.js";
-export const Strict = 0;
-export const Optional = 1;
-export const Unknown = 2;
-const none = new Uint8Array(TableSize);
-const all = new Uint8Array(TableSize).fill(1);
-const unknown = { mode: Unknown, units: all, high: true };
-const emptyOptional = { mode: Optional, units: none, high: false };
-const failing = { mode: Strict, units: none, high: false };
-const anyUnit = { mode: Strict, units: all, high: true };
+import { nodeOf } from "../node.js";
+import { TableSize, kindOfEncoding, reachesAbove, textSet, tokenSet } from "./sets.js";
+//#region src/internal/compiler/first.ts
+/**
+* First sets: which input units can start a match of a parser.
+*
+* A first set has a mode:
+*
+* - `Strict`: when the next unit is not in `units` (or the input has
+*   ended), the parser fails with `Backtrack`.
+* - `Optional`: in that case, the parser either fails with `Backtrack` or
+*   succeeds without consuming input.
+* - `Unknown`: no guarantee.
+*
+* Units are UTF-16 code units for strings and bytes for byte inputs; units
+* from `TableSize` up are summarized by `high`. Array inputs have no units.
+*
+* Skipping a parser that is certain to fail also skips the callbacks it
+* would have run before failing, which is why callbacks must be pure.
+*/
+const Strict = 0;
+const Optional = 1;
+const Unknown = 2;
+const none = /*#__PURE__*/ new Uint8Array(TableSize);
+const all = /*#__PURE__*/ new Uint8Array(TableSize).fill(1);
+const unknown = {
+	mode: Unknown,
+	units: all,
+	high: true
+};
+const emptyOptional = {
+	mode: Optional,
+	units: none,
+	high: false
+};
+const failing = {
+	mode: 0,
+	units: none,
+	high: false
+};
+const anyUnit = {
+	mode: 0,
+	units: all,
+	high: true
+};
 const union = (a, b, mode) => {
-    const units = new Uint8Array(TableSize);
-    for (let i = 0; i < TableSize; i++)
-        units[i] = a.units[i] | b.units[i];
-    return { mode, units, high: a.high || b.high };
+	const units = new Uint8Array(TableSize);
+	for (let i = 0; i < TableSize; i++) units[i] = a.units[i] | b.units[i];
+	return {
+		mode,
+		units,
+		high: a.high || b.high
+	};
+};
+const withMode = (f, mode) => f.mode === mode ? f : {
+	...f,
+	mode
 };
-const withMode = (f, mode) => f.mode === mode ? f : { ...f, mode };
 const lowerAscii = (c) => c >= 65 && c <= 90 ? c + 32 : c;
 const upperAscii = (c) => c >= 97 && c <= 122 ? c - 32 : c;
-const ofUnits = (codes, mode = Strict) => {
-    const units = new Uint8Array(TableSize);
-    let high = false;
-    for (const c of codes) {
-        if (c < TableSize)
-            units[c] = 1;
-        else
-            high = true;
-    }
-    return { mode, units, high };
+const ofUnits = (codes, mode = 0) => {
+	const units = new Uint8Array(TableSize);
+	let high = false;
+	for (const c of codes) if (c < TableSize) units[c] = 1;
+	else high = true;
+	return {
+		mode,
+		units,
+		high
+	};
+};
+var FirstSets = class {
+	kind;
+	memo = /* @__PURE__ */ new Map();
+	constructor(kind) {
+		this.kind = kind;
+	}
+	of(p) {
+		if (this.kind === 2) return unknown;
+		if (this.memo.has(p)) return this.memo.get(p) ?? unknown;
+		this.memo.set(p, void 0);
+		const f = this.compute(nodeOf(p));
+		this.memo.set(p, f);
+		return f;
+	}
+	/** Units of the code points of a set, as an encoding (or `Token`) reads them. */
+	setUnits(set, enc, mode) {
+		if (enc === void 0 || kindOfEncoding(enc) === 0) {
+			if (this.kind === 1) return {
+				mode,
+				units: set.table,
+				high: false
+			};
+			return {
+				mode,
+				units: set.table,
+				high: reachesAbove(set, TableSize)
+			};
+		}
+		if (enc.unit !== 1) return void 0;
+		const fast = fastLimit(enc);
+		if (fast === 0) return void 0;
+		const units = set.table.slice();
+		if (fast < TableSize) units.fill(reachesAbove(set, fast) ? 1 : 0, fast);
+		return {
+			mode,
+			units,
+			high: false
+		};
+	}
+	compute(node) {
+		const kind = this.kind;
+		switch (node._tag) {
+			case "Succeed":
+			case "Sync":
+			case "Location":
+			case "RestLen":
+			case "Eof": return emptyOptional;
+			case "Fail": return node.mode === "Backtrack" ? failing : unknown;
+			case "Any": return node.encoding !== void 0 && kindOfEncoding(node.encoding) !== kind ? unknown : anyUnit;
+			case "Take": return node.count === 0 ? emptyOptional : anyUnit;
+			case "Literal": {
+				const lit = node.literal;
+				if (node.encoding !== void 0) {
+					if (kindOfEncoding(node.encoding) !== kind) return unknown;
+					if (node.caseless) return lit.length === 0 ? unknown : anyUnit;
+					const encoded = node.encoding.encode(lit);
+					if (encoded.length === 0) return emptyOptional;
+					return ofUnits([Predicate.isString(encoded) ? encoded.charCodeAt(0) : encoded[0]]);
+				}
+				if (lit.length === 0) return emptyOptional;
+				let first;
+				if (Predicate.isString(lit)) first = kind === 0 ? lit.charCodeAt(0) : new TextEncoder().encode(lit)[0];
+				else if (lit instanceof Uint8Array && kind === 1) first = lit[0];
+				else return unknown;
+				return ofUnits(node.caseless ? [
+					first,
+					lowerAscii(first),
+					upperAscii(first)
+				] : [first]);
+			}
+			case "OneOf":
+			case "TakeWhile": {
+				if (node.encoding !== void 0 && kindOfEncoding(node.encoding) !== kind) return unknown;
+				const min = node._tag === "OneOf" ? 1 : node.min;
+				if (node._tag === "TakeWhile" && node.max === 0) return emptyOptional;
+				const mode = min > 0 ? 0 : Optional;
+				if (node.negate) return mode === 0 ? anyUnit : withMode(anyUnit, Optional);
+				const set = node.encoding === void 0 ? tokenSet(node.set, kind) : textSet(node.set);
+				return this.setUnits(set, node.encoding, mode) ?? (mode === 0 ? anyUnit : unknown);
+			}
+			case "Map":
+			case "As":
+			case "Tap":
+			case "TryMap":
+			case "FilterMap":
+			case "Filter":
+			case "Taken":
+			case "WithTaken":
+			case "Span":
+			case "WithSpan":
+			case "Context":
+			case "Expected":
+			case "MapError":
+			case "OrFail":
+			case "Peek":
+			case "Trace":
+			case "Syntax":
+			case "ResumeAfter":
+			case "RetryAfter": return this.of(node.self);
+			case "FlatMap":
+			case "SeparatedFold":
+			case "Dispatch": {
+				const f = this.of(node._tag === "Dispatch" ? node.selector : node.self);
+				return f.mode === 0 ? f : unknown;
+			}
+			case "Mode": {
+				const f = this.of(node.self);
+				return node.from === "Backtrack" ? f.mode === Unknown ? f : unknown : f;
+			}
+			case "Opt":
+			case "OrElseSucceed": {
+				const f = this.of(node.self);
+				return f.mode === Unknown ? f : withMode(f, Optional);
+			}
+			case "Seq":
+			case "Struct": return this.sequence(node.parsers);
+			case "ZipWith": return this.sequence([node.self, node.that]);
+			case "Alt": {
+				if (node.parsers.length === 0) return failing;
+				let acc;
+				let mode = 0;
+				for (const p of node.parsers) {
+					const f = this.of(p);
+					if (f.mode === Unknown) return unknown;
+					if (f.mode === Optional) mode = Optional;
+					acc = acc === void 0 ? f : union(acc, f, mode);
+				}
+				return acc === void 0 ? failing : withMode(acc, mode);
+			}
+			case "Repeat":
+			case "Fold":
+			case "Separated": {
+				if (node.max === 0) return emptyOptional;
+				const f = this.of(node.self);
+				if (f.mode !== 0) return unknown;
+				return node.min === 0 ? withMode(f, Optional) : f;
+			}
+			case "Suspend": return this.of(node.resolve());
+			default: return unknown;
+		}
+	}
+	sequence(parsers) {
+		let acc;
+		for (const p of parsers) {
+			const f = this.of(p);
+			if (f.mode === Unknown) return unknown;
+			acc = acc === void 0 ? f : union(acc, f, f.mode);
+			if (f.mode === 0) return acc;
+		}
+		return acc ?? emptyOptional;
+	}
 };
-export class FirstSets {
-    kind;
-    memo = new Map();
-    constructor(kind) {
-        this.kind = kind;
-    }
-    of(p) {
-        if (this.kind === 2)
-            return unknown;
-        if (this.memo.has(p))
-            return this.memo.get(p) ?? unknown; // in progress: a cycle
-        this.memo.set(p, undefined);
-        const f = this.compute(nodeOf(p));
-        this.memo.set(p, f);
-        return f;
-    }
-    /** Units of the code points of a set, as an encoding (or `Token`) reads them. */
-    setUnits(set, enc, mode) {
-        if (enc === undefined || kindOfEncoding(enc) === 0) {
-            if (this.kind === 1)
-                return { mode, units: set.table, high: false };
-            return { mode, units: set.table, high: reachesAbove(set, TableSize) };
-        }
-        if (enc.unit !== 1)
-            return undefined;
-        const fast = fastLimit(enc);
-        if (fast === 0)
-            return undefined;
-        const units = set.table.slice();
-        // Multi-unit sequences start with a unit at or above `fast`
-        if (fast < TableSize)
-            units.fill(reachesAbove(set, fast) ? 1 : 0, fast);
-        return { mode, units, high: false };
-    }
-    compute(node) {
-        const kind = this.kind;
-        switch (node._tag) {
-            case "Succeed":
-            case "Sync":
-            case "Location":
-            case "RestLen":
-            case "Eof":
-                return emptyOptional;
-            case "Fail":
-                return node.mode === "Backtrack" ? failing : unknown;
-            case "Any":
-                return node.encoding !== undefined && kindOfEncoding(node.encoding) !== kind ? unknown : anyUnit;
-            case "Take":
-                return node.count === 0 ? emptyOptional : anyUnit;
-            case "Literal": {
-                const lit = node.literal;
-                if (node.encoding !== undefined) {
-                    if (kindOfEncoding(node.encoding) !== kind)
-                        return unknown;
-                    if (node.caseless)
-                        return lit.length === 0 ? unknown : anyUnit;
-                    const encoded = node.encoding.encode(lit);
-                    if (encoded.length === 0)
-                        return emptyOptional;
-                    return ofUnits([typeof encoded === "string" ? encoded.charCodeAt(0) : encoded[0]]);
-                }
-                if (lit.length === 0)
-                    return emptyOptional;
-                let first;
-                if (typeof lit === "string") {
-                    first = kind === 0 ? lit.charCodeAt(0) : new TextEncoder().encode(lit)[0];
-                }
-                else if (lit instanceof Uint8Array && kind === 1) {
-                    first = lit[0];
-                }
-                else {
-                    return unknown;
-                }
-                return ofUnits(node.caseless ? [first, lowerAscii(first), upperAscii(first)] : [first]);
-            }
-            case "OneOf":
-            case "TakeWhile": {
-                if (node.encoding !== undefined && kindOfEncoding(node.encoding) !== kind)
-                    return unknown;
-                const min = node._tag === "OneOf" ? 1 : node.min;
-                if (node._tag === "TakeWhile" && node.max === 0)
-                    return emptyOptional;
-                const mode = min > 0 ? Strict : Optional;
-                if (node.negate)
-                    return mode === Strict ? anyUnit : withMode(anyUnit, Optional);
-                const set = node.encoding === undefined ? tokenSet(node.set, kind) : textSet(node.set);
-                return this.setUnits(set, node.encoding, mode) ?? (mode === Strict ? anyUnit : unknown);
-            }
-            case "Map":
-            case "As":
-            case "Tap":
-            case "TryMap":
-            case "FilterMap":
-            case "Filter":
-            case "Taken":
-            case "WithTaken":
-            case "Span":
-            case "WithSpan":
-            case "Context":
-            case "Expected":
-            case "MapError":
-            case "OrFail":
-            case "Peek":
-            case "Trace":
-            case "ResumeAfter":
-            case "RetryAfter":
-                return this.of(node.self);
-            case "FlatMap":
-            case "SeparatedFold":
-            case "Dispatch": {
-                const f = this.of(node._tag === "Dispatch" ? node.selector : node.self);
-                return f.mode === Strict ? f : unknown;
-            }
-            case "Mode": {
-                const f = this.of(node.self);
-                return node.from === "Backtrack" ? (f.mode === Unknown ? f : unknown) : f;
-            }
-            case "Opt":
-            case "OrElseSucceed": {
-                const f = this.of(node.self);
-                return f.mode === Unknown ? f : withMode(f, Optional);
-            }
-            case "Seq":
-            case "Struct":
-                return this.sequence(node.parsers);
-            case "ZipWith":
-                return this.sequence([node.self, node.that]);
-            case "Alt": {
-                if (node.parsers.length === 0)
-                    return failing;
-                let acc;
-                let mode = Strict;
-                for (const p of node.parsers) {
-                    const f = this.of(p);
-                    if (f.mode === Unknown)
-                        return unknown;
-                    if (f.mode === Optional)
-                        mode = Optional;
-                    acc = acc === undefined ? f : union(acc, f, mode);
-                }
-                return withMode(acc, mode);
-            }
-            case "Repeat":
-            case "Fold":
-            case "Separated": {
-                if (node.max === 0)
-                    return emptyOptional;
-                const f = this.of(node.self);
-                if (f.mode !== Strict)
-                    return unknown;
-                return node.min === 0 ? withMode(f, Optional) : f;
-            }
-            case "Suspend":
-                return this.of(node.resolve());
-            default:
-                return unknown;
-        }
-    }
-    sequence(parsers) {
-        let acc;
-        for (const p of parsers) {
-            const f = this.of(p);
-            if (f.mode === Unknown)
-                return unknown;
-            acc = acc === undefined ? f : union(acc, f, f.mode);
-            if (f.mode === Strict)
-                return acc;
-        }
-        return acc ?? emptyOptional;
-    }
-}
-export const planAlt = (firsts) => {
-    const n = firsts.length;
-    if (n < 2 || n > 64)
-        return undefined;
-    const lists = [];
-    const index = new Map();
-    const listOf = (keep) => {
-        const list = [];
-        for (let i = 0; i < n; i++)
-            if (keep(firsts[i]))
-                list.push(i);
-        const key = list.join(",");
-        let k = index.get(key);
-        if (k === undefined) {
-            k = lists.length;
-            lists.push(list);
-            index.set(key, k);
-        }
-        return k;
-    };
-    const byUnit = new Uint8Array(TableSize);
-    for (let u = 0; u < TableSize; u++)
-        byUnit[u] = listOf((f) => f.mode !== Strict || f.units[u] === 1);
-    const high = listOf((f) => f.mode !== Strict || f.high);
-    const end = listOf((f) => f.mode !== Strict);
-    if (lists.length === 1 && lists[0].length === n)
-        return undefined;
-    if (lists.length > 255)
-        return undefined;
-    return { byUnit, high, end, lists };
+const planAlt = (firsts) => {
+	const n = firsts.length;
+	if (n < 2 || n > 64) return void 0;
+	const lists = [];
+	const index = /* @__PURE__ */ new Map();
+	const listOf = (keep) => {
+		const list = [];
+		for (let i = 0; i < n; i++) if (keep(firsts[i])) list.push(i);
+		const key = list.join(",");
+		let k = index.get(key);
+		if (k === void 0) {
+			k = lists.length;
+			lists.push(list);
+			index.set(key, k);
+		}
+		return k;
+	};
+	const byUnit = new Uint8Array(TableSize);
+	for (let u = 0; u < TableSize; u++) byUnit[u] = listOf((f) => f.mode !== 0 || f.units[u] === 1);
+	const high = listOf((f) => f.mode !== 0 || f.high);
+	const end = listOf((f) => f.mode !== 0);
+	if (lists.length === 1 && lists[0].length === n) return void 0;
+	if (lists.length > 255) return void 0;
+	return {
+		byUnit,
+		high,
+		end,
+		lists
+	};
 };
+//#endregion
+export { FirstSets, Strict, planAlt };
+
 //# sourceMappingURL=first.js.map

package/dist/internal/compiler/first.js.map

@@ -1 +1 @@
-{"version":3,"file":"first.js","sourceRoot":"","sources":["../../../src/internal/compiler/first.ts"],"names":[],"mappings":"AAmBA,OAAO,EAAE,MAAM,EAAE,MAAM,YAAY,CAAA;AACnC,OAAO,EAAE,SAAS,EAAE,MAAM,YAAY,CAAA;AAEtC,OAAO,EAAE,cAAc,EAAE,YAAY,EAAE,SAAS,EAAE,OAAO,EAAE,QAAQ,EAAE,MAAM,WAAW,CAAA;AAEtF,MAAM,CAAC,MAAM,MAAM,GAAG,CAAC,CAAA;AACvB,MAAM,CAAC,MAAM,QAAQ,GAAG,CAAC,CAAA;AACzB,MAAM,CAAC,MAAM,OAAO,GAAG,CAAC,CAAA;AAQxB,MAAM,IAAI,GAAG,IAAI,UAAU,CAAC,SAAS,CAAC,CAAA;AACtC,MAAM,GAAG,GAAG,IAAI,UAAU,CAAC,SAAS,CAAC,CAAC,IAAI,CAAC,CAAC,CAAC,CAAA;AAE7C,MAAM,OAAO,GAAU,EAAE,IAAI,EAAE,OAAO,EAAE,KAAK,EAAE,GAAG,EAAE,IAAI,EAAE,IAAI,EAAE,CAAA;AAChE,MAAM,aAAa,GAAU,EAAE,IAAI,EAAE,QAAQ,EAAE,KAAK,EAAE,IAAI,EAAE,IAAI,EAAE,KAAK,EAAE,CAAA;AACzE,MAAM,OAAO,GAAU,EAAE,IAAI,EAAE,MAAM,EAAE,KAAK,EAAE,IAAI,EAAE,IAAI,EAAE,KAAK,EAAE,CAAA;AACjE,MAAM,OAAO,GAAU,EAAE,IAAI,EAAE,MAAM,EAAE,KAAK,EAAE,GAAG,EAAE,IAAI,EAAE,IAAI,EAAE,CAAA;AAE/D,MAAM,KAAK,GAAG,CAAC,CAAQ,EAAE,CAAQ,EAAE,IAAe,EAAS,EAAE;IAC3D,MAAM,KAAK,GAAG,IAAI,UAAU,CAAC,SAAS,CAAC,CAAA;IACvC,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,SAAS,EAAE,CAAC,EAAE;QAAE,KAAK,CAAC,CAAC,CAAC,GAAG,CAAC,CAAC,KAAK,CAAC,CAAC,CAAE,GAAG,CAAC,CAAC,KAAK,CAAC,CAAC,CAAE,CAAA;IACxE,OAAO,EAAE,IAAI,EAAE,KAAK,EAAE,IAAI,EAAE,CAAC,CAAC,IAAI,IAAI,CAAC,CAAC,IAAI,EAAE,CAAA;AAChD,CAAC,CAAA;AAED,MAAM,QAAQ,GAAG,CAAC,CAAQ,EAAE,IAAe,EAAS,EAAE,CAAC,CAAC,CAAC,IAAI,KAAK,IAAI,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,EAAE,GAAG,CAAC,EAAE,IAAI,EAAE,CAAA;AAE3F,MAAM,UAAU,GAAG,CAAC,CAAS,EAAU,EAAE,CAAC,CAAC,IAAI,EAAE,IAAI,CAAC,IAAI,EAAE,CAAC,CAAC,CAAC,CAAC,GAAG,EAAE,CAAC,CAAC,CAAC,CAAC,CAAA;AACzE,MAAM,UAAU,GAAG,CAAC,CAAS,EAAU,EAAE,CAAC,CAAC,IAAI,EAAE,IAAI,CAAC,IAAI,GAAG,CAAC,CAAC,CAAC,CAAC,GAAG,EAAE,CAAC,CAAC,CAAC,CAAC,CAAA;AAE1E,MAAM,OAAO,GAAG,CAAC,KAA4B,EAAE,IAAI,GAAc,MAAM,EAAS,EAAE;IAChF,MAAM,KAAK,GAAG,IAAI,UAAU,CAAC,SAAS,CAAC,CAAA;IACvC,IAAI,IAAI,GAAG,KAAK,CAAA;IAChB,KAAK,MAAM,CAAC,IAAI,KAAK,EAAE,CAAC;QACtB,IAAI,CAAC,GAAG,SAAS;YAAE,KAAK,CAAC,CAAC,CAAC,GAAG,CAAC,CAAA;;YAC1B,IAAI,GAAG,IAAI,CAAA;IAClB,CAAC;IACD,OAAO,EAAE,IAAI,EAAE,KAAK,EAAE,IAAI,EAAE,CAAA;AAC9B,CAAC,CAAA;AAED,MAAM,OAAO,SAAS;IAEC,IAAI;IADR,IAAI,GAAG,IAAI,GAAG,EAAiC,CAAA;IAChE,YAAqB,IAAe;oBAAf,IAAI;IAAc,CAAC;IAExC,EAAE,CAAC,CAAa;QACd,IAAI,IAAI,CAAC,IAAI,KAAK,CAAC;YAAE,OAAO,OAAO,CAAA;QACnC,IAAI,IAAI,CAAC,IAAI,CAAC,GAAG,CAAC,CAAC,CAAC;YAAE,OAAO,IAAI,CAAC,IAAI,CAAC,GAAG,CAAC,CAAC,CAAC,IAAI,OAAO,CAAA,CAAC,uBAAuB;QAChF,IAAI,CAAC,IAAI,CAAC,GAAG,CAAC,CAAC,EAAE,SAAS,CAAC,CAAA;QAC3B,MAAM,CAAC,GAAG,IAAI,CAAC,OAAO,CAAC,MAAM,CAAC,CAAC,CAAC,CAAC,CAAA;QACjC,IAAI,CAAC,IAAI,CAAC,GAAG,CAAC,CAAC,EAAE,CAAC,CAAC,CAAA;QACnB,OAAO,CAAC,CAAA;IACV,CAAC;IAED,iFAAiF;IACzE,QAAQ,CAAC,GAAY,EAAE,GAA8B,EAAE,IAAW;QACxE,IAAI,GAAG,KAAK,SAAS,IAAI,cAAc,CAAC,GAAG,CAAC,KAAK,CAAC,EAAE,CAAC;YACnD,IAAI,IAAI,CAAC,IAAI,KAAK,CAAC;gBAAE,OAAO,EAAE,IAAI,EAAE,KAAK,EAAE,GAAG,CAAC,KAAK,EAAE,IAAI,EAAE,KAAK,EAAE,CAAA;YACnE,OAAO,EAAE,IAAI,EAAE,KAAK,EAAE,GAAG,CAAC,KAAK,EAAE,IAAI,EAAE,YAAY,CAAC,GAAG,EAAE,SAAS,CAAC,EAAE,CAAA;QACvE,CAAC;QACD,IAAI,GAAG,CAAC,IAAI,KAAK,CAAC;YAAE,OAAO,SAAS,CAAA;QACpC,MAAM,IAAI,GAAG,SAAS,CAAC,GAAG,CAAC,CAAA;QAC3B,IAAI,IAAI,KAAK,CAAC;YAAE,OAAO,SAAS,CAAA;QAChC,MAAM,KAAK,GAAG,GAAG,CAAC,KAAK,CAAC,KAAK,EAAE,CAAA;QAC/B,4DAA4D;QAC5D,IAAI,IAAI,GAAG,SAAS;YAAE,KAAK,CAAC,IAAI,CAAC,YAAY,CAAC,GAAG,EAAE,IAAI,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,EAAE,IAAI,CAAC,CAAA;QACvE,OAAO,EAAE,IAAI,EAAE,KAAK,EAAE,IAAI,EAAE,KAAK,EAAE,CAAA;IACrC,CAAC;IAEO,OAAO,CAAC,IAAU;QACxB,MAAM,IAAI,GAAG,IAAI,CAAC,IAAa,CAAA;QAC/B,QAAQ,IAAI,CAAC,IAAI,EAAE,CAAC;YAClB,KAAK,SAAS,CAAC;YACf,KAAK,MAAM,CAAC;YACZ,KAAK,UAAU,CAAC;YAChB,KAAK,SAAS,CAAC;YACf,KAAK,KAAK;gBACR,OAAO,aAAa,CAAA;YACtB,KAAK,MAAM;gBACT,OAAO,IAAI,CAAC,IAAI,KAAK,WAAW,CAAC,CAAC,CAAC,OAAO,CAAC,CAAC,CAAC,OAAO,CAAA;YACtD,KAAK,KAAK;gBACR,OAAO,IAAI,CAAC,QAAQ,KAAK,SAAS,IAAI,cAAc,CAAC,IAAI,CAAC,QAAQ,CAAC,KAAK,IAAI,CAAC,CAAC,CAAC,OAAO,CAAC,CAAC,CAAC,OAAO,CAAA;YAClG,KAAK,MAAM;gBACT,OAAO,IAAI,CAAC,KAAK,KAAK,CAAC,CAAC,CAAC,CAAC,aAAa,CAAC,CAAC,CAAC,OAAO,CAAA;YACnD,KAAK,SAAS,EAAE,CAAC;gBACf,MAAM,GAAG,GAAG,IAAI,CAAC,OAAO,CAAA;gBACxB,IAAI,IAAI,CAAC,QAAQ,KAAK,SAAS,EAAE,CAAC;oBAChC,IAAI,cAAc,CAAC,IAAI,CAAC,QAAQ,CAAC,KAAK,IAAI;wBAAE,OAAO,OAAO,CAAA;oBAC1D,IAAI,IAAI,CAAC,QAAQ;wBAAE,OAAO,GAAG,CAAC,MAAM,KAAK,CAAC,CAAC,CAAC,CAAC,OAAO,CAAC,CAAC,CAAC,OAAO,CAAA;oBAC9D,MAAM,OAAO,GAAG,IAAI,CAAC,QAAQ,CAAC,MAAM,CAAC,GAAa,CAAC,CAAA;oBACnD,IAAI,OAAO,CAAC,MAAM,KAAK,CAAC;wBAAE,OAAO,aAAa,CAAA;oBAC9C,OAAO,OAAO,CAAC,CAAC,OAAO,OAAO,KAAK,QAAQ,CAAC,CAAC,CAAC,OAAO,CAAC,UAAU,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,OAAO,CAAC,CAAC,CAAE,CAAC,CAAC,CAAA;gBACrF,CAAC;gBACD,IAAI,GAAG,CAAC,MAAM,KAAK,CAAC;oBAAE,OAAO,aAAa,CAAA;gBAC1C,IAAI,KAAa,CAAA;gBACjB,IAAI,OAAO,GAAG,KAAK,QAAQ,EAAE,CAAC;oBAC5B,KAAK,GAAG,IAAI,KAAK,CAAC,CAAC,CAAC,CAAC,GAAG,CAAC,UAAU,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,IAAI,WAAW,EAAE,CAAC,MAAM,CAAC,GAAG,CAAC,CAAC,CAAC,CAAE,CAAA;gBAC5E,CAAC;qBAAM,IAAI,GAAG,YAAY,UAAU,IAAI,IAAI,KAAK,CAAC,EAAE,CAAC;oBACnD,KAAK,GAAG,GAAG,CAAC,CAAC,CAAE,CAAA;gBACjB,CAAC;qBAAM,CAAC;oBACN,OAAO,OAAO,CAAA;gBAChB,CAAC;gBACD,OAAO,OAAO,CAAC,IAAI,CAAC,QAAQ,CAAC,CAAC,CAAC,CAAC,KAAK,EAAE,UAAU,CAAC,KAAK,CAAC,EAAE,UAAU,CAAC,KAAK,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,KAAK,CAAC,CAAC,CAAA;YACzF,CAAC;YACD,KAAK,OAAO,CAAC;YACb,KAAK,WAAW,EAAE,CAAC;gBACjB,IAAI,IAAI,CAAC,QAAQ,KAAK,SAAS,IAAI,cAAc,CAAC,IAAI,CAAC,QAAQ,CAAC,KAAK,IAAI;oBAAE,OAAO,OAAO,CAAA;gBACzF,MAAM,GAAG,GAAG,IAAI,CAAC,IAAI,KAAK,OAAO,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,IAAI,CAAC,GAAG,CAAA;gBAChD,IAAI,IAAI,CAAC,IAAI,KAAK,WAAW,IAAI,IAAI,CAAC,GAAG,KAAK,CAAC;oBAAE,OAAO,aAAa,CAAA;gBACrE,MAAM,IAAI,GAAG,GAAG,GAAG,CAAC,CAAC,CAAC,CAAC,MAAM,CAAC,CAAC,CAAC,QAAQ,CAAA;gBACxC,IAAI,IAAI,CAAC,MAAM;oBAAE,OAAO,IAAI,KAAK,MAAM,CAAC,CAAC,CAAC,OAAO,CAAC,CAAC,CAAC,QAAQ,CAAC,OAAO,EAAE,QAAQ,CAAC,CAAA;gBAC/E,MAAM,GAAG,GAAG,IAAI,CAAC,QAAQ,KAAK,SAAS,CAAC,CAAC,CAAC,QAAQ,CAAC,IAAI,CAAC,GAAG,EAAE,IAAI,CAAC,CAAC,CAAC,CAAC,OAAO,CAAC,IAAI,CAAC,GAAG,CAAC,CAAA;gBACtF,OAAO,IAAI,CAAC,QAAQ,CAAC,GAAG,EAAE,IAAI,CAAC,QAAQ,EAAE,IAAI,CAAC,IAAI,CAAC,IAAI,KAAK,MAAM,CAAC,CAAC,CAAC,OAAO,CAAC,CAAC,CAAC,OAAO,CAAC,CAAA;YACzF,CAAC;YACD,KAAK,KAAK,CAAC;YACX,KAAK,IAAI,CAAC;YACV,KAAK,KAAK,CAAC;YACX,KAAK,QAAQ,CAAC;YACd,KAAK,WAAW,CAAC;YACjB,KAAK,QAAQ,CAAC;YACd,KAAK,OAAO,CAAC;YACb,KAAK,WAAW,CAAC;YACjB,KAAK,MAAM,CAAC;YACZ,KAAK,UAAU,CAAC;YAChB,KAAK,SAAS,CAAC;YACf,KAAK,UAAU,CAAC;YAChB,KAAK,UAAU,CAAC;YAChB,KAAK,QAAQ,CAAC;YACd,KAAK,MAAM,CAAC;YACZ,KAAK,OAAO,CAAC;YACb,KAAK,aAAa,CAAC;YACnB,KAAK,YAAY;gBACf,OAAO,IAAI,CAAC,EAAE,CAAC,IAAI,CAAC,IAAI,CAAC,CAAA;YAC3B,KAAK,SAAS,CAAC;YACf,KAAK,eAAe,CAAC;YACrB,KAAK,UAAU,EAAE,CAAC;gBAChB,MAAM,CAAC,GAAG,IAAI,CAAC,EAAE,CAAC,IAAI,CAAC,IAAI,KAAK,UAAU,CAAC,CAAC,CAAC,IAAI,CAAC,QAAQ,CAAC,CAAC,CAAC,IAAI,CAAC,IAAI,CAAC,CAAA;gBACvE,OAAO,CAAC,CAAC,IAAI,KAAK,MAAM,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,OAAO,CAAA;YACxC,CAAC;YACD,KAAK,MAAM,EAAE,CAAC;gBACZ,MAAM,CAAC,GAAG,IAAI,CAAC,EAAE,CAAC,IAAI,CAAC,IAAI,CAAC,CAAA;gBAC5B,OAAO,IAAI,CAAC,IAAI,KAAK,WAAW,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,IAAI,KAAK,OAAO,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,OAAO,CAAC,CAAC,CAAC,CAAC,CAAC,CAAA;YAC3E,CAAC;YACD,KAAK,KAAK,CAAC;YACX,KAAK,eAAe,EAAE,CAAC;gBACrB,MAAM,CAAC,GAAG,IAAI,CAAC,EAAE,CAAC,IAAI,CAAC,IAAI,CAAC,CAAA;gBAC5B,OAAO,CAAC,CAAC,IAAI,KAAK,OAAO,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,QAAQ,CAAC,CAAC,EAAE,QAAQ,CAAC,CAAA;YACvD,CAAC;YACD,KAAK,KAAK,CAAC;YACX,KAAK,QAAQ;gBACX,OAAO,IAAI,CAAC,QAAQ,CAAC,IAAI,CAAC,OAAO,CAAC,CAAA;YACpC,KAAK,SAAS;gBACZ,OAAO,IAAI,CAAC,QAAQ,CAAC,CAAC,IAAI,CAAC,IAAI,EAAE,IAAI,CAAC,IAAI,CAAC,CAAC,CAAA;YAC9C,KAAK,KAAK,EAAE,CAAC;gBACX,IAAI,IAAI,CAAC,OAAO,CAAC,MAAM,KAAK,CAAC;oBAAE,OAAO,OAAO,CAAA;gBAC7C,IAAI,GAAsB,CAAA;gBAC1B,IAAI,IAAI,GAAc,MAAM,CAAA;gBAC5B,KAAK,MAAM,CAAC,IAAI,IAAI,CAAC,OAAO,EAAE,CAAC;oBAC7B,MAAM,CAAC,GAAG,IAAI,CAAC,EAAE,CAAC,CAAC,CAAC,CAAA;oBACpB,IAAI,CAAC,CAAC,IAAI,KAAK,OAAO;wBAAE,OAAO,OAAO,CAAA;oBACtC,IAAI,CAAC,CAAC,IAAI,KAAK,QAAQ;wBAAE,IAAI,GAAG,QAAQ,CAAA;oBACxC,GAAG,GAAG,GAAG,KAAK,SAAS,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,KAAK,CAAC,GAAG,EAAE,CAAC,EAAE,IAAI,CAAC,CAAA;gBACnD,CAAC;gBACD,OAAO,QAAQ,CAAC,GAAI,EAAE,IAAI,CAAC,CAAA;YAC7B,CAAC;YACD,KAAK,QAAQ,CAAC;YACd,KAAK,MAAM,CAAC;YACZ,KAAK,WAAW,EAAE,CAAC;gBACjB,IAAI,IAAI,CAAC,GAAG,KAAK,CAAC;oBAAE,OAAO,aAAa,CAAA;gBACxC,MAAM,CAAC,GAAG,IAAI,CAAC,EAAE,CAAC,IAAI,CAAC,IAAI,CAAC,CAAA;gBAC5B,IAAI,CAAC,CAAC,IAAI,KAAK,MAAM;oBAAE,OAAO,OAAO,CAAA;gBACrC,OAAO,IAAI,CAAC,GAAG,KAAK,CAAC,CAAC,CAAC,CAAC,QAAQ,CAAC,CAAC,EAAE,QAAQ,CAAC,CAAC,CAAC,CAAC,CAAC,CAAA;YACnD,CAAC;YACD,KAAK,SAAS;gBACZ,OAAO,IAAI,CAAC,EAAE,CAAC,IAAI,CAAC,OAAO,EAAE,CAAC,CAAA;YAChC;gBACE,OAAO,OAAO,CAAA;QAClB,CAAC;IACH,CAAC;IAEO,QAAQ,CAAC,OAAkC;QACjD,IAAI,GAAsB,CAAA;QAC1B,KAAK,MAAM,CAAC,IAAI,OAAO,EAAE,CAAC;YACxB,MAAM,CAAC,GAAG,IAAI,CAAC,EAAE,CAAC,CAAC,CAAC,CAAA;YACpB,IAAI,CAAC,CAAC,IAAI,KAAK,OAAO;gBAAE,OAAO,OAAO,CAAA;YACtC,GAAG,GAAG,GAAG,KAAK,SAAS,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,KAAK,CAAC,GAAG,EAAE,CAAC,EAAE,CAAC,CAAC,IAAI,CAAC,CAAA;YACnD,IAAI,CAAC,CAAC,IAAI,KAAK,MAAM;gBAAE,OAAO,GAAG,CAAA;QACnC,CAAC;QACD,OAAO,GAAG,IAAI,aAAa,CAAA;IAC7B,CAAC;CACF;AAeD,MAAM,CAAC,MAAM,OAAO,GAAG,CAAC,MAA4B,EAAuB,EAAE;IAC3E,MAAM,CAAC,GAAG,MAAM,CAAC,MAAM,CAAA;IACvB,IAAI,CAAC,GAAG,CAAC,IAAI,CAAC,GAAG,EAAE;QAAE,OAAO,SAAS,CAAA;IACrC,MAAM,KAAK,GAAiC,EAAE,CAAA;IAC9C,MAAM,KAAK,GAAG,IAAI,GAAG,EAAkB,CAAA;IACvC,MAAM,MAAM,GAAG,CAAC,IAA2B,EAAU,EAAE;QACrD,MAAM,IAAI,GAAkB,EAAE,CAAA;QAC9B,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,CAAC,EAAE,CAAC,EAAE;YAAE,IAAI,IAAI,CAAC,MAAM,CAAC,CAAC,CAAE,CAAC;gBAAE,IAAI,CAAC,IAAI,CAAC,CAAC,CAAC,CAAA;QAC9D,MAAM,GAAG,GAAG,IAAI,CAAC,IAAI,CAAC,GAAG,CAAC,CAAA;QAC1B,IAAI,CAAC,GAAG,KAAK,CAAC,GAAG,CAAC,GAAG,CAAC,CAAA;QACtB,IAAI,CAAC,KAAK,SAAS,EAAE,CAAC;YACpB,CAAC,GAAG,KAAK,CAAC,MAAM,CAAA;YAChB,KAAK,CAAC,IAAI,CAAC,IAAI,CAAC,CAAA;YAChB,KAAK,CAAC,GAAG,CAAC,GAAG,EAAE,CAAC,CAAC,CAAA;QACnB,CAAC;QACD,OAAO,CAAC,CAAA;IACV,CAAC,CAAA;IACD,MAAM,MAAM,GAAG,IAAI,UAAU,CAAC,SAAS,CAAC,CAAA;IACxC,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,SAAS,EAAE,CAAC,EAAE;QAAE,MAAM,CAAC,CAAC,CAAC,GAAG,MAAM,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,IAAI,KAAK,MAAM,IAAI,CAAC,CAAC,KAAK,CAAC,CAAC,CAAC,KAAK,CAAC,CAAC,CAAA;IACpG,MAAM,IAAI,GAAG,MAAM,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,IAAI,KAAK,MAAM,IAAI,CAAC,CAAC,IAAI,CAAC,CAAA;IACvD,MAAM,GAAG,GAAG,MAAM,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,IAAI,KAAK,MAAM,CAAC,CAAA;IAC5C,IAAI,KAAK,CAAC,MAAM,KAAK,CAAC,IAAI,KAAK,CAAC,CAAC,CAAE,CAAC,MAAM,KAAK,CAAC;QAAE,OAAO,SAAS,CAAA;IAClE,IAAI,KAAK,CAAC,MAAM,GAAG,GAAG;QAAE,OAAO,SAAS,CAAA;IACxC,OAAO,EAAE,MAAM,EAAE,IAAI,EAAE,GAAG,EAAE,KAAK,EAAE,CAAA;AACrC,CAAC,CAAA"}
+{"version":3,"file":"first.js","names":[],"sources":["../../../src/internal/compiler/first.ts"],"sourcesContent":["/**\n * First sets: which input units can start a match of a parser.\n *\n * A first set has a mode:\n *\n * - `Strict`: when the next unit is not in `units` (or the input has\n *   ended), the parser fails with `Backtrack`.\n * - `Optional`: in that case, the parser either fails with `Backtrack` or\n *   succeeds without consuming input.\n * - `Unknown`: no guarantee.\n *\n * Units are UTF-16 code units for strings and bytes for byte inputs; units\n * from `TableSize` up are summarized by `high`. Array inputs have no units.\n *\n * Skipping a parser that is certain to fail also skips the callbacks it\n * would have run before failing, which is why callbacks must be pure.\n */\nimport * as Predicate from \"effect/Predicate\"\nimport type { Encoding } from \"../../Encoding.js\"\nimport type { Node, ParserLike } from \"../node.js\"\nimport { nodeOf } from \"../node.js\"\nimport { fastLimit } from \"../text.js\"\nimport type { CharSet } from \"./sets.js\"\nimport { kindOfEncoding, reachesAbove, TableSize, textSet, tokenSet } from \"./sets.js\"\n\nexport const Strict = 0\nconst Optional = 1\nconst Unknown = 2\n\nexport interface First {\n  readonly mode: 0 | 1 | 2\n  readonly units: Uint8Array\n  readonly high: boolean\n}\n\nconst none = /*#__PURE__*/ new Uint8Array(TableSize)\nconst all = /*#__PURE__*/ new Uint8Array(TableSize).fill(1)\n\nconst unknown: First = { mode: Unknown, units: all, high: true }\nconst emptyOptional: First = { mode: Optional, units: none, high: false }\nconst failing: First = { mode: Strict, units: none, high: false }\nconst anyUnit: First = { mode: Strict, units: all, high: true }\n\nconst union = (a: First, b: First, mode: 0 | 1 | 2): First => {\n  const units = new Uint8Array(TableSize)\n  for (let i = 0; i < TableSize; i++) units[i] = a.units[i] | b.units[i]\n  return { mode, units, high: a.high || b.high }\n}\n\nconst withMode = (f: First, mode: 0 | 1 | 2): First => (f.mode === mode ? f : { ...f, mode })\n\nconst lowerAscii = (c: number): number => (c >= 65 && c <= 90 ? c + 32 : c)\nconst upperAscii = (c: number): number => (c >= 97 && c <= 122 ? c - 32 : c)\n\nconst ofUnits = (codes: ReadonlyArray<number>, mode: 0 | 1 | 2 = Strict): First => {\n  const units = new Uint8Array(TableSize)\n  let high = false\n  for (const c of codes) {\n    if (c < TableSize) units[c] = 1\n    else high = true\n  }\n  return { mode, units, high }\n}\n\nexport class FirstSets {\n  private readonly memo = new Map<ParserLike, First | undefined>()\n  constructor(readonly kind: 0 | 1 | 2) {}\n\n  of(p: ParserLike): First {\n    if (this.kind === 2) return unknown\n    if (this.memo.has(p)) return this.memo.get(p) ?? unknown // in progress: a cycle\n    this.memo.set(p, undefined)\n    const f = this.compute(nodeOf(p))\n    this.memo.set(p, f)\n    return f\n  }\n\n  /** Units of the code points of a set, as an encoding (or `Token`) reads them. */\n  private setUnits(set: CharSet, enc: Encoding<any> | undefined, mode: 0 | 1): First | undefined {\n    if (enc === undefined || kindOfEncoding(enc) === 0) {\n      if (this.kind === 1) return { mode, units: set.table, high: false }\n      return { mode, units: set.table, high: reachesAbove(set, TableSize) }\n    }\n    if (enc.unit !== 1) return undefined\n    const fast = fastLimit(enc)\n    if (fast === 0) return undefined\n    const units = set.table.slice()\n    // Multi-unit sequences start with a unit at or above `fast`\n    if (fast < TableSize) units.fill(reachesAbove(set, fast) ? 1 : 0, fast)\n    return { mode, units, high: false }\n  }\n\n  private compute(node: Node): First {\n    const kind = this.kind as 0 | 1\n    switch (node._tag) {\n      case \"Succeed\":\n      case \"Sync\":\n      case \"Location\":\n      case \"RestLen\":\n      case \"Eof\":\n        return emptyOptional\n      case \"Fail\":\n        return node.mode === \"Backtrack\" ? failing : unknown\n      case \"Any\":\n        return node.encoding !== undefined && kindOfEncoding(node.encoding) !== kind ? unknown : anyUnit\n      case \"Take\":\n        return node.count === 0 ? emptyOptional : anyUnit\n      case \"Literal\": {\n        const lit = node.literal\n        if (node.encoding !== undefined) {\n          if (kindOfEncoding(node.encoding) !== kind) return unknown\n          if (node.caseless) return lit.length === 0 ? unknown : anyUnit\n          const encoded = node.encoding.encode(lit as string)\n          if (encoded.length === 0) return emptyOptional\n          return ofUnits([Predicate.isString(encoded) ? encoded.charCodeAt(0) : encoded[0]])\n        }\n        if (lit.length === 0) return emptyOptional\n        let first: number\n        if (Predicate.isString(lit)) {\n          first = kind === 0 ? lit.charCodeAt(0) : new TextEncoder().encode(lit)[0]\n        } else if (lit instanceof Uint8Array && kind === 1) {\n          first = lit[0]\n        } else {\n          return unknown\n        }\n        return ofUnits(node.caseless ? [first, lowerAscii(first), upperAscii(first)] : [first])\n      }\n      case \"OneOf\":\n      case \"TakeWhile\": {\n        if (node.encoding !== undefined && kindOfEncoding(node.encoding) !== kind) return unknown\n        const min = node._tag === \"OneOf\" ? 1 : node.min\n        if (node._tag === \"TakeWhile\" && node.max === 0) return emptyOptional\n        const mode = min > 0 ? Strict : Optional\n        if (node.negate) return mode === Strict ? anyUnit : withMode(anyUnit, Optional)\n        const set = node.encoding === undefined ? tokenSet(node.set, kind) : textSet(node.set)\n        return this.setUnits(set, node.encoding, mode) ?? (mode === Strict ? anyUnit : unknown)\n      }\n      case \"Map\":\n      case \"As\":\n      case \"Tap\":\n      case \"TryMap\":\n      case \"FilterMap\":\n      case \"Filter\":\n      case \"Taken\":\n      case \"WithTaken\":\n      case \"Span\":\n      case \"WithSpan\":\n      case \"Context\":\n      case \"Expected\":\n      case \"MapError\":\n      case \"OrFail\":\n      case \"Peek\":\n      case \"Trace\":\n      case \"Syntax\":\n      case \"ResumeAfter\":\n      case \"RetryAfter\":\n        return this.of(node.self)\n      case \"FlatMap\":\n      case \"SeparatedFold\":\n      case \"Dispatch\": {\n        const f = this.of(node._tag === \"Dispatch\" ? node.selector : node.self)\n        return f.mode === Strict ? f : unknown\n      }\n      case \"Mode\": {\n        const f = this.of(node.self)\n        return node.from === \"Backtrack\" ? (f.mode === Unknown ? f : unknown) : f\n      }\n      case \"Opt\":\n      case \"OrElseSucceed\": {\n        const f = this.of(node.self)\n        return f.mode === Unknown ? f : withMode(f, Optional)\n      }\n      case \"Seq\":\n      case \"Struct\":\n        return this.sequence(node.parsers)\n      case \"ZipWith\":\n        return this.sequence([node.self, node.that])\n      case \"Alt\": {\n        if (node.parsers.length === 0) return failing\n        let acc: First | undefined\n        let mode: 0 | 1 | 2 = Strict\n        for (const p of node.parsers) {\n          const f = this.of(p)\n          if (f.mode === Unknown) return unknown\n          if (f.mode === Optional) mode = Optional\n          acc = acc === undefined ? f : union(acc, f, mode)\n        }\n        return acc === undefined ? failing : withMode(acc, mode)\n      }\n      case \"Repeat\":\n      case \"Fold\":\n      case \"Separated\": {\n        if (node.max === 0) return emptyOptional\n        const f = this.of(node.self)\n        if (f.mode !== Strict) return unknown\n        return node.min === 0 ? withMode(f, Optional) : f\n      }\n      case \"Suspend\":\n        return this.of(node.resolve())\n      default:\n        return unknown\n    }\n  }\n\n  private sequence(parsers: ReadonlyArray<ParserLike>): First {\n    let acc: First | undefined\n    for (const p of parsers) {\n      const f = this.of(p)\n      if (f.mode === Unknown) return unknown\n      acc = acc === undefined ? f : union(acc, f, f.mode)\n      if (f.mode === Strict) return acc\n    }\n    return acc ?? emptyOptional\n  }\n}\n\n/**\n * For an `Alt`: the branches worth trying for each next unit, each next\n * high unit, and at the end of the input, or `undefined` when pruning\n * would never skip a branch.\n */\nexport interface AltPlan {\n  /** Indexed by unit: indexes into `lists`. */\n  readonly byUnit: Uint8Array\n  readonly high: number\n  readonly end: number\n  readonly lists: ReadonlyArray<ReadonlyArray<number>>\n}\n\nexport const planAlt = (firsts: ReadonlyArray<First>): AltPlan | undefined => {\n  const n = firsts.length\n  if (n < 2 || n > 64) return undefined\n  const lists: Array<ReadonlyArray<number>> = []\n  const index = new Map<string, number>()\n  const listOf = (keep: (f: First) => boolean): number => {\n    const list: Array<number> = []\n    for (let i = 0; i < n; i++) if (keep(firsts[i])) list.push(i)\n    const key = list.join(\",\")\n    let k = index.get(key)\n    if (k === undefined) {\n      k = lists.length\n      lists.push(list)\n      index.set(key, k)\n    }\n    return k\n  }\n  const byUnit = new Uint8Array(TableSize)\n  for (let u = 0; u < TableSize; u++) byUnit[u] = listOf((f) => f.mode !== Strict || f.units[u] === 1)\n  const high = listOf((f) => f.mode !== Strict || f.high)\n  const end = listOf((f) => f.mode !== Strict)\n  if (lists.length === 1 && lists[0].length === n) return undefined\n  if (lists.length > 255) return undefined\n  return { byUnit, high, end, lists }\n}\n"],"mappings":";;;;;;;;;;;;;;;;;;;;;;AAyBA,MAAa,SAAS;AACtB,MAAM,WAAW;AACjB,MAAM,UAAU;AAQhB,MAAM,qBAAqB,IAAI,WAAW,SAAS;AACnD,MAAM,MAAoB,kBAAI,WAAW,SAAS,CAAC,CAAC,KAAK,CAAC;AAE1D,MAAM,UAAiB;CAAE,MAAM;CAAS,OAAO;CAAK,MAAM;AAAK;AAC/D,MAAM,gBAAuB;CAAE,MAAM;CAAU,OAAO;CAAM,MAAM;AAAM;AACxE,MAAM,UAAiB;CAAE,MAAA;CAAc,OAAO;CAAM,MAAM;AAAM;AAChE,MAAM,UAAiB;CAAE,MAAA;CAAc,OAAO;CAAK,MAAM;AAAK;AAE9D,MAAM,SAAS,GAAU,GAAU,SAA2B;CAC5D,MAAM,QAAQ,IAAI,WAAW,SAAS;CACtC,KAAK,IAAI,IAAI,GAAG,IAAI,WAAW,KAAK,MAAM,KAAK,EAAE,MAAM,KAAK,EAAE,MAAM;CACpE,OAAO;EAAE;EAAM;EAAO,MAAM,EAAE,QAAQ,EAAE;CAAK;AAC/C;AAEA,MAAM,YAAY,GAAU,SAA4B,EAAE,SAAS,OAAO,IAAI;CAAE,GAAG;CAAG;AAAK;AAE3F,MAAM,cAAc,MAAuB,KAAK,MAAM,KAAK,KAAK,IAAI,KAAK;AACzE,MAAM,cAAc,MAAuB,KAAK,MAAM,KAAK,MAAM,IAAI,KAAK;AAE1E,MAAM,WAAW,OAA8B,OAAA,MAAoC;CACjF,MAAM,QAAQ,IAAI,WAAW,SAAS;CACtC,IAAI,OAAO;CACX,KAAK,MAAM,KAAK,OACd,IAAI,IAAI,WAAW,MAAM,KAAK;MACzB,OAAO;CAEd,OAAO;EAAE;EAAM;EAAO;CAAK;AAC7B;AAEA,IAAa,YAAb,MAAuB;CAEA;CADrB,uBAAwB,IAAI,IAAmC;CAC/D,YAAY,MAA0B;EAAjB,KAAA,OAAA;CAAkB;CAEvC,GAAG,GAAsB;EACvB,IAAI,KAAK,SAAS,GAAG,OAAO;EAC5B,IAAI,KAAK,KAAK,IAAI,CAAC,GAAG,OAAO,KAAK,KAAK,IAAI,CAAC,KAAK;EACjD,KAAK,KAAK,IAAI,GAAG,KAAA,CAAS;EAC1B,MAAM,IAAI,KAAK,QAAQ,OAAO,CAAC,CAAC;EAChC,KAAK,KAAK,IAAI,GAAG,CAAC;EAClB,OAAO;CACT;;CAGA,SAAiB,KAAc,KAAgC,MAAgC;EAC7F,IAAI,QAAQ,KAAA,KAAa,eAAe,GAAG,MAAM,GAAG;GAClD,IAAI,KAAK,SAAS,GAAG,OAAO;IAAE;IAAM,OAAO,IAAI;IAAO,MAAM;GAAM;GAClE,OAAO;IAAE;IAAM,OAAO,IAAI;IAAO,MAAM,aAAa,KAAK,SAAS;GAAE;EACtE;EACA,IAAI,IAAI,SAAS,GAAG,OAAO,KAAA;EAC3B,MAAM,OAAO,UAAU,GAAG;EAC1B,IAAI,SAAS,GAAG,OAAO,KAAA;EACvB,MAAM,QAAQ,IAAI,MAAM,MAAM;EAE9B,IAAI,OAAO,WAAW,MAAM,KAAK,aAAa,KAAK,IAAI,IAAI,IAAI,GAAG,IAAI;EACtE,OAAO;GAAE;GAAM;GAAO,MAAM;EAAM;CACpC;CAEA,QAAgB,MAAmB;EACjC,MAAM,OAAO,KAAK;EAClB,QAAQ,KAAK,MAAb;GACE,KAAK;GACL,KAAK;GACL,KAAK;GACL,KAAK;GACL,KAAK,OACH,OAAO;GACT,KAAK,QACH,OAAO,KAAK,SAAS,cAAc,UAAU;GAC/C,KAAK,OACH,OAAO,KAAK,aAAa,KAAA,KAAa,eAAe,KAAK,QAAQ,MAAM,OAAO,UAAU;GAC3F,KAAK,QACH,OAAO,KAAK,UAAU,IAAI,gBAAgB;GAC5C,KAAK,WAAW;IACd,MAAM,MAAM,KAAK;IACjB,IAAI,KAAK,aAAa,KAAA,GAAW;KAC/B,IAAI,eAAe,KAAK,QAAQ,MAAM,MAAM,OAAO;KACnD,IAAI,KAAK,UAAU,OAAO,IAAI,WAAW,IAAI,UAAU;KACvD,MAAM,UAAU,KAAK,SAAS,OAAO,GAAa;KAClD,IAAI,QAAQ,WAAW,GAAG,OAAO;KACjC,OAAO,QAAQ,CAAC,UAAU,SAAS,OAAO,IAAI,QAAQ,WAAW,CAAC,IAAI,QAAQ,EAAE,CAAC;IACnF;IACA,IAAI,IAAI,WAAW,GAAG,OAAO;IAC7B,IAAI;IACJ,IAAI,UAAU,SAAS,GAAG,GACxB,QAAQ,SAAS,IAAI,IAAI,WAAW,CAAC,IAAI,IAAI,YAAY,CAAC,CAAC,OAAO,GAAG,CAAC,CAAC;SAClE,IAAI,eAAe,cAAc,SAAS,GAC/C,QAAQ,IAAI;SAEZ,OAAO;IAET,OAAO,QAAQ,KAAK,WAAW;KAAC;KAAO,WAAW,KAAK;KAAG,WAAW,KAAK;IAAC,IAAI,CAAC,KAAK,CAAC;GACxF;GACA,KAAK;GACL,KAAK,aAAa;IAChB,IAAI,KAAK,aAAa,KAAA,KAAa,eAAe,KAAK,QAAQ,MAAM,MAAM,OAAO;IAClF,MAAM,MAAM,KAAK,SAAS,UAAU,IAAI,KAAK;IAC7C,IAAI,KAAK,SAAS,eAAe,KAAK,QAAQ,GAAG,OAAO;IACxD,MAAM,OAAO,MAAM,IAAA,IAAa;IAChC,IAAI,KAAK,QAAQ,OAAO,SAAA,IAAkB,UAAU,SAAS,SAAS,QAAQ;IAC9E,MAAM,MAAM,KAAK,aAAa,KAAA,IAAY,SAAS,KAAK,KAAK,IAAI,IAAI,QAAQ,KAAK,GAAG;IACrF,OAAO,KAAK,SAAS,KAAK,KAAK,UAAU,IAAI,MAAM,SAAA,IAAkB,UAAU;GACjF;GACA,KAAK;GACL,KAAK;GACL,KAAK;GACL,KAAK;GACL,KAAK;GACL,KAAK;GACL,KAAK;GACL,KAAK;GACL,KAAK;GACL,KAAK;GACL,KAAK;GACL,KAAK;GACL,KAAK;GACL,KAAK;GACL,KAAK;GACL,KAAK;GACL,KAAK;GACL,KAAK;GACL,KAAK,cACH,OAAO,KAAK,GAAG,KAAK,IAAI;GAC1B,KAAK;GACL,KAAK;GACL,KAAK,YAAY;IACf,MAAM,IAAI,KAAK,GAAG,KAAK,SAAS,aAAa,KAAK,WAAW,KAAK,IAAI;IACtE,OAAO,EAAE,SAAA,IAAkB,IAAI;GACjC;GACA,KAAK,QAAQ;IACX,MAAM,IAAI,KAAK,GAAG,KAAK,IAAI;IAC3B,OAAO,KAAK,SAAS,cAAe,EAAE,SAAS,UAAU,IAAI,UAAW;GAC1E;GACA,KAAK;GACL,KAAK,iBAAiB;IACpB,MAAM,IAAI,KAAK,GAAG,KAAK,IAAI;IAC3B,OAAO,EAAE,SAAS,UAAU,IAAI,SAAS,GAAG,QAAQ;GACtD;GACA,KAAK;GACL,KAAK,UACH,OAAO,KAAK,SAAS,KAAK,OAAO;GACnC,KAAK,WACH,OAAO,KAAK,SAAS,CAAC,KAAK,MAAM,KAAK,IAAI,CAAC;GAC7C,KAAK,OAAO;IACV,IAAI,KAAK,QAAQ,WAAW,GAAG,OAAO;IACtC,IAAI;IACJ,IAAI,OAAA;IACJ,KAAK,MAAM,KAAK,KAAK,SAAS;KAC5B,MAAM,IAAI,KAAK,GAAG,CAAC;KACnB,IAAI,EAAE,SAAS,SAAS,OAAO;KAC/B,IAAI,EAAE,SAAS,UAAU,OAAO;KAChC,MAAM,QAAQ,KAAA,IAAY,IAAI,MAAM,KAAK,GAAG,IAAI;IAClD;IACA,OAAO,QAAQ,KAAA,IAAY,UAAU,SAAS,KAAK,IAAI;GACzD;GACA,KAAK;GACL,KAAK;GACL,KAAK,aAAa;IAChB,IAAI,KAAK,QAAQ,GAAG,OAAO;IAC3B,MAAM,IAAI,KAAK,GAAG,KAAK,IAAI;IAC3B,IAAI,EAAE,SAAA,GAAiB,OAAO;IAC9B,OAAO,KAAK,QAAQ,IAAI,SAAS,GAAG,QAAQ,IAAI;GAClD;GACA,KAAK,WACH,OAAO,KAAK,GAAG,KAAK,QAAQ,CAAC;GAC/B,SACE,OAAO;EACX;CACF;CAEA,SAAiB,SAA2C;EAC1D,IAAI;EACJ,KAAK,MAAM,KAAK,SAAS;GACvB,MAAM,IAAI,KAAK,GAAG,CAAC;GACnB,IAAI,EAAE,SAAS,SAAS,OAAO;GAC/B,MAAM,QAAQ,KAAA,IAAY,IAAI,MAAM,KAAK,GAAG,EAAE,IAAI;GAClD,IAAI,EAAE,SAAA,GAAiB,OAAO;EAChC;EACA,OAAO,OAAO;CAChB;AACF;AAeA,MAAa,WAAW,WAAsD;CAC5E,MAAM,IAAI,OAAO;CACjB,IAAI,IAAI,KAAK,IAAI,IAAI,OAAO,KAAA;CAC5B,MAAM,QAAsC,CAAC;CAC7C,MAAM,wBAAQ,IAAI,IAAoB;CACtC,MAAM,UAAU,SAAwC;EACtD,MAAM,OAAsB,CAAC;EAC7B,KAAK,IAAI,IAAI,GAAG,IAAI,GAAG,KAAK,IAAI,KAAK,OAAO,EAAE,GAAG,KAAK,KAAK,CAAC;EAC5D,MAAM,MAAM,KAAK,KAAK,GAAG;EACzB,IAAI,IAAI,MAAM,IAAI,GAAG;EACrB,IAAI,MAAM,KAAA,GAAW;GACnB,IAAI,MAAM;GACV,MAAM,KAAK,IAAI;GACf,MAAM,IAAI,KAAK,CAAC;EAClB;EACA,OAAO;CACT;CACA,MAAM,SAAS,IAAI,WAAW,SAAS;CACvC,KAAK,IAAI,IAAI,GAAG,IAAI,WAAW,KAAK,OAAO,KAAK,QAAQ,MAAM,EAAE,SAAA,KAAmB,EAAE,MAAM,OAAO,CAAC;CACnG,MAAM,OAAO,QAAQ,MAAM,EAAE,SAAA,KAAmB,EAAE,IAAI;CACtD,MAAM,MAAM,QAAQ,MAAM,EAAE,SAAA,CAAe;CAC3C,IAAI,MAAM,WAAW,KAAK,MAAM,EAAE,CAAC,WAAW,GAAG,OAAO,KAAA;CACxD,IAAI,MAAM,SAAS,KAAK,OAAO,KAAA;CAC/B,OAAO;EAAE;EAAQ;EAAM;EAAK;CAAM;AACpC"}

package/dist/internal/compiler/jit.d.ts

@@ -1,20 +1,9 @@
-import type { ParserLike } from "../node.js";
-import type { Fallback, Step } from "./closure.js";
+import { Backend } from "./registry.js";
+//#region src/internal/compiler/jit.d.ts
 /**
- * Whether `new Function` works here (it doesn't under a Content Security
- * Policy). Checked once, and again if `globalThis.Function` is replaced.
+ * The JIT as a backend: generated code where `new Function` is allowed,
+ * otherwise (or if generating fails) the closure compiler.
  */
-export declare const jitSupported: () => boolean;
-/** Generates the source of a compiled parser, without building it. */
-export declare const generate: (root: ParserLike, kind: 0 | 1 | 2, resumable?: boolean) => {
-    readonly source: string;
-    readonly constants: ReadonlyArray<unknown>;
-    readonly fallbacks: ReadonlyArray<Fallback>;
-};
-/** Compiles a root parser for one input kind with `new Function`. */
-export declare const compileJit: (root: ParserLike, kind: 0 | 1 | 2, resumable?: boolean) => {
-    readonly step: Step;
-    readonly fallbacks: ReadonlyArray<Fallback>;
-    readonly source: string;
-};
+export declare const backend: Backend;
+//#endregion
 //# sourceMappingURL=jit.d.ts.map

package/dist/internal/compiler/jit.d.ts.map

@@ -1 +1 @@
-{"version":3,"file":"jit.d.ts","sourceRoot":"","sources":["../../../src/internal/compiler/jit.ts"],"names":[],"mappings":"AAoBA,OAAO,KAAK,EAAgB,UAAU,EAAE,MAAM,YAAY,CAAA;AAM1D,OAAO,KAAK,EAAmB,QAAQ,EAAE,IAAI,EAAE,MAAM,cAAc,CAAA;AAyCnE;;;GAGG;AACH,eAAO,MAAM,YAAY,QAAO,OAU/B,CAAA;AAq9BD,sEAAsE;AACtE,eAAO,MAAM,QAAQ,SAAU,UAAU,QAAQ,CAAC,GAAG,CAAC,GAAG,CAAC,0BAAsB;IAC9E,QAAQ,CAAC,MAAM,EAAE,MAAM,CAAA;IACvB,QAAQ,CAAC,SAAS,EAAE,aAAa,CAAC,OAAO,CAAC,CAAA;IAC1C,QAAQ,CAAC,SAAS,EAAE,aAAa,CAAC,QAAQ,CAAC,CAAA;CAQ5C,CAAA;AAED,qEAAqE;AACrE,eAAO,MAAM,UAAU,SAAU,UAAU,QAAQ,CAAC,GAAG,CAAC,GAAG,CAAC,0BAAsB;IAChF,QAAQ,CAAC,IAAI,EAAE,IAAI,CAAA;IACnB,QAAQ,CAAC,SAAS,EAAE,aAAa,CAAC,QAAQ,CAAC,CAAA;IAC3C,QAAQ,CAAC,MAAM,EAAE,MAAM,CAAA;CAUxB,CAAA"}
+{"version":3,"file":"jit.d.ts","names":[],"sources":["../../../src/internal/compiler/jit.ts"],"mappings":";;;;;;qBAkwCa,SAAS"}