effect-grammar 0.4.0 → 0.5.0

package/dist/codec.d.ts.map

@@ -0,0 +1 @@
+{"version":3,"file":"codec.d.ts","sourceRoot":"","sources":["../src/codec.ts"],"names":[],"mappings":"AAAA,OAAO,EAAU,KAAK,MAAM,EAAE,MAAM,EAAqC,MAAM,QAAQ,CAAA;AAEvF,OAAO,KAAK,EAAE,eAAe,EAAS,MAAM,WAAW,CAAA;AAEvD,OAAO,EAAE,UAAU,EAAE,MAAM,aAAa,CAAA;AAUxC,MAAM,WAAW,YAAY;IAC3B,QAAQ,CAAC,UAAU,CAAC,EAAE,MAAM,CAAA;IAC5B;;;;;OAKG;IACH,QAAQ,CAAC,SAAS,CAAC,EAAE,QAAQ,GAAG,KAAK,CAAA;CACtC;AAED,eAAO,MAAM,SAAS,GAAI,CAAC,EAAE,CAAC,SAAS,MAAM,CAAC,GAAG,UACvC,MAAM,CAAC,KAAK,CAAC,CAAC,CAAC,UACf,CAAC,WACA,eAAe,cACZ,MAAM,GAAG,SAAS,SACvB,CAAC,KAAK,EAAE,CAAC,KAAK,MAAM,CAAC,MAAM,CAAC,CAAC,CAAC,SAAS,CAAC,EAAE;IAAE,QAAQ,CAAC,OAAO,EAAE,MAAM,CAAA;CAAE,CAAC,SACvE,CAAC,KAAK,EAAE,CAAC,CAAC,SAAS,CAAC,KAAK,MAAM,CAAC,MAAM,CAAC,CAAC,EAAE,UAAU,CAAC,uEAiB3D,CAAA"}

package/dist/codec.js

@@ -0,0 +1,14 @@
+import { Effect, Schema, SchemaIssue, SchemaTransformation } from "effect";
+import { PrintError } from "./errors.js";
+import { render } from "./render.js";
+const printIssueToSchema = (actual, issue) => {
+    if (issue._tag === "AtPath") {
+        return new SchemaIssue.Pointer([issue.path], printIssueToSchema(actual, issue.issue));
+    }
+    return new SchemaIssue.InvalidValue({ message: PrintError.format(issue) }, actual);
+};
+export const codecFrom = (source, target, grammar, identifier, parse, print) => source.pipe(Schema.decodeTo(target, SchemaTransformation.transformOrFail({
+    decode: (input) => Effect.fromResult(parse(input)).pipe(Effect.mapError(({ message }) => new SchemaIssue.InvalidValue({ message }, input))),
+    encode: (value) => Effect.fromResult(print(value)).pipe(Effect.mapError((error) => printIssueToSchema(value, error.issue))),
+})), Schema.annotate({ identifier, description: render(grammar) }));
+//# sourceMappingURL=codec.js.map

package/dist/codec.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"codec.js","sourceRoot":"","sources":["../src/codec.ts"],"names":[],"mappings":"AAAA,OAAO,EAAE,MAAM,EAAe,MAAM,EAAE,WAAW,EAAE,oBAAoB,EAAE,MAAM,QAAQ,CAAA;AAIvF,OAAO,EAAE,UAAU,EAAE,MAAM,aAAa,CAAA;AACxC,OAAO,EAAE,MAAM,EAAE,MAAM,aAAa,CAAA;AAEpC,MAAM,kBAAkB,GAAG,CAAC,MAAa,EAAE,KAAiB,EAAqB,EAAE;IACjF,IAAI,KAAK,CAAC,IAAI,KAAK,QAAQ,EAAE,CAAC;QAC5B,OAAO,IAAI,WAAW,CAAC,OAAO,CAAC,CAAC,KAAK,CAAC,IAAI,CAAC,EAAE,kBAAkB,CAAC,MAAM,EAAE,KAAK,CAAC,KAAK,CAAC,CAAC,CAAA;IACvF,CAAC;IACD,OAAO,IAAI,WAAW,CAAC,YAAY,CAAC,EAAE,OAAO,EAAE,UAAU,CAAC,MAAM,CAAC,KAAK,CAAC,EAAE,EAAE,MAAM,CAAC,CAAA;AACpF,CAAC,CAAA;AAaD,MAAM,CAAC,MAAM,SAAS,GAAG,CACvB,MAAuB,EACvB,MAAS,EACT,OAAwB,EACxB,UAA8B,EAC9B,KAA8E,EAC9E,KAA4D,EAC5D,EAAE,CACF,MAAM,CAAC,IAAI,CACT,MAAM,CAAC,QAAQ,CACb,MAAM,EACN,oBAAoB,CAAC,eAAe,CAAkB;IACpD,MAAM,EAAE,CAAC,KAAK,EAAE,EAAE,CAChB,MAAM,CAAC,UAAU,CAAC,KAAK,CAAC,KAAK,CAAC,CAAC,CAAC,IAAI,CAClC,MAAM,CAAC,QAAQ,CAAC,CAAC,EAAE,OAAO,EAAE,EAAE,EAAE,CAAC,IAAI,WAAW,CAAC,YAAY,CAAC,EAAE,OAAO,EAAE,EAAE,KAAK,CAAC,CAAC,CACnF;IACH,MAAM,EAAE,CAAC,KAAK,EAAE,EAAE,CAChB,MAAM,CAAC,UAAU,CAAC,KAAK,CAAC,KAAK,CAAC,CAAC,CAAC,IAAI,CAClC,MAAM,CAAC,QAAQ,CAAC,CAAC,KAAK,EAAE,EAAE,CAAC,kBAAkB,CAAC,KAAK,EAAE,KAAK,CAAC,KAAK,CAAC,CAAC,CACnE;CACJ,CAAC,CACH,EACD,MAAM,CAAC,QAAQ,CAAC,EAAE,UAAU,EAAE,WAAW,EAAE,MAAM,CAAC,OAAO,CAAC,EAAE,CAAC,CAC9D,CAAA"}

package/dist/combinators.d.ts

@@ -1,22 +1,39 @@
-import { Result, Schema } from "effect";
+import { Result, Schema, type Types } from "effect";
 import { type Grammar, type GrammarInternal, type GrammarIssue, type MatchKey, type Ref, type Silent, type Type } from "./core.ts";
 export { gen, type GenGrammar, get, seq } from "./gen.ts";
 export declare const literal: (value: string) => Silent;
 export declare const empty: Silent;
+/**
+ * Match at the parser's current cursor using JavaScript `RegExp` semantics.
+ * Parsing uses a fresh sticky matcher against the original full input; printing
+ * requires the supplied string to match in full. `g`, `y`, and the caller's
+ * `lastIndex` are ignored, and the caller's expression is never mutated.
+ */
 export declare const regex: (expression: RegExp, name: string) => Grammar<string>;
 type PreserveGrammar<G extends GrammarInternal> = G extends Silent ? Silent : G extends Grammar<infer A> ? Grammar<A> : never;
 type OptionalGrammar<G extends GrammarInternal> = G extends Silent ? Silent : G extends Grammar<infer A> ? Grammar<A | undefined> : never;
 export declare function between(open: Silent | string, close: Silent | string): <G extends GrammarInternal>(inner: G) => PreserveGrammar<G>;
 export declare function between(open: Silent | string, inner: Silent, close: Silent | string): Silent;
 export declare function between<A>(open: Silent | string, inner: Grammar<A>, close: Silent | string): Grammar<A>;
-export declare const wrap: typeof between;
 export declare function prefix(open: Silent | string): <G extends GrammarInternal>(inner: G) => PreserveGrammar<G>;
 export declare function prefix(open: Silent | string, inner: Silent): Silent;
 export declare function prefix<A>(open: Silent | string, inner: Grammar<A>): Grammar<A>;
 export declare function suffix(close: Silent | string): <G extends GrammarInternal>(inner: G) => PreserveGrammar<G>;
 export declare function suffix(inner: Silent, close: Silent | string): Silent;
 export declare function suffix<A>(inner: Grammar<A>, close: Silent | string): Grammar<A>;
+/**
+ * Ordered alternatives. Parsing tries each branch in order and keeps the
+ * first that matches. Printing keeps the first branch whose printer accepts
+ * the value; use `checkedChoice` to keep the first branch whose text also
+ * parses back.
+ */
 export declare const choice: <const Grammars extends readonly [GrammarInternal, ...Array<GrammarInternal>]>(...options: Grammars) => Grammar<Type<Grammars[number]>>;
+/**
+ * {@link choice} whose printer selects the first branch that reads back to an
+ * equal value. Each checked choice reparses its candidate output; nesting can
+ * multiply that work, so keep it off hot paths.
+ */
+export declare const checkedChoice: <const Grammars extends readonly [GrammarInternal, ...Array<GrammarInternal>]>(...options: Grammars) => Grammar<Type<Grammars[number]>>;
 export declare function optional(): <G extends GrammarInternal>(inner: G) => OptionalGrammar<G>;
 export declare function optional(inner: Silent): Silent;
 export declare function optional<A>(inner: Grammar<A>): Grammar<A | undefined>;
@@ -24,10 +41,12 @@ export interface RepeatOptions {
     readonly min?: number;
     readonly max?: number;
 }
+/** Repeat an item within bounds. Each successful parse must consume input. */
 export declare const many: {
     <A>(inner: Grammar<A>, options?: RepeatOptions): Grammar<ReadonlyArray<A>>;
     (options?: RepeatOptions): <A>(inner: Grammar<A>) => Grammar<ReadonlyArray<A>>;
 };
+/** Repeat an item with a silent separator. Each successful item parse must consume input. */
 export declare const sepBy: {
     <A>(inner: Grammar<A>, separator: Silent | string, options?: RepeatOptions): Grammar<ReadonlyArray<A>>;
     (separator: Silent | string, options?: RepeatOptions): <A>(inner: Grammar<A>) => Grammar<ReadonlyArray<A>>;
@@ -38,10 +57,12 @@ export declare const match: <K extends string, const Cases extends Readonly<Reco
 type EntryOutput<Entries extends ReadonlyArray<readonly [MatchKey, GrammarInternal]>> = Type<Entries[number][1]>;
 type CompleteEntries<K extends MatchKey, Entries extends ReadonlyArray<readonly [MatchKey, GrammarInternal]>> = Exclude<K, Entries[number][0]> extends never ? Entries : never;
 export declare const matchValue: <K extends MatchKey, const Entries extends ReadonlyArray<readonly [K, GrammarInternal]>>(scrutinee: Ref<K>, entries: CompleteEntries<K, Entries>) => Grammar<EntryOutput<Entries>>;
-export declare const take: (count: Ref<number>) => Grammar<string>;
+export declare const take: (count: Ref<number> | number) => Grammar<string>;
+export declare const takeBytes: (count: Ref<number> | number, name?: string) => Grammar<string>;
+/** Repeat an item a constant or bound number of times. Each successful parse must consume input. */
 export declare const repeat: {
-    <A>(inner: Grammar<A>, count: Ref<number>): Grammar<ReadonlyArray<A>>;
-    (count: Ref<number>): <A>(inner: Grammar<A>) => Grammar<ReadonlyArray<A>>;
+    <A>(inner: Grammar<A>, count: Ref<number> | number): Grammar<ReadonlyArray<A>>;
+    (count: Ref<number> | number): <A>(inner: Grammar<A>) => Grammar<ReadonlyArray<A>>;
 };
 export interface TransformOptions<A, B> {
     readonly decode: (a: A) => B;
@@ -49,6 +70,11 @@ export interface TransformOptions<A, B> {
     readonly is?: (value: B) => boolean;
     readonly name?: string;
 }
+/**
+ * Map a grammar's value with a pair of functions. No law is claimed: the
+ * two directions need not be inverse, so a value may print as text that
+ * parses back to something else. Use `iso` when you mean to claim inverses.
+ */
 export declare const transform: {
     <A, B>(options: TransformOptions<A, B>): (inner: Grammar<A>) => Grammar<B>;
     <A, B>(inner: Grammar<A>, options: TransformOptions<A, B>): Grammar<B>;
@@ -59,10 +85,31 @@ export interface TransformOrFailOptions<A, B> {
     readonly is?: (value: B) => boolean;
     readonly name?: string;
 }
+/** {@link transform} with directions that return a `Result`. No law is claimed. */
 export declare const transformOrFail: {
     <A, B>(options: TransformOrFailOptions<A, B>): (inner: Grammar<A>) => Grammar<B>;
     <A, B>(inner: Grammar<A>, options: TransformOrFailOptions<A, B>): Grammar<B>;
 };
+/**
+ * Like {@link transform}, but the author claims the two directions are
+ * inverse. The claim is recorded, not proved; `Grammar.auditFidelity` reports
+ * only the transforms that make no such claim.
+ */
+export declare const iso: {
+    <A, B>(options: TransformOptions<A, B>): (inner: Grammar<A>) => Grammar<B>;
+    <A, B>(inner: Grammar<A>, options: TransformOptions<A, B>): Grammar<B>;
+};
+/** An {@link iso} whose two directions may each fail; they must agree where both succeed. */
+export declare const partialIso: {
+    <A, B>(options: TransformOrFailOptions<A, B>): (inner: Grammar<A>) => Grammar<B>;
+    <A, B>(inner: Grammar<A>, options: TransformOrFailOptions<A, B>): Grammar<B>;
+};
+export declare const filter: {
+    <A, B extends A>(refinement: (value: A) => value is B, name: string): (inner: Grammar<A>) => Grammar<B>;
+    <A>(predicate: (value: A) => boolean, name: string): (inner: Grammar<A>) => Grammar<A>;
+    <A, B extends A>(inner: Grammar<A>, refinement: (value: A) => value is B, name: string): Grammar<B>;
+    <A>(inner: Grammar<A>, predicate: (value: A) => boolean, name: string): Grammar<A>;
+};
 export interface DecodeToOptions<A, T> extends Omit<TransformOptions<A, T>, "is"> {
     readonly is?: ((value: T) => boolean) | undefined;
 }
@@ -71,6 +118,12 @@ export declare const as: {
     <const V>(value: V): (inner: Silent) => Grammar<V>;
     <const V>(inner: Silent, value: V): Grammar<V>;
 };
+/**
+ * String alternatives whose value is the matched string. Longer strings are
+ * tried first whatever order they are listed in, so a string is never shadowed
+ * by one of its own prefixes; strings of equal length keep their listed order.
+ */
+export declare const literals: <const Values extends readonly [string, ...Array<string>]>(...values: Values) => Grammar<Values[number]>;
 export declare const flag: (value: Silent | string) => Grammar<boolean>;
 export declare const skip: {
     <A>(printAs: A): (inner: Grammar<A>) => Silent;
@@ -80,7 +133,18 @@ export declare const label: {
     (name: string): <A>(inner: Grammar<A>) => Grammar<A>;
     <A>(inner: Grammar<A>, name: string): Grammar<A>;
 };
+/**
+ * Defer a grammar for recursive definitions. The thunk runs on first resolution
+ * and its result is cached. Parsing rejects recursion at the same input position;
+ * printing rejects recursion that reaches the same suspension without consuming
+ * a value, so recursive definitions must be productive.
+ */
 export declare const suspend: <A>(thunk: () => Grammar<A>, name?: string) => Grammar<A>;
+/**
+ * Replace an absent (`undefined`) inner value when parsing, and omit a value
+ * equal to the default when printing. Parsing leaves every other value,
+ * including `null`, unchanged.
+ */
 export declare const defaulted: {
     <A>(value: A): (inner: Grammar<A | undefined>) => Grammar<A>;
     <A>(inner: Grammar<A | undefined>, value: A): Grammar<A>;
@@ -89,17 +153,59 @@ type StructFields = Readonly<Record<string, GrammarInternal>>;
 type StructValue<Fields extends StructFields> = {
     readonly [K in keyof Fields]: Type<Fields[K]>;
 };
+/**
+ * Sequence fields and return an object. Printing requires exactly these own
+ * keys: missing, extra, and symbol keys are rejected.
+ */
 export declare const struct: <const Fields extends StructFields>(fields: Fields) => Grammar<StructValue<Fields>>;
+export declare const withKeys: <A>(grammar: Grammar<A>, keys: ReadonlyArray<string> | undefined) => Grammar<A>;
+type MergeValue<Parts extends ReadonlyArray<GrammarInternal>> = Types.UnionToIntersection<{
+    [K in keyof Parts]: {
+        readonly value: Type<Parts[K]>;
+    };
+}[number]> extends {
+    readonly value: infer Value;
+} ? Types.Simplify<Value> : never;
+export declare const merge: <const Parts extends readonly [GrammarInternal, ...Array<GrammarInternal>]>(...grammars: Parts) => Grammar<MergeValue<Parts>>;
+export declare const prefixedBy: (length: Grammar<number>, take: (length: Ref<number>) => Grammar<string>) => Grammar<string>;
+export declare const lengthPrefixed: (length: Grammar<number>) => Grammar<string>;
+export declare const countPrefixed: {
+    <A>(item: Grammar<A>, count: Grammar<number>): Grammar<ReadonlyArray<A>>;
+    (count: Grammar<number>): <A>(item: Grammar<A>) => Grammar<ReadonlyArray<A>>;
+};
 type TupleValue<Elements extends ReadonlyArray<GrammarInternal>> = {
     readonly [K in keyof Elements]: Type<Elements[K]>;
 };
 export declare const tuple: <const Elements extends ReadonlyArray<GrammarInternal>>(...elements: Elements) => Grammar<TupleValue<Elements>>;
+type OnCases<Tag extends string, Cases extends Readonly<Record<string, GrammarInternal>>> = {
+    readonly [K in keyof Cases & string]: Type<Cases[K]> extends Readonly<Record<Tag, K>> ? Cases[K] : Grammar<Readonly<Record<Tag, K>>>;
+};
+type OnEntries<Tag extends string, Entries extends ReadonlyArray<readonly [MatchKey, GrammarInternal]>> = {
+    readonly [I in keyof Entries]: Entries[I] extends readonly [infer K extends MatchKey, unknown] ? Type<Entries[I][1]> extends Readonly<Record<Tag, K>> ? Entries[I] : readonly [K, Grammar<Readonly<Record<Tag, K>>>] : never;
+};
+/**
+ * Alternatives dispatched by a discriminant field. Parsing tries the branches
+ * in order; printing reads `value[tag]` and prints with the branch of that key,
+ * so it never picks the wrong printer. It does not remove parse ambiguity: two
+ * branches may still parse the same text.
+ *
+ * The cases are an object keyed by the tag's string values. Integer-like keys
+ * are rejected, since JavaScript reorders them; use `choiceOnEntries` for
+ * those, and for number or boolean discriminants.
+ */
+export declare const choiceOn: <const Tag extends string, const Cases extends Readonly<Record<string, GrammarInternal>>>(tag: Tag, cases: Cases & OnCases<Tag, Cases>) => Grammar<Type<Cases[keyof Cases]>>;
+/**
+ * `choiceOn` with the cases as an array of `[key, grammar]` entries: the parse
+ * order is the array order, and keys may be numbers or booleans as well as
+ * strings.
+ */
+export declare const choiceOnEntries: <const Tag extends string, const Entries extends ReadonlyArray<readonly [MatchKey, GrammarInternal]>>(tag: Tag, entries: Entries & OnEntries<Tag, Entries>) => Grammar<Type<Entries[number][1]>>;
 type TaggedValue<Tag extends string, Cases extends Readonly<Record<string, GrammarInternal>>> = {
     readonly [K in keyof Cases & string]: Readonly<Record<Tag, K>> & {
         readonly value: Type<Cases[K]>;
     };
 }[keyof Cases & string];
-export declare const taggedChoice: <const Tag extends string, const Cases extends Readonly<Record<string, GrammarInternal>>>(tag: Tag, cases: Cases) => Grammar<TaggedValue<Tag, Cases>>;
+export declare const taggedChoice: <const Tag extends string, const Cases extends Readonly<Record<string, GrammarInternal>>>(tag: Tag extends "value" ? never : Tag, cases: Cases) => Grammar<TaggedValue<Tag, Cases>>;
 export declare const trivia: Silent;
 export declare const space: Silent;
 export declare const spaces: Silent;

package/dist/combinators.d.ts.map

@@ -1 +1 @@
-{"version":3,"file":"combinators.d.ts","sourceRoot":"","sources":["../src/combinators.ts"],"names":[],"mappings":"AAAA,OAAO,EAAmC,MAAM,EAAE,MAAM,EAAE,MAAM,QAAQ,CAAA;AAExE,OAAO,EAEL,KAAK,OAAO,EACZ,KAAK,eAAe,EACpB,KAAK,YAAY,EAIjB,KAAK,QAAQ,EAEb,KAAK,GAAG,EAER,KAAK,MAAM,EAEX,KAAK,IAAI,EACV,MAAM,WAAW,CAAA;AAKlB,OAAO,EAAE,GAAG,EAAE,KAAK,UAAU,EAAE,GAAG,EAAE,GAAG,EAAE,MAAM,UAAU,CAAA;AAEzD,eAAO,MAAM,OAAO,UAAW,MAAM,KAAG,MAA4C,CAAA;AAEpF,eAAO,MAAM,KAAK,QAAc,CAAA;AAEhC,eAAO,MAAM,KAAK,eAAgB,MAAM,QAAQ,MAAM,KAAG,OAAO,CAAC,MAAM,CAGtE,CAAA;AAUD,KAAK,eAAe,CAAC,CAAC,SAAS,eAAe,IAAI,CAAC,SAAS,MAAM,GAC9D,MAAM,GACN,CAAC,SAAS,OAAO,CAAC,MAAM,CAAC,CAAC,GACxB,OAAO,CAAC,CAAC,CAAC,GACV,KAAK,CAAA;AAEX,KAAK,eAAe,CAAC,CAAC,SAAS,eAAe,IAAI,CAAC,SAAS,MAAM,GAC9D,MAAM,GACN,CAAC,SAAS,OAAO,CAAC,MAAM,CAAC,CAAC,GACxB,OAAO,CAAC,CAAC,GAAG,SAAS,CAAC,GACtB,KAAK,CAAA;AAEX,wBAAgB,OAAO,CACrB,IAAI,EAAE,MAAM,GAAG,MAAM,EACrB,KAAK,EAAE,MAAM,GAAG,MAAM,GACrB,CAAC,CAAC,SAAS,eAAe,EAAE,KAAK,EAAE,CAAC,KAAK,eAAe,CAAC,CAAC,CAAC,CAAA;AAC9D,wBAAgB,OAAO,CAAC,IAAI,EAAE,MAAM,GAAG,MAAM,EAAE,KAAK,EAAE,MAAM,EAAE,KAAK,EAAE,MAAM,GAAG,MAAM,GAAG,MAAM,CAAA;AAC7F,wBAAgB,OAAO,CAAC,CAAC,EACvB,IAAI,EAAE,MAAM,GAAG,MAAM,EACrB,KAAK,EAAE,OAAO,CAAC,CAAC,CAAC,EACjB,KAAK,EAAE,MAAM,GAAG,MAAM,GACrB,OAAO,CAAC,CAAC,CAAC,CAAA;AAqBb,eAAO,MAAM,IAAI,gBAAU,CAAA;AAE3B,wBAAgB,MAAM,CACpB,IAAI,EAAE,MAAM,GAAG,MAAM,GACpB,CAAC,CAAC,SAAS,eAAe,EAAE,KAAK,EAAE,CAAC,KAAK,eAAe,CAAC,CAAC,CAAC,CAAA;AAC9D,wBAAgB,MAAM,CAAC,IAAI,EAAE,MAAM,GAAG,MAAM,EAAE,KAAK,EAAE,MAAM,GAAG,MAAM,CAAA;AACpE,wBAAgB,MAAM,CAAC,CAAC,EAAE,IAAI,EAAE,MAAM,GAAG,MAAM,EAAE,KAAK,EAAE,OAAO,CAAC,CAAC,CAAC,GAAG,OAAO,CAAC,CAAC,CAAC,CAAA;AAO/E,wBAAgB,MAAM,CACpB,KAAK,EAAE,MAAM,GAAG,MAAM,GACrB,CAAC,CAAC,SAAS,eAAe,EAAE,KAAK,EAAE,CAAC,KAAK,eAAe,CAAC,CAAC,CAAC,CAAA;AAC9D,wBAAgB,MAAM,CAAC,KAAK,EAAE,MAAM,EAAE,KAAK,EAAE,MAAM,GAAG,MAAM,GAAG,MAAM,CAAA;AACrE,wBAAgB,MAAM,CAAC,CAAC,EAAE,KAAK,EAAE,OAAO,CAAC,CAAC,CAAC,EAAE,KAAK,EAAE,MAAM,GAAG,MAAM,GAAG,OAAO,CAAC,CAAC,CAAC,CAAA;AAUhF,eAAO,MAAM,MAAM,GACjB,KAAK,CAAC,QAAQ,SAAS,SAAS,CAAC,eAAe,EAAE,GAAG,KAAK,CAAC,eAAe,CAAC,CAAC,cAEhE,QAAQ,KACnB,OAAO,CAAC,IAAI,CAAC,QAAQ,CAAC,MAAM,CAAC,CAAC,CAAsC,CAAA;AAEvE,wBAAgB,QAAQ,IAAI,CAAC,CAAC,SAAS,eAAe,EAAE,KAAK,EAAE,CAAC,KAAK,eAAe,CAAC,CAAC,CAAC,CAAA;AACvF,wBAAgB,QAAQ,CAAC,KAAK,EAAE,MAAM,GAAG,MAAM,CAAA;AAC/C,wBAAgB,QAAQ,CAAC,CAAC,EAAE,KAAK,EAAE,OAAO,CAAC,CAAC,CAAC,GAAG,OAAO,CAAC,CAAC,GAAG,SAAS,CAAC,CAAA;AAMtE,MAAM,WAAW,aAAa;IAC5B,QAAQ,CAAC,GAAG,CAAC,EAAE,MAAM,CAAA;IACrB,QAAQ,CAAC,GAAG,CAAC,EAAE,MAAM,CAAA;CACtB;AAsBD,eAAO,MAAM,IAAI,EAAE;IACjB,CAAC,CAAC,EAAE,KAAK,EAAE,OAAO,CAAC,CAAC,CAAC,EAAE,OAAO,CAAC,EAAE,aAAa,GAAG,OAAO,CAAC,aAAa,CAAC,CAAC,CAAC,CAAC,CAAA;IAC1E,CAAC,OAAO,CAAC,EAAE,aAAa,GAAG,CAAC,CAAC,EAAE,KAAK,EAAE,OAAO,CAAC,CAAC,CAAC,KAAK,OAAO,CAAC,aAAa,CAAC,CAAC,CAAC,CAAC,CAAA;CAG/E,CAAA;AAED,eAAO,MAAM,KAAK,EAAE;IAClB,CAAC,CAAC,EACA,KAAK,EAAE,OAAO,CAAC,CAAC,CAAC,EACjB,SAAS,EAAE,MAAM,GAAG,MAAM,EAC1B,OAAO,CAAC,EAAE,aAAa,GACtB,OAAO,CAAC,aAAa,CAAC,CAAC,CAAC,CAAC,CAAA;IAC5B,CACE,SAAS,EAAE,MAAM,GAAG,MAAM,EAC1B,OAAO,CAAC,EAAE,aAAa,GACtB,CAAC,CAAC,EAAE,KAAK,EAAE,OAAO,CAAC,CAAC,CAAC,KAAK,OAAO,CAAC,aAAa,CAAC,CAAC,CAAC,CAAC,CAAA;CAGvD,CAAA;AAED,KAAK,YAAY,CAAC,CAAC,SAAS,MAAM,IAAI,MAAM,SAAS,CAAC,GAAG,KAAK,GAAG,CAAC,CAAA;AAElE,KAAK,UAAU,CAAC,KAAK,IACnB,KAAK,SAAS,QAAQ,CAAC,MAAM,CAAC,WAAW,EAAE,eAAe,CAAC,CAAC,GAAG,IAAI,CAAC,KAAK,CAAC,MAAM,KAAK,CAAC,CAAC,GAAG,KAAK,CAAA;AAEjG,eAAO,MAAM,KAAK,GAAI,CAAC,SAAS,MAAM,EAAE,KAAK,CAAC,KAAK,SAAS,QAAQ,CAAC,MAAM,CAAC,CAAC,EAAE,eAAe,CAAC,CAAC,aACnF,GAAG,CAAC,YAAY,CAAC,CAAC,CAAC,CAAC,SACxB,KAAK,KACX,OAAO,CAAC,UAAU,CAAC,KAAK,CAAC,CAMxB,CAAA;AAEJ,KAAK,WAAW,CAAC,OAAO,SAAS,aAAa,CAAC,SAAS,CAAC,QAAQ,EAAE,eAAe,CAAC,CAAC,IAAI,IAAI,CAC1F,OAAO,CAAC,MAAM,CAAC,CAAC,CAAC,CAAC,CACnB,CAAA;AAED,KAAK,eAAe,CAClB,CAAC,SAAS,QAAQ,EAClB,OAAO,SAAS,aAAa,CAAC,SAAS,CAAC,QAAQ,EAAE,eAAe,CAAC,CAAC,IACjE,OAAO,CAAC,CAAC,EAAE,OAAO,CAAC,MAAM,CAAC,CAAC,CAAC,CAAC,CAAC,SAAS,KAAK,GAAG,OAAO,GAAG,KAAK,CAAA;AAElE,eAAO,MAAM,UAAU,GACrB,CAAC,SAAS,QAAQ,EAClB,KAAK,CAAC,OAAO,SAAS,aAAa,CAAC,SAAS,CAAC,CAAC,EAAE,eAAe,CAAC,CAAC,aAEvD,GAAG,CAAC,CAAC,CAAC,WACR,eAAe,CAAC,CAAC,EAAE,OAAO,CAAC,KACnC,OAAO,CAAC,WAAW,CAAC,OAAO,CAAC,CAK3B,CAAA;AAEJ,eAAO,MAAM,IAAI,UAAW,GAAG,CAAC,MAAM,CAAC,KAAG,OAAO,CAAC,MAAM,CACK,CAAA;AAE7D,eAAO,MAAM,MAAM,EAAE;IACnB,CAAC,CAAC,EAAE,KAAK,EAAE,OAAO,CAAC,CAAC,CAAC,EAAE,KAAK,EAAE,GAAG,CAAC,MAAM,CAAC,GAAG,OAAO,CAAC,aAAa,CAAC,CAAC,CAAC,CAAC,CAAA;IACrE,CAAC,KAAK,EAAE,GAAG,CAAC,MAAM,CAAC,GAAG,CAAC,CAAC,EAAE,KAAK,EAAE,OAAO,CAAC,CAAC,CAAC,KAAK,OAAO,CAAC,aAAa,CAAC,CAAC,CAAC,CAAC,CAAA;CAG1E,CAAA;AAED,MAAM,WAAW,gBAAgB,CAAC,CAAC,EAAE,CAAC;IACpC,QAAQ,CAAC,MAAM,EAAE,CAAC,CAAC,EAAE,CAAC,KAAK,CAAC,CAAA;IAC5B,QAAQ,CAAC,MAAM,EAAE,CAAC,CAAC,EAAE,CAAC,KAAK,CAAC,CAAA;IAC5B,QAAQ,CAAC,EAAE,CAAC,EAAE,CAAC,KAAK,EAAE,CAAC,KAAK,OAAO,CAAA;IACnC,QAAQ,CAAC,IAAI,CAAC,EAAE,MAAM,CAAA;CACvB;AAYD,eAAO,MAAM,SAAS,EAAE;IACtB,CAAC,CAAC,EAAE,CAAC,EAAE,OAAO,EAAE,gBAAgB,CAAC,CAAC,EAAE,CAAC,CAAC,GAAG,CAAC,KAAK,EAAE,OAAO,CAAC,CAAC,CAAC,KAAK,OAAO,CAAC,CAAC,CAAC,CAAA;IAC1E,CAAC,CAAC,EAAE,CAAC,EAAE,KAAK,EAAE,OAAO,CAAC,CAAC,CAAC,EAAE,OAAO,EAAE,gBAAgB,CAAC,CAAC,EAAE,CAAC,CAAC,GAAG,OAAO,CAAC,CAAC,CAAC,CAAA;CAUvE,CAAA;AAED,MAAM,WAAW,sBAAsB,CAAC,CAAC,EAAE,CAAC;IAC1C,QAAQ,CAAC,MAAM,EAAE,CAAC,CAAC,EAAE,CAAC,KAAK,MAAM,CAAC,MAAM,CAAC,CAAC,EAAE,YAAY,CAAC,CAAA;IACzD,QAAQ,CAAC,MAAM,EAAE,CAAC,CAAC,EAAE,CAAC,KAAK,MAAM,CAAC,MAAM,CAAC,CAAC,EAAE,YAAY,CAAC,CAAA;IACzD,QAAQ,CAAC,EAAE,CAAC,EAAE,CAAC,KAAK,EAAE,CAAC,KAAK,OAAO,CAAA;IACnC,QAAQ,CAAC,IAAI,CAAC,EAAE,MAAM,CAAA;CACvB;AAED,eAAO,MAAM,eAAe,EAAE;IAC5B,CAAC,CAAC,EAAE,CAAC,EAAE,OAAO,EAAE,sBAAsB,CAAC,CAAC,EAAE,CAAC,CAAC,GAAG,CAAC,KAAK,EAAE,OAAO,CAAC,CAAC,CAAC,KAAK,OAAO,CAAC,CAAC,CAAC,CAAA;IAChF,CAAC,CAAC,EAAE,CAAC,EAAE,KAAK,EAAE,OAAO,CAAC,CAAC,CAAC,EAAE,OAAO,EAAE,sBAAsB,CAAC,CAAC,EAAE,CAAC,CAAC,GAAG,OAAO,CAAC,CAAC,CAAC,CAAA;CAG7E,CAAA;AAED,MAAM,WAAW,eAAe,CAAC,CAAC,EAAE,CAAC,CAAE,SAAQ,IAAI,CAAC,gBAAgB,CAAC,CAAC,EAAE,CAAC,CAAC,EAAE,IAAI,CAAC;IAC/E,QAAQ,CAAC,EAAE,CAAC,EAAE,CAAC,CAAC,KAAK,EAAE,CAAC,KAAK,OAAO,CAAC,GAAG,SAAS,CAAA;CAClD;AAED,eAAO,MAAM,QAAQ,GAClB,CAAC,UAAU,MAAM,CAAC,KAAK,CAAC,CAAC,EAAE,OAAO,EAAE,OAAO,EAAE,OAAO,CAAC,MACrD,CAAC,WAAW,eAAe,CAAC,CAAC,EAAE,CAAC,CAAC,aAC1B,OAAO,CAAC,CAAC,CAAC,KAAG,OAAO,CAAC,CAAC,CAM7B,CAAA;AAEH,eAAO,MAAM,EAAE,EAAE;IACf,CAAC,KAAK,CAAC,CAAC,EAAE,KAAK,EAAE,CAAC,GAAG,CAAC,KAAK,EAAE,MAAM,KAAK,OAAO,CAAC,CAAC,CAAC,CAAA;IAClD,CAAC,KAAK,CAAC,CAAC,EAAE,KAAK,EAAE,MAAM,EAAE,KAAK,EAAE,CAAC,GAAG,OAAO,CAAC,CAAC,CAAC,CAAA;CAQ/C,CAAA;AAED,eAAO,MAAM,IAAI,UAAW,MAAM,GAAG,MAAM,KAAG,OAAO,CAAC,OAAO,CACR,CAAA;AAErD,eAAO,MAAM,IAAI,EAAE;IACjB,CAAC,CAAC,EAAE,OAAO,EAAE,CAAC,GAAG,CAAC,KAAK,EAAE,OAAO,CAAC,CAAC,CAAC,KAAK,MAAM,CAAA;IAC9C,CAAC,CAAC,EAAE,KAAK,EAAE,OAAO,CAAC,CAAC,CAAC,EAAE,OAAO,EAAE,CAAC,GAAG,MAAM,CAAA;CAG3C,CAAA;AAED,eAAO,MAAM,KAAK,EAAE;IAClB,CAAC,IAAI,EAAE,MAAM,GAAG,CAAC,CAAC,EAAE,KAAK,EAAE,OAAO,CAAC,CAAC,CAAC,KAAK,OAAO,CAAC,CAAC,CAAC,CAAA;IACpD,CAAC,CAAC,EAAE,KAAK,EAAE,OAAO,CAAC,CAAC,CAAC,EAAE,IAAI,EAAE,MAAM,GAAG,OAAO,CAAC,CAAC,CAAC,CAAA;CACyC,CAAA;AAE3F,eAAO,MAAM,OAAO,GAAI,CAAC,SAAS,MAAM,OAAO,CAAC,CAAC,CAAC,SAAS,MAAM,KAAG,OAAO,CAAC,CAAC,CACrC,CAAA;AAExC,eAAO,MAAM,SAAS,EAAE;IACtB,CAAC,CAAC,EAAE,KAAK,EAAE,CAAC,GAAG,CAAC,KAAK,EAAE,OAAO,CAAC,CAAC,GAAG,SAAS,CAAC,KAAK,OAAO,CAAC,CAAC,CAAC,CAAA;IAC5D,CAAC,CAAC,EAAE,KAAK,EAAE,OAAO,CAAC,CAAC,GAAG,SAAS,CAAC,EAAE,KAAK,EAAE,CAAC,GAAG,OAAO,CAAC,CAAC,CAAC,CAAA;CAMzD,CAAA;AAED,KAAK,YAAY,GAAG,QAAQ,CAAC,MAAM,CAAC,MAAM,EAAE,eAAe,CAAC,CAAC,CAAA;AAE7D,KAAK,WAAW,CAAC,MAAM,SAAS,YAAY,IAAI;IAC9C,QAAQ,EAAE,CAAC,IAAI,MAAM,MAAM,GAAG,IAAI,CAAC,MAAM,CAAC,CAAC,CAAC,CAAC;CAC9C,CAAA;AAED,eAAO,MAAM,MAAM,GAAI,KAAK,CAAC,MAAM,SAAS,YAAY,UAC9C,MAAM,KACb,OAAO,CAAC,WAAW,CAAC,MAAM,CAAC,CAa7B,CAAA;AAED,KAAK,UAAU,CAAC,QAAQ,SAAS,aAAa,CAAC,eAAe,CAAC,IAAI;IACjE,QAAQ,EAAE,CAAC,IAAI,MAAM,QAAQ,GAAG,IAAI,CAAC,QAAQ,CAAC,CAAC,CAAC,CAAC;CAClD,CAAA;AAED,eAAO,MAAM,KAAK,GAAI,KAAK,CAAC,QAAQ,SAAS,aAAa,CAAC,eAAe,CAAC,eAC5D,QAAQ,KACpB,OAAO,CAAC,UAAU,CAAC,QAAQ,CAAC,CAY9B,CAAA;AAED,KAAK,WAAW,CAAC,GAAG,SAAS,MAAM,EAAE,KAAK,SAAS,QAAQ,CAAC,MAAM,CAAC,MAAM,EAAE,eAAe,CAAC,CAAC,IAAI;IAC9F,QAAQ,EAAE,CAAC,IAAI,MAAM,KAAK,GAAG,MAAM,GAAG,QAAQ,CAAC,MAAM,CAAC,GAAG,EAAE,CAAC,CAAC,CAAC,GAAG;QAC/D,QAAQ,CAAC,KAAK,EAAE,IAAI,CAAC,KAAK,CAAC,CAAC,CAAC,CAAC,CAAA;KAC/B;CACF,CAAC,MAAM,KAAK,GAAG,MAAM,CAAC,CAAA;AAEvB,eAAO,MAAM,YAAY,GACvB,KAAK,CAAC,GAAG,SAAS,MAAM,EACxB,KAAK,CAAC,KAAK,SAAS,QAAQ,CAAC,MAAM,CAAC,MAAM,EAAE,eAAe,CAAC,CAAC,OAExD,GAAG,SACD,KAAK,KACX,OAAO,CAAC,WAAW,CAAC,GAAG,EAAE,KAAK,CAAC,CAgBjC,CAAA;AAKD,eAAO,MAAM,MAAM,QAAwC,CAAA;AAC3D,eAAO,MAAM,KAAK,QAAe,CAAA;AACjC,eAAO,MAAM,MAAM,QAA6C,CAAA;AAEhE,wBAAgB,MAAM,CAAC,KAAK,EAAE,MAAM,GAAG,MAAM,CAAA;AAC7C,wBAAgB,MAAM,CAAC,CAAC,EAAE,KAAK,EAAE,OAAO,CAAC,CAAC,CAAC,GAAG,OAAO,CAAC,CAAC,CAAC,CAAA;AAKxD,eAAO,MAAM,MAAM,UAAW,MAAM,KAAG,MAAgC,CAAA;AAEvE,eAAO,MAAM,OAAO,iBAUnB,CAAA"}
+{"version":3,"file":"combinators.d.ts","sourceRoot":"","sources":["../src/combinators.ts"],"names":[],"mappings":"AAAA,OAAO,EAAmC,MAAM,EAAE,MAAM,EAAE,KAAK,KAAK,EAAE,MAAM,QAAQ,CAAA;AAEpF,OAAO,EAGL,KAAK,OAAO,EACZ,KAAK,eAAe,EAEpB,KAAK,YAAY,EAIjB,KAAK,QAAQ,EAGb,KAAK,GAAG,EAER,KAAK,MAAM,EAEX,KAAK,IAAI,EACV,MAAM,WAAW,CAAA;AAMlB,OAAO,EAAE,GAAG,EAAE,KAAK,UAAU,EAAE,GAAG,EAAE,GAAG,EAAE,MAAM,UAAU,CAAA;AAEzD,eAAO,MAAM,OAAO,UAAW,MAAM,KAAG,MAA4C,CAAA;AAEpF,eAAO,MAAM,KAAK,QAAc,CAAA;AAEhC;;;;;GAKG;AACH,eAAO,MAAM,KAAK,eAAgB,MAAM,QAAQ,MAAM,KAAG,OAAO,CAAC,MAAM,CAGtE,CAAA;AAUD,KAAK,eAAe,CAAC,CAAC,SAAS,eAAe,IAAI,CAAC,SAAS,MAAM,GAC9D,MAAM,GACN,CAAC,SAAS,OAAO,CAAC,MAAM,CAAC,CAAC,GACxB,OAAO,CAAC,CAAC,CAAC,GACV,KAAK,CAAA;AAEX,KAAK,eAAe,CAAC,CAAC,SAAS,eAAe,IAAI,CAAC,SAAS,MAAM,GAC9D,MAAM,GACN,CAAC,SAAS,OAAO,CAAC,MAAM,CAAC,CAAC,GACxB,OAAO,CAAC,CAAC,GAAG,SAAS,CAAC,GACtB,KAAK,CAAA;AAEX,wBAAgB,OAAO,CACrB,IAAI,EAAE,MAAM,GAAG,MAAM,EACrB,KAAK,EAAE,MAAM,GAAG,MAAM,GACrB,CAAC,CAAC,SAAS,eAAe,EAAE,KAAK,EAAE,CAAC,KAAK,eAAe,CAAC,CAAC,CAAC,CAAA;AAC9D,wBAAgB,OAAO,CAAC,IAAI,EAAE,MAAM,GAAG,MAAM,EAAE,KAAK,EAAE,MAAM,EAAE,KAAK,EAAE,MAAM,GAAG,MAAM,GAAG,MAAM,CAAA;AAC7F,wBAAgB,OAAO,CAAC,CAAC,EACvB,IAAI,EAAE,MAAM,GAAG,MAAM,EACrB,KAAK,EAAE,OAAO,CAAC,CAAC,CAAC,EACjB,KAAK,EAAE,MAAM,GAAG,MAAM,GACrB,OAAO,CAAC,CAAC,CAAC,CAAA;AAqBb,wBAAgB,MAAM,CACpB,IAAI,EAAE,MAAM,GAAG,MAAM,GACpB,CAAC,CAAC,SAAS,eAAe,EAAE,KAAK,EAAE,CAAC,KAAK,eAAe,CAAC,CAAC,CAAC,CAAA;AAC9D,wBAAgB,MAAM,CAAC,IAAI,EAAE,MAAM,GAAG,MAAM,EAAE,KAAK,EAAE,MAAM,GAAG,MAAM,CAAA;AACpE,wBAAgB,MAAM,CAAC,CAAC,EAAE,IAAI,EAAE,MAAM,GAAG,MAAM,EAAE,KAAK,EAAE,OAAO,CAAC,CAAC,CAAC,GAAG,OAAO,CAAC,CAAC,CAAC,CAAA;AAO/E,wBAAgB,MAAM,CACpB,KAAK,EAAE,MAAM,GAAG,MAAM,GACrB,CAAC,CAAC,SAAS,eAAe,EAAE,KAAK,EAAE,CAAC,KAAK,eAAe,CAAC,CAAC,CAAC,CAAA;AAC9D,wBAAgB,MAAM,CAAC,KAAK,EAAE,MAAM,EAAE,KAAK,EAAE,MAAM,GAAG,MAAM,GAAG,MAAM,CAAA;AACrE,wBAAgB,MAAM,CAAC,CAAC,EAAE,KAAK,EAAE,OAAO,CAAC,CAAC,CAAC,EAAE,KAAK,EAAE,MAAM,GAAG,MAAM,GAAG,OAAO,CAAC,CAAC,CAAC,CAAA;AAUhF;;;;;GAKG;AACH,eAAO,MAAM,MAAM,GACjB,KAAK,CAAC,QAAQ,SAAS,SAAS,CAAC,eAAe,EAAE,GAAG,KAAK,CAAC,eAAe,CAAC,CAAC,cAEhE,QAAQ,KACnB,OAAO,CAAC,IAAI,CAAC,QAAQ,CAAC,MAAM,CAAC,CAAC,CAAsC,CAAA;AAEvE;;;;GAIG;AACH,eAAO,MAAM,aAAa,GACxB,KAAK,CAAC,QAAQ,SAAS,SAAS,CAAC,eAAe,EAAE,GAAG,KAAK,CAAC,eAAe,CAAC,CAAC,cAEhE,QAAQ,KACnB,OAAO,CAAC,IAAI,CAAC,QAAQ,CAAC,MAAM,CAAC,CAAC,CAAqD,CAAA;AAEtF,wBAAgB,QAAQ,IAAI,CAAC,CAAC,SAAS,eAAe,EAAE,KAAK,EAAE,CAAC,KAAK,eAAe,CAAC,CAAC,CAAC,CAAA;AACvF,wBAAgB,QAAQ,CAAC,KAAK,EAAE,MAAM,GAAG,MAAM,CAAA;AAC/C,wBAAgB,QAAQ,CAAC,CAAC,EAAE,KAAK,EAAE,OAAO,CAAC,CAAC,CAAC,GAAG,OAAO,CAAC,CAAC,GAAG,SAAS,CAAC,CAAA;AAMtE,MAAM,WAAW,aAAa;IAC5B,QAAQ,CAAC,GAAG,CAAC,EAAE,MAAM,CAAA;IACrB,QAAQ,CAAC,GAAG,CAAC,EAAE,MAAM,CAAA;CACtB;AAsBD,8EAA8E;AAC9E,eAAO,MAAM,IAAI,EAAE;IACjB,CAAC,CAAC,EAAE,KAAK,EAAE,OAAO,CAAC,CAAC,CAAC,EAAE,OAAO,CAAC,EAAE,aAAa,GAAG,OAAO,CAAC,aAAa,CAAC,CAAC,CAAC,CAAC,CAAA;IAC1E,CAAC,OAAO,CAAC,EAAE,aAAa,GAAG,CAAC,CAAC,EAAE,KAAK,EAAE,OAAO,CAAC,CAAC,CAAC,KAAK,OAAO,CAAC,aAAa,CAAC,CAAC,CAAC,CAAC,CAAA;CAG/E,CAAA;AAED,6FAA6F;AAC7F,eAAO,MAAM,KAAK,EAAE;IAClB,CAAC,CAAC,EACA,KAAK,EAAE,OAAO,CAAC,CAAC,CAAC,EACjB,SAAS,EAAE,MAAM,GAAG,MAAM,EAC1B,OAAO,CAAC,EAAE,aAAa,GACtB,OAAO,CAAC,aAAa,CAAC,CAAC,CAAC,CAAC,CAAA;IAC5B,CACE,SAAS,EAAE,MAAM,GAAG,MAAM,EAC1B,OAAO,CAAC,EAAE,aAAa,GACtB,CAAC,CAAC,EAAE,KAAK,EAAE,OAAO,CAAC,CAAC,CAAC,KAAK,OAAO,CAAC,aAAa,CAAC,CAAC,CAAC,CAAC,CAAA;CAGvD,CAAA;AAED,KAAK,YAAY,CAAC,CAAC,SAAS,MAAM,IAAI,MAAM,SAAS,CAAC,GAAG,KAAK,GAAG,CAAC,CAAA;AAElE,KAAK,UAAU,CAAC,KAAK,IACnB,KAAK,SAAS,QAAQ,CAAC,MAAM,CAAC,WAAW,EAAE,eAAe,CAAC,CAAC,GAAG,IAAI,CAAC,KAAK,CAAC,MAAM,KAAK,CAAC,CAAC,GAAG,KAAK,CAAA;AAEjG,eAAO,MAAM,KAAK,GAAI,CAAC,SAAS,MAAM,EAAE,KAAK,CAAC,KAAK,SAAS,QAAQ,CAAC,MAAM,CAAC,CAAC,EAAE,eAAe,CAAC,CAAC,aACnF,GAAG,CAAC,YAAY,CAAC,CAAC,CAAC,CAAC,SACxB,KAAK,KACX,OAAO,CAAC,UAAU,CAAC,KAAK,CAAC,CAMxB,CAAA;AAYJ,KAAK,WAAW,CAAC,OAAO,SAAS,aAAa,CAAC,SAAS,CAAC,QAAQ,EAAE,eAAe,CAAC,CAAC,IAAI,IAAI,CAC1F,OAAO,CAAC,MAAM,CAAC,CAAC,CAAC,CAAC,CACnB,CAAA;AAED,KAAK,eAAe,CAClB,CAAC,SAAS,QAAQ,EAClB,OAAO,SAAS,aAAa,CAAC,SAAS,CAAC,QAAQ,EAAE,eAAe,CAAC,CAAC,IACjE,OAAO,CAAC,CAAC,EAAE,OAAO,CAAC,MAAM,CAAC,CAAC,CAAC,CAAC,CAAC,SAAS,KAAK,GAAG,OAAO,GAAG,KAAK,CAAA;AAElE,eAAO,MAAM,UAAU,GACrB,CAAC,SAAS,QAAQ,EAClB,KAAK,CAAC,OAAO,SAAS,aAAa,CAAC,SAAS,CAAC,CAAC,EAAE,eAAe,CAAC,CAAC,aAEvD,GAAG,CAAC,CAAC,CAAC,WACR,eAAe,CAAC,CAAC,EAAE,OAAO,CAAC,KACnC,OAAO,CAAC,WAAW,CAAC,OAAO,CAAC,CAK3B,CAAA;AAQJ,eAAO,MAAM,IAAI,UAAW,GAAG,CAAC,MAAM,CAAC,GAAG,MAAM,KAAG,OAAO,CAAC,MAAM,CACM,CAAA;AAEvE,eAAO,MAAM,SAAS,UAAW,GAAG,CAAC,MAAM,CAAC,GAAG,MAAM,SAAS,MAAM,KAAG,OAAO,CAAC,MAAM,CACP,CAAA;AAE9E,oGAAoG;AACpG,eAAO,MAAM,MAAM,EAAE;IACnB,CAAC,CAAC,EAAE,KAAK,EAAE,OAAO,CAAC,CAAC,CAAC,EAAE,KAAK,EAAE,GAAG,CAAC,MAAM,CAAC,GAAG,MAAM,GAAG,OAAO,CAAC,aAAa,CAAC,CAAC,CAAC,CAAC,CAAA;IAC9E,CAAC,KAAK,EAAE,GAAG,CAAC,MAAM,CAAC,GAAG,MAAM,GAAG,CAAC,CAAC,EAAE,KAAK,EAAE,OAAO,CAAC,CAAC,CAAC,KAAK,OAAO,CAAC,aAAa,CAAC,CAAC,CAAC,CAAC,CAAA;CAGnF,CAAA;AAED,MAAM,WAAW,gBAAgB,CAAC,CAAC,EAAE,CAAC;IACpC,QAAQ,CAAC,MAAM,EAAE,CAAC,CAAC,EAAE,CAAC,KAAK,CAAC,CAAA;IAC5B,QAAQ,CAAC,MAAM,EAAE,CAAC,CAAC,EAAE,CAAC,KAAK,CAAC,CAAA;IAC5B,QAAQ,CAAC,EAAE,CAAC,EAAE,CAAC,KAAK,EAAE,CAAC,KAAK,OAAO,CAAA;IACnC,QAAQ,CAAC,IAAI,CAAC,EAAE,MAAM,CAAA;CACvB;AAmCD;;;;GAIG;AACH,eAAO,MAAM,SAAS,EAAE;IACtB,CAAC,CAAC,EAAE,CAAC,EAAE,OAAO,EAAE,gBAAgB,CAAC,CAAC,EAAE,CAAC,CAAC,GAAG,CAAC,KAAK,EAAE,OAAO,CAAC,CAAC,CAAC,KAAK,OAAO,CAAC,CAAC,CAAC,CAAA;IAC1E,CAAC,CAAC,EAAE,CAAC,EAAE,KAAK,EAAE,OAAO,CAAC,CAAC,CAAC,EAAE,OAAO,EAAE,gBAAgB,CAAC,CAAC,EAAE,CAAC,CAAC,GAAG,OAAO,CAAC,CAAC,CAAC,CAAA;CAGvE,CAAA;AAED,MAAM,WAAW,sBAAsB,CAAC,CAAC,EAAE,CAAC;IAC1C,QAAQ,CAAC,MAAM,EAAE,CAAC,CAAC,EAAE,CAAC,KAAK,MAAM,CAAC,MAAM,CAAC,CAAC,EAAE,YAAY,CAAC,CAAA;IACzD,QAAQ,CAAC,MAAM,EAAE,CAAC,CAAC,EAAE,CAAC,KAAK,MAAM,CAAC,MAAM,CAAC,CAAC,EAAE,YAAY,CAAC,CAAA;IACzD,QAAQ,CAAC,EAAE,CAAC,EAAE,CAAC,KAAK,EAAE,CAAC,KAAK,OAAO,CAAA;IACnC,QAAQ,CAAC,IAAI,CAAC,EAAE,MAAM,CAAA;CACvB;AAED,mFAAmF;AACnF,eAAO,MAAM,eAAe,EAAE;IAC5B,CAAC,CAAC,EAAE,CAAC,EAAE,OAAO,EAAE,sBAAsB,CAAC,CAAC,EAAE,CAAC,CAAC,GAAG,CAAC,KAAK,EAAE,OAAO,CAAC,CAAC,CAAC,KAAK,OAAO,CAAC,CAAC,CAAC,CAAA;IAChF,CAAC,CAAC,EAAE,CAAC,EAAE,KAAK,EAAE,OAAO,CAAC,CAAC,CAAC,EAAE,OAAO,EAAE,sBAAsB,CAAC,CAAC,EAAE,CAAC,CAAC,GAAG,OAAO,CAAC,CAAC,CAAC,CAAA;CAG7E,CAAA;AAED;;;;GAIG;AACH,eAAO,MAAM,GAAG,EAAE;IAChB,CAAC,CAAC,EAAE,CAAC,EAAE,OAAO,EAAE,gBAAgB,CAAC,CAAC,EAAE,CAAC,CAAC,GAAG,CAAC,KAAK,EAAE,OAAO,CAAC,CAAC,CAAC,KAAK,OAAO,CAAC,CAAC,CAAC,CAAA;IAC1E,CAAC,CAAC,EAAE,CAAC,EAAE,KAAK,EAAE,OAAO,CAAC,CAAC,CAAC,EAAE,OAAO,EAAE,gBAAgB,CAAC,CAAC,EAAE,CAAC,CAAC,GAAG,OAAO,CAAC,CAAC,CAAC,CAAA;CAGvE,CAAA;AAED,6FAA6F;AAC7F,eAAO,MAAM,UAAU,EAAE;IACvB,CAAC,CAAC,EAAE,CAAC,EAAE,OAAO,EAAE,sBAAsB,CAAC,CAAC,EAAE,CAAC,CAAC,GAAG,CAAC,KAAK,EAAE,OAAO,CAAC,CAAC,CAAC,KAAK,OAAO,CAAC,CAAC,CAAC,CAAA;IAChF,CAAC,CAAC,EAAE,CAAC,EAAE,KAAK,EAAE,OAAO,CAAC,CAAC,CAAC,EAAE,OAAO,EAAE,sBAAsB,CAAC,CAAC,EAAE,CAAC,CAAC,GAAG,OAAO,CAAC,CAAC,CAAC,CAAA;CAG7E,CAAA;AAED,eAAO,MAAM,MAAM,EAAE;IACnB,CAAC,CAAC,EAAE,CAAC,SAAS,CAAC,EACb,UAAU,EAAE,CAAC,KAAK,EAAE,CAAC,KAAK,KAAK,IAAI,CAAC,EACpC,IAAI,EAAE,MAAM,GACX,CAAC,KAAK,EAAE,OAAO,CAAC,CAAC,CAAC,KAAK,OAAO,CAAC,CAAC,CAAC,CAAA;IACpC,CAAC,CAAC,EAAE,SAAS,EAAE,CAAC,KAAK,EAAE,CAAC,KAAK,OAAO,EAAE,IAAI,EAAE,MAAM,GAAG,CAAC,KAAK,EAAE,OAAO,CAAC,CAAC,CAAC,KAAK,OAAO,CAAC,CAAC,CAAC,CAAA;IACtF,CAAC,CAAC,EAAE,CAAC,SAAS,CAAC,EACb,KAAK,EAAE,OAAO,CAAC,CAAC,CAAC,EACjB,UAAU,EAAE,CAAC,KAAK,EAAE,CAAC,KAAK,KAAK,IAAI,CAAC,EACpC,IAAI,EAAE,MAAM,GACX,OAAO,CAAC,CAAC,CAAC,CAAA;IACb,CAAC,CAAC,EAAE,KAAK,EAAE,OAAO,CAAC,CAAC,CAAC,EAAE,SAAS,EAAE,CAAC,KAAK,EAAE,CAAC,KAAK,OAAO,EAAE,IAAI,EAAE,MAAM,GAAG,OAAO,CAAC,CAAC,CAAC,CAAA;CAMnF,CAAA;AAED,MAAM,WAAW,eAAe,CAAC,CAAC,EAAE,CAAC,CAAE,SAAQ,IAAI,CAAC,gBAAgB,CAAC,CAAC,EAAE,CAAC,CAAC,EAAE,IAAI,CAAC;IAC/E,QAAQ,CAAC,EAAE,CAAC,EAAE,CAAC,CAAC,KAAK,EAAE,CAAC,KAAK,OAAO,CAAC,GAAG,SAAS,CAAA;CAClD;AAED,eAAO,MAAM,QAAQ,GAClB,CAAC,UAAU,MAAM,CAAC,KAAK,CAAC,CAAC,EAAE,OAAO,EAAE,OAAO,EAAE,OAAO,CAAC,MACrD,CAAC,WAAW,eAAe,CAAC,CAAC,EAAE,CAAC,CAAC,aAC1B,OAAO,CAAC,CAAC,CAAC,KAAG,OAAO,CAAC,CAAC,CAM7B,CAAA;AAEH,eAAO,MAAM,EAAE,EAAE;IACf,CAAC,KAAK,CAAC,CAAC,EAAE,KAAK,EAAE,CAAC,GAAG,CAAC,KAAK,EAAE,MAAM,KAAK,OAAO,CAAC,CAAC,CAAC,CAAA;IAClD,CAAC,KAAK,CAAC,CAAC,EAAE,KAAK,EAAE,MAAM,EAAE,KAAK,EAAE,CAAC,GAAG,OAAO,CAAC,CAAC,CAAC,CAAA;CAa/C,CAAA;AAED;;;;GAIG;AACH,eAAO,MAAM,QAAQ,GAAI,KAAK,CAAC,MAAM,SAAS,SAAS,CAAC,MAAM,EAAE,GAAG,KAAK,CAAC,MAAM,CAAC,CAAC,aACpE,MAAM,KAChB,OAAO,CAAC,MAAM,CAAC,MAAM,CAAC,CAIxB,CAAA;AAED,eAAO,MAAM,IAAI,UAAW,MAAM,GAAG,MAAM,KAAG,OAAO,CAAC,OAAO,CACR,CAAA;AAErD,eAAO,MAAM,IAAI,EAAE;IACjB,CAAC,CAAC,EAAE,OAAO,EAAE,CAAC,GAAG,CAAC,KAAK,EAAE,OAAO,CAAC,CAAC,CAAC,KAAK,MAAM,CAAA;IAC9C,CAAC,CAAC,EAAE,KAAK,EAAE,OAAO,CAAC,CAAC,CAAC,EAAE,OAAO,EAAE,CAAC,GAAG,MAAM,CAAA;CAG3C,CAAA;AAED,eAAO,MAAM,KAAK,EAAE;IAClB,CAAC,IAAI,EAAE,MAAM,GAAG,CAAC,CAAC,EAAE,KAAK,EAAE,OAAO,CAAC,CAAC,CAAC,KAAK,OAAO,CAAC,CAAC,CAAC,CAAA;IACpD,CAAC,CAAC,EAAE,KAAK,EAAE,OAAO,CAAC,CAAC,CAAC,EAAE,IAAI,EAAE,MAAM,GAAG,OAAO,CAAC,CAAC,CAAC,CAAA;CACyC,CAAA;AAE3F;;;;;GAKG;AACH,eAAO,MAAM,OAAO,GAAI,CAAC,SAAS,MAAM,OAAO,CAAC,CAAC,CAAC,SAAS,MAAM,KAAG,OAAO,CAAC,CAAC,CACrC,CAAA;AAExC;;;;GAIG;AACH,eAAO,MAAM,SAAS,EAAE;IACtB,CAAC,CAAC,EAAE,KAAK,EAAE,CAAC,GAAG,CAAC,KAAK,EAAE,OAAO,CAAC,CAAC,GAAG,SAAS,CAAC,KAAK,OAAO,CAAC,CAAC,CAAC,CAAA;IAC5D,CAAC,CAAC,EAAE,KAAK,EAAE,OAAO,CAAC,CAAC,GAAG,SAAS,CAAC,EAAE,KAAK,EAAE,CAAC,GAAG,OAAO,CAAC,CAAC,CAAC,CAAA;CAMzD,CAAA;AAED,KAAK,YAAY,GAAG,QAAQ,CAAC,MAAM,CAAC,MAAM,EAAE,eAAe,CAAC,CAAC,CAAA;AAE7D,KAAK,WAAW,CAAC,MAAM,SAAS,YAAY,IAAI;IAC9C,QAAQ,EAAE,CAAC,IAAI,MAAM,MAAM,GAAG,IAAI,CAAC,MAAM,CAAC,CAAC,CAAC,CAAC;CAC9C,CAAA;AAED;;;GAGG;AACH,eAAO,MAAM,MAAM,GAAI,KAAK,CAAC,MAAM,SAAS,YAAY,UAC9C,MAAM,KACb,OAAO,CAAC,WAAW,CAAC,MAAM,CAAC,CAa7B,CAAA;AAmBD,eAAO,MAAM,QAAQ,GAAI,CAAC,WACf,OAAO,CAAC,CAAC,CAAC,QACb,aAAa,CAAC,MAAM,CAAC,GAAG,SAAS,KACtC,OAAO,CAAC,CAAC,CAGX,CAAA;AAED,KAAK,UAAU,CAAC,KAAK,SAAS,aAAa,CAAC,eAAe,CAAC,IAC1D,KAAK,CAAC,mBAAmB,CACvB;KAAG,CAAC,IAAI,MAAM,KAAK,GAAG;QAAE,QAAQ,CAAC,KAAK,EAAE,IAAI,CAAC,KAAK,CAAC,CAAC,CAAC,CAAC,CAAA;KAAE;CAAE,CAAC,MAAM,CAAC,CACnE,SAAS;IAAE,QAAQ,CAAC,KAAK,EAAE,MAAM,KAAK,CAAA;CAAE,GACrC,KAAK,CAAC,QAAQ,CAAC,KAAK,CAAC,GACrB,KAAK,CAAA;AAEX,eAAO,MAAM,KAAK,GAAI,KAAK,CAAC,KAAK,SAAS,SAAS,CAAC,eAAe,EAAE,GAAG,KAAK,CAAC,eAAe,CAAC,CAAC,eAChF,KAAK,KACjB,OAAO,CAAC,UAAU,CAAC,KAAK,CAAC,CAe3B,CAAA;AAED,eAAO,MAAM,UAAU,WACb,OAAO,CAAC,MAAM,CAAC,QACjB,CAAC,MAAM,EAAE,GAAG,CAAC,MAAM,CAAC,KAAK,OAAO,CAAC,MAAM,CAAC,KAC7C,OAAO,CAAC,MAAM,CAUd,CAAA;AAEH,eAAO,MAAM,cAAc,WAAY,OAAO,CAAC,MAAM,CAAC,KAAG,OAAO,CAAC,MAAM,CAA6B,CAAA;AAEpG,eAAO,MAAM,aAAa,EAAE;IAC1B,CAAC,CAAC,EAAE,IAAI,EAAE,OAAO,CAAC,CAAC,CAAC,EAAE,KAAK,EAAE,OAAO,CAAC,MAAM,CAAC,GAAG,OAAO,CAAC,aAAa,CAAC,CAAC,CAAC,CAAC,CAAA;IACxE,CAAC,KAAK,EAAE,OAAO,CAAC,MAAM,CAAC,GAAG,CAAC,CAAC,EAAE,IAAI,EAAE,OAAO,CAAC,CAAC,CAAC,KAAK,OAAO,CAAC,aAAa,CAAC,CAAC,CAAC,CAAC,CAAA;CAY7E,CAAA;AAED,KAAK,UAAU,CAAC,QAAQ,SAAS,aAAa,CAAC,eAAe,CAAC,IAAI;IACjE,QAAQ,EAAE,CAAC,IAAI,MAAM,QAAQ,GAAG,IAAI,CAAC,QAAQ,CAAC,CAAC,CAAC,CAAC;CAClD,CAAA;AAED,eAAO,MAAM,KAAK,GAAI,KAAK,CAAC,QAAQ,SAAS,aAAa,CAAC,eAAe,CAAC,eAC5D,QAAQ,KACpB,OAAO,CAAC,UAAU,CAAC,QAAQ,CAAC,CAY9B,CAAA;AAED,KAAK,OAAO,CAAC,GAAG,SAAS,MAAM,EAAE,KAAK,SAAS,QAAQ,CAAC,MAAM,CAAC,MAAM,EAAE,eAAe,CAAC,CAAC,IAAI;IAC1F,QAAQ,EAAE,CAAC,IAAI,MAAM,KAAK,GAAG,MAAM,GAAG,IAAI,CAAC,KAAK,CAAC,CAAC,CAAC,CAAC,SAAS,QAAQ,CAAC,MAAM,CAAC,GAAG,EAAE,CAAC,CAAC,CAAC,GACjF,KAAK,CAAC,CAAC,CAAC,GACR,OAAO,CAAC,QAAQ,CAAC,MAAM,CAAC,GAAG,EAAE,CAAC,CAAC,CAAC,CAAC;CACtC,CAAA;AAED,KAAK,SAAS,CACZ,GAAG,SAAS,MAAM,EAClB,OAAO,SAAS,aAAa,CAAC,SAAS,CAAC,QAAQ,EAAE,eAAe,CAAC,CAAC,IACjE;IACF,QAAQ,EAAE,CAAC,IAAI,MAAM,OAAO,GAAG,OAAO,CAAC,CAAC,CAAC,SAAS,SAAS,CAAC,MAAM,CAAC,SAAS,QAAQ,EAAE,OAAO,CAAC,GAC1F,IAAI,CAAC,OAAO,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,SAAS,QAAQ,CAAC,MAAM,CAAC,GAAG,EAAE,CAAC,CAAC,CAAC,GAClD,OAAO,CAAC,CAAC,CAAC,GACV,SAAS,CAAC,CAAC,EAAE,OAAO,CAAC,QAAQ,CAAC,MAAM,CAAC,GAAG,EAAE,CAAC,CAAC,CAAC,CAAC,CAAC,GACjD,KAAK;CACV,CAAA;AA8BD;;;;;;;;;GASG;AACH,eAAO,MAAM,QAAQ,GACnB,KAAK,CAAC,GAAG,SAAS,MAAM,EACxB,KAAK,CAAC,KAAK,SAAS,QAAQ,CAAC,MAAM,CAAC,MAAM,EAAE,eAAe,CAAC,CAAC,OAExD,GAAG,SACD,KAAK,GAAG,OAAO,CAAC,GAAG,EAAE,KAAK,CAAC,KACjC,OAAO,CAAC,IAAI,CAAC,KAAK,CAAC,MAAM,KAAK,CAAC,CAAC,CAUlC,CAAA;AAED;;;;GAIG;AACH,eAAO,MAAM,eAAe,GAC1B,KAAK,CAAC,GAAG,SAAS,MAAM,EACxB,KAAK,CAAC,OAAO,SAAS,aAAa,CAAC,SAAS,CAAC,QAAQ,EAAE,eAAe,CAAC,CAAC,OAEpE,GAAG,WACC,OAAO,GAAG,SAAS,CAAC,GAAG,EAAE,OAAO,CAAC,KACzC,OAAO,CAAC,IAAI,CAAC,OAAO,CAAC,MAAM,CAAC,CAAC,CAAC,CAAC,CAAC,CAAsD,CAAA;AAEzF,KAAK,WAAW,CAAC,GAAG,SAAS,MAAM,EAAE,KAAK,SAAS,QAAQ,CAAC,MAAM,CAAC,MAAM,EAAE,eAAe,CAAC,CAAC,IAAI;IAC9F,QAAQ,EAAE,CAAC,IAAI,MAAM,KAAK,GAAG,MAAM,GAAG,QAAQ,CAAC,MAAM,CAAC,GAAG,EAAE,CAAC,CAAC,CAAC,GAAG;QAC/D,QAAQ,CAAC,KAAK,EAAE,IAAI,CAAC,KAAK,CAAC,CAAC,CAAC,CAAC,CAAA;KAC/B;CACF,CAAC,MAAM,KAAK,GAAG,MAAM,CAAC,CAAA;AAEvB,eAAO,MAAM,YAAY,GACvB,KAAK,CAAC,GAAG,SAAS,MAAM,EACxB,KAAK,CAAC,KAAK,SAAS,QAAQ,CAAC,MAAM,CAAC,MAAM,EAAE,eAAe,CAAC,CAAC,OAExD,GAAG,SAAS,OAAO,GAAG,KAAK,GAAG,GAAG,SAC/B,KAAK,KACX,OAAO,CAAC,WAAW,CAAC,GAAG,EAAE,KAAK,CAAC,CAqCjC,CAAA;AAKD,eAAO,MAAM,MAAM,QAAwC,CAAA;AAC3D,eAAO,MAAM,KAAK,QAAe,CAAA;AACjC,eAAO,MAAM,MAAM,QAA6C,CAAA;AAEhE,wBAAgB,MAAM,CAAC,KAAK,EAAE,MAAM,GAAG,MAAM,CAAA;AAC7C,wBAAgB,MAAM,CAAC,CAAC,EAAE,KAAK,EAAE,OAAO,CAAC,CAAC,CAAC,GAAG,OAAO,CAAC,CAAC,CAAC,CAAA;AAKxD,eAAO,MAAM,MAAM,UAAW,MAAM,KAAG,MAAgC,CAAA;AAEvE,eAAO,MAAM,OAAO,iBAUnB,CAAA"}

package/dist/combinators.js

@@ -1,14 +1,21 @@
 import { Equal, Function as F, Predicate, Result, Schema } from "effect";
-import { isGrammar, isSilent, make, silent, } from "./core.js";
+import { isGrammar, isSilent, make, nodeOf, silent, } from "./core.js";
 import { isCount } from "./env.js";
 import { exceptionMessage, preview } from "./errors.js";
-import { assertInScope } from "./gen.js";
+import { assertInScope, gen } from "./gen.js";
+import { describe } from "./render.js";
 export { gen, get, seq } from "./gen.js";
 export const literal = (value) => silent({ _tag: "Literal", value });
 export const empty = literal("");
+/**
+ * Match at the parser's current cursor using JavaScript `RegExp` semantics.
+ * Parsing uses a fresh sticky matcher against the original full input; printing
+ * requires the supplied string to match in full. `g`, `y`, and the caller's
+ * `lastIndex` are ignored, and the caller's expression is never mutated.
+ */
 export const regex = (expression, name) => {
     const flags = expression.flags.replace(/[gy]/g, "");
-    return make({ _tag: "Regex", re: new RegExp(expression.source, `${flags}y`), name });
+    return make({ _tag: "Regex", source: expression.source, flags, name });
 };
 const toSilent = (value) => Predicate.isString(value) ? literal(value) : value;
 const preserveSilence = (inner, node) => {
@@ -31,7 +38,6 @@ export function between(open, innerOrClose, close) {
         close: toSilent(close),
     });
 }
-export const wrap = between;
 export function prefix(open, inner) {
     return inner === undefined
         ? (value) => between(open, value, empty)
@@ -45,7 +51,19 @@ export function suffix(innerOrClose, close) {
     // SAFETY: the two-argument overload requires a Grammar as its first argument.
     return between(empty, innerOrClose, close);
 }
+/**
+ * Ordered alternatives. Parsing tries each branch in order and keeps the
+ * first that matches. Printing keeps the first branch whose printer accepts
+ * the value; use `checkedChoice` to keep the first branch whose text also
+ * parses back.
+ */
 export const choice = (...options) => make({ _tag: "Choice", options });
+/**
+ * {@link choice} whose printer selects the first branch that reads back to an
+ * equal value. Each checked choice reparses its candidate output; nesting can
+ * multiply that work, so keep it off hot paths.
+ */
+export const checkedChoice = (...options) => make({ _tag: "Choice", options, checked: true });
 export function optional(inner) {
     if (inner === undefined)
         return (value) => optional(value);
@@ -63,7 +81,9 @@ const bounds = (name, options) => {
 };
 const dataFirst = (args) => isGrammar(args[0]);
 const repeatNode = (name, inner, separator, options) => make({ _tag: "Many", inner, sep: separator, ...bounds(name, options) });
+/** Repeat an item within bounds. Each successful parse must consume input. */
 export const many = F.dual(dataFirst, (inner, options) => repeatNode("many", inner, empty, options));
+/** Repeat an item with a silent separator. Each successful item parse must consume input. */
 export const sepBy = F.dual(dataFirst, (inner, separator, options) => repeatNode("sepBy", inner, toSilent(separator), options));
 export const match = (scrutinee, cases) => make({
     _tag: "Match",
@@ -71,13 +91,26 @@ export const match = (scrutinee, cases) => make({
     // SAFETY: Object.keys returns only keys from the closed Cases record.
     cases: Object.keys(cases).map((key) => ({ key, grammar: cases[key] })),
 });
+const uniqueCases = (entries) => {
+    assertUniqueKeys(entries.map(([key]) => key), "matchValue");
+    return entries.map(([key, grammar]) => ({ key, grammar }));
+};
 export const matchValue = (scrutinee, entries) => make({
     _tag: "Match",
     scrutinee: assertInScope(scrutinee, "matchValue"),
-    cases: entries.map(([key, grammar]) => ({ key, grammar })),
+    cases: uniqueCases(entries),
 });
-export const take = (count) => make({ _tag: "Take", count: assertInScope(count, "take") });
-export const repeat = F.dual(dataFirst, (inner, count) => make({ _tag: "RepeatExact", count: assertInScope(count, "repeat"), inner }));
+const countExpr = (count, where) => {
+    if (!Predicate.isNumber(count))
+        return assertInScope(count, where);
+    if (!isCount(count))
+        throw new RangeError(`${where}: count must be a non-negative safe integer`);
+    return { _tag: "Count", value: count };
+};
+export const take = (count) => make({ _tag: "Take", count: countExpr(count, "take"), unit: "char" });
+export const takeBytes = (count, name) => make({ _tag: "Take", count: countExpr(count, "bytes"), unit: "byte", name });
+/** Repeat an item a constant or bound number of times. Each successful parse must consume input. */
+export const repeat = F.dual(dataFirst, (inner, count) => make({ _tag: "RepeatExact", count: countExpr(count, "repeat"), inner }));
 const attempt = (decode) => (a) => {
     try {
         return Result.succeed(decode(a));
@@ -86,36 +119,81 @@ const attempt = (decode) => (a) => {
         return Result.fail({ message: exceptionMessage(error) });
     }
 };
-export const transform = F.dual(2, (inner, options) => make({
+const plainTransform = (inner, options, fidelity, total) => make({
     _tag: "Transform",
     inner,
     decode: attempt(options.decode),
     encode: attempt(options.encode),
     is: options.is,
     name: options.name,
-}));
-export const transformOrFail = F.dual(2, (inner, options) => make({ _tag: "Transform", inner, ...options }));
+    fidelity,
+    total,
+});
+const resultTransform = (inner, options, fidelity) => make({ _tag: "Transform", inner, ...options, fidelity });
+/**
+ * Map a grammar's value with a pair of functions. No law is claimed: the
+ * two directions need not be inverse, so a value may print as text that
+ * parses back to something else. Use `iso` when you mean to claim inverses.
+ */
+export const transform = F.dual(2, (inner, options) => plainTransform(inner, options, "unchecked"));
+/** {@link transform} with directions that return a `Result`. No law is claimed. */
+export const transformOrFail = F.dual(2, (inner, options) => resultTransform(inner, options, "unchecked"));
+/**
+ * Like {@link transform}, but the author claims the two directions are
+ * inverse. The claim is recorded, not proved; `Grammar.auditFidelity` reports
+ * only the transforms that make no such claim.
+ */
+export const iso = F.dual(2, (inner, options) => plainTransform(inner, options, "claimed-iso"));
+/** An {@link iso} whose two directions may each fail; they must agree where both succeed. */
+export const partialIso = F.dual(2, (inner, options) => resultTransform(inner, options, "partial"));
+export const filter = F.dual(3, (inner, predicate, name) => withKeys(iso(inner, { decode: F.identity, encode: F.identity, is: predicate, name }), keysOf(inner)));
 export const decodeTo = (schema) => (options) => (inner) => {
     let guard;
-    return transform(inner, {
+    return iso(inner, {
         ...options,
         is: options.is ?? ((value) => (guard ??= Schema.is(schema))(value)),
     });
 };
-export const as = F.dual(2, (inner, value) => transform(inner, {
+export const as = F.dual(2, (inner, value) => plainTransform(inner, {
     decode: () => value,
     encode: () => undefined,
     is: (input) => Equal.equals(input, value),
     name: preview(value),
-}));
+}, "claimed-iso", true));
+/**
+ * String alternatives whose value is the matched string. Longer strings are
+ * tried first whatever order they are listed in, so a string is never shadowed
+ * by one of its own prefixes; strings of equal length keep their listed order.
+ */
+export const literals = (...values) => {
+    if (values.length === 0)
+        throw new RangeError("literals: at least one value is required");
+    const longestFirst = values.toSorted((left, right) => right.length - left.length);
+    return make({ _tag: "Choice", options: longestFirst.map((value) => as(literal(value), value)) });
+};
 export const flag = (value) => choice(as(toSilent(value), true), as(empty, false));
 export const skip = F.dual(2, (inner, printAs) => silent({ _tag: "Skip", inner, printAs, show: true }));
 export const label = F.dual(2, (inner, name) => make({ _tag: "Label", inner, name }));
+/**
+ * Defer a grammar for recursive definitions. The thunk runs on first resolution
+ * and its result is cached. Parsing rejects recursion at the same input position;
+ * printing rejects recursion that reaches the same suspension without consuming
+ * a value, so recursive definitions must be productive.
+ */
 export const suspend = (thunk, name) => make({ _tag: "Suspend", thunk, name });
-export const defaulted = F.dual(dataFirst, (inner, value) => transform(inner, {
-    decode: (input) => input ?? value,
+/**
+ * Replace an absent (`undefined`) inner value when parsing, and omit a value
+ * equal to the default when printing. Parsing leaves every other value,
+ * including `null`, unchanged.
+ */
+export const defaulted = F.dual(dataFirst, (inner, value) => iso(inner, {
+    decode: (input) => (input === undefined ? value : input),
     encode: (input) => (Equal.equals(input, value) ? undefined : input),
 }));
+/**
+ * Sequence fields and return an object. Printing requires exactly these own
+ * keys: missing, extra, and symbol keys are rejected.
+ */
 export const struct = (fields) => {
     const scope = { _tag: "ScopeId" };
     const entries = Object.entries(fields);
@@ -130,6 +208,54 @@ export const struct = (fields) => {
         },
     });
 };
+const keysOf = (grammar) => {
+    const node = nodeOf(grammar);
+    switch (node._tag) {
+        case "Gen":
+            return node.result._tag === "Object" ? node.result.fields.map(([key]) => key) : undefined;
+        case "Transform":
+            return node.keys;
+        case "Merge":
+            return node.parts.flatMap((part) => part.keys);
+        case "Wrap":
+        case "Label":
+            return keysOf(node.inner);
+        default:
+            return undefined;
+    }
+};
+export const withKeys = (grammar, keys) => {
+    const node = nodeOf(grammar);
+    return keys === undefined || node._tag !== "Transform" ? grammar : make({ ...node, keys });
+};
+export const merge = (...grammars) => {
+    const parts = grammars.map((grammar, index) => {
+        const keys = keysOf(grammar);
+        if (keys === undefined) {
+            throw new TypeError(`merge: part ${index + 1} (${describe(grammar)}) has no known fields; pass a struct, a gen that returns an object, another merge, or Binary.bits`);
+        }
+        return { grammar, keys };
+    });
+    assertUniqueKeys(parts.flatMap((part) => part.keys), "merge");
+    return make({ _tag: "Merge", parts });
+};
+export const prefixedBy = (length, take) => gen(function* () {
+    const size = yield* length;
+    const body = yield* take(size);
+    return { size, body };
+}).pipe(iso({
+    decode: ({ body }) => body,
+    encode: (body) => ({ size: body.length, body }),
+}));
+export const lengthPrefixed = (length) => prefixedBy(length, take);
+export const countPrefixed = F.dual(2, (item, count) => gen(function* () {
+    const size = yield* count;
+    const items = yield* repeat(item, size);
+    return { size, items };
+}).pipe(iso({
+    decode: ({ items }) => items,
+    encode: (items) => ({ size: items.length, items }),
+})));
 export const tuple = (...elements) => {
     const scope = { _tag: "ScopeId" };
     return make({
@@ -143,22 +269,86 @@ export const tuple = (...elements) => {
         },
     });
 };
+const isArrayIndexKey = (key) => {
+    const index = Number(key);
+    return Number.isInteger(index) && index >= 0 && index < 4_294_967_295 && String(index) === key;
+};
+const assertUniqueKeys = (keys, where) => {
+    const seen = new Set();
+    for (const key of keys) {
+        if (seen.has(key))
+            throw new RangeError(`${where}: duplicate key ${preview(key)}`);
+        seen.add(key);
+    }
+};
+const dispatchedChoice = (tag, entries, where) => {
+    if (entries.length === 0)
+        throw new RangeError(`${where}: at least one case is required`);
+    const keys = entries.map(([key]) => key);
+    assertUniqueKeys(keys, where);
+    return make({
+        _tag: "Choice",
+        options: entries.map(([, grammar]) => grammar),
+        on: { tag, keys },
+    });
+};
+/**
+ * Alternatives dispatched by a discriminant field. Parsing tries the branches
+ * in order; printing reads `value[tag]` and prints with the branch of that key,
+ * so it never picks the wrong printer. It does not remove parse ambiguity: two
+ * branches may still parse the same text.
+ *
+ * The cases are an object keyed by the tag's string values. Integer-like keys
+ * are rejected, since JavaScript reorders them; use `choiceOnEntries` for
+ * those, and for number or boolean discriminants.
+ */
+export const choiceOn = (tag, cases) => {
+    const entries = Object.keys(cases).map((key) => {
+        if (isArrayIndexKey(key)) {
+            throw new RangeError(`choiceOn: key ${JSON.stringify(key)} looks like an integer; JavaScript reorders such keys, so parse order would not match the source. Use choiceOnEntries instead.`);
+        }
+        return [key, cases[key]];
+    });
+    return dispatchedChoice(tag, entries, "choiceOn");
+};
+/**
+ * `choiceOn` with the cases as an array of `[key, grammar]` entries: the parse
+ * order is the array order, and keys may be numbers or booleans as well as
+ * strings.
+ */
+export const choiceOnEntries = (tag, entries) => dispatchedChoice(tag, entries, "choiceOnEntries");
 export const taggedChoice = (tag, cases) => {
-    const branches = Object.entries(cases).map(([key, grammar]) => make({
-        _tag: "Transform",
-        inner: grammar,
+    if (tag === "value")
+        throw new RangeError('taggedChoice: tag name "value" is reserved');
+    const keys = Object.keys(cases);
+    if (keys.length === 0)
+        throw new RangeError("taggedChoice: at least one case is required");
+    for (const key of keys) {
+        if (isArrayIndexKey(key)) {
+            throw new RangeError(`taggedChoice: key ${JSON.stringify(key)} is an array index; JavaScript reorders such keys, so parse order would not match the source`);
+        }
+        if (!isGrammar(cases[key])) {
+            throw new TypeError(`taggedChoice: case ${JSON.stringify(key)} must be a grammar`);
+        }
+    }
+    const branches = keys.map((key) => resultTransform(
+    // SAFETY: taggedChoice's Cases constraint and the runtime check above require grammars.
+    cases[key], {
         decode: (value) => Result.succeed({ [tag]: key, value }),
-        encode: (value) => Result.succeed(Object(value).value),
-        is: (value) => {
-            if (!Predicate.isObject(value) || !Object.hasOwn(value, tag))
-                return false;
-            return Object.is(value[tag], key) && Object.hasOwn(value, "value");
+        encode: (value) => {
+            if (!Predicate.isObject(value) || !Object.hasOwn(value, tag) || value[tag] !== key) {
+                return Result.fail({
+                    message: `expected an object with ${tag} equal to ${preview(key)}`,
+                });
+            }
+            if (!Object.hasOwn(value, "value")) {
+                return Result.fail({ message: "expected an object with a value field" });
+            }
+            return Result.succeed(value.value);
         },
         name: `${tag}=${preview(key)}`,
-    }));
-    if (branches.length === 0)
-        throw new RangeError("taggedChoice: at least one case is required");
-    return make({ _tag: "Choice", options: branches });
+    }, "claimed-iso"));
+    return make({ _tag: "Choice", options: branches, on: { tag, keys } });
 };
 const hiddenWhitespace = (expression, name, printAs) => silent({ _tag: "Skip", inner: regex(expression, name), printAs, show: false });
 export const trivia = hiddenWhitespace(/\s*/, "trivia", "");
@@ -168,7 +358,7 @@ export function lexeme(inner) {
     return suffix(inner, trivia);
 }
 export const symbol = (value) => lexeme(literal(value));
-export const integer = regex(/-?\d+/, "integer").pipe(transform({
+export const integer = regex(/-?\d+/, "integer").pipe(iso({
     decode: (text) => {
         const value = Number(text);
         return Object.is(value, -0) ? 0 : value;