effect-grammar 0.2.0 → 0.4.0

package/README.md

@@ -1,167 +1,106 @@
 # effect-grammar
 
-Invertible grammar combinators and parser-printers for Effect.
-
-Schema models your structured data. `effect-grammar` models the text formats
-inside your strings: connection strings, duration strings (`1h30m`), cron
-expressions, search queries, or DSLs.
-
-You write the grammar definition once. You get four outputs:
-
-- **A Parser**: Reads text and outputs structured data with line and column
-  error messages.
-- **A Printer**: Converts structured data back to canonical text.
-- **A `Schema.Codec<A, string>`**: Integrates directly with Effect Schema
-  (`decode` parses, `encode` prints, and Schema refinements compose).
-- **A Text Renderer**: Formats the grammar as readable text for documentation
-  and schema descriptions.
-
-## Why effect-grammar?
-
-- **`Schema.transformOrFail`**: Requires you to write and maintain both `decode`
-  and `encode` functions manually.
-- **`Schema.TemplateLiteralParser`**: Supports only flat `${a}-${b}` string
-  patterns.
-- **`effect-grammar`**: Automatically derives the parser and printer for formats
-  with optional parts, repetition, alternation, and recursion.
-
-This is for format strings, not documents. The parser backtracks with no
-memoization and no left recursion. Printing is canonical, not pretty.
-
-## Install
-
 ```bash
 pnpm add effect-grammar
 ```
 
-Depends on Effect v4. The package pins `effect` to `4.0.0-beta.102` for now.
+Invertible grammar combinators and parser-printers for Effect.
+
+A `Grammar<A>` supports four operations:
 
-## A grammar
+- `parse`: read a string and return a `Result<A, ParseError>`
+- `print`: write an `A` as canonical text and return a
+  `Result<string, PrintError>`
+- `codec`: combine the grammar with an Effect Schema to make a string codec
+- `render`: return a readable description of the grammar
 
 ```ts
 import { Schema } from "effect"
-import * as Grammar from "effect-grammar"
-
-const endpoint = Grammar.gen(function* () {
-  yield* Grammar.literal("https://")
-  const host = yield* Grammar.field("host", Grammar.regex(/[^:/?#]+/, "host"))
-  const port = yield* Grammar.field(
-    "port",
-    Grammar.optional(Grammar.prefix(":", Grammar.integer)),
+import * as G from "effect-grammar"
+
+const frame = G.gen(function* () {
+  const kind = yield* G.choice(
+    G.literal("text").pipe(G.as("text")),
+    G.literal("bits").pipe(G.as("bits")),
   )
-  return { host, port: port ?? 443 }
+  yield* G.literal("/")
+  const size = yield* G.integer
+  yield* G.literal(":")
+  const body = yield* G.match(kind, {
+    text: G.take(size),
+    bits: G.repeat(G.regex(/[01]/, "bit"), size),
+  })
+  return { kind, size, body }
 })
 
-Grammar.parse(endpoint, "https://effect.website:8080")
-// Result.succeed({ host: "effect.website", port: 8080 })
-Grammar.parse(endpoint, "https://effect.website:abc")
-// Result.fail(ParseError: line 1, column 24: expected integer, found "a")
-Grammar.print(endpoint, { host: "effect.website", port: 443 })
-// Result.succeed("https://effect.website:443")
-Grammar.render(endpoint)
-// "https://" host:<host> port:(":" <integer>)?
-```
-
-A silent grammar (`literal`, `symbol`, `whitespace`, anything under `skip`)
-carries no value and can be `yield*`-ed bare. A value grammar goes through
-`field(name, g)`.
-
-`print` replays the generator. It reads each field from `value[name]` and passes
-that back as the `yield*` result. An `if` on a parsed value takes the same path
-both ways. The generator's return must hold every field under its name, and the
-types enforce it. Return nothing and you get the object of fields.
+const FrameValue = Schema.Struct({
+  kind: Schema.Literals(["text", "bits"]),
+  size: Schema.Number,
+  body: Schema.Union([Schema.String, Schema.Array(Schema.String)]),
+})
 
-`render` cannot read a generator. It runs the generator once with no values and
-shows the parts it yields. The rendering is exact when the generator is
-straight-line, as above. If the generator branches on a parsed value, render
-still runs with no values. `if (kind === "a") yield* ...` shows only the path
-`undefined` takes, with no warning. Put the branch in `choice` instead, which
-renders every option.
+const Frame = G.codec(frame, FrameValue, { identifier: "Frame" })
+const decode = Schema.decodeSync(Frame)
+const encode = Schema.encodeSync(Frame)
+```
 
-`seq` is the same field object without generator control flow. It renders every
-part:
+The grammar and its Schema codec use the same parser and printer:
 
-```ts
-const member = Grammar.seq(
-  Grammar.field("key", jsonString),
-  Grammar.symbol(":"),
-  Grammar.field("value", jsonValue),
-)
-// Grammar<{ key: string; value: Json }>
-```
+```text
+decode("text/5:hello") → { kind: "text", size: 5, body: "hello" }
+decode("bits/4:1010") → { kind: "bits", size: 4, body: ["1", "0", "1", "0"] }
 
-## The Schema
+encode({ kind: "text", size: 2, body: "hi" }) → "text/2:hi"
+encode({ kind: "bits", size: 4, body: ["1", "0", "1", "0"] }) → "bits/4:1010"
 
-`toSchema` takes the grammar and the Schema it should decode to. Parsing happens
-first, then the target's refinements. Encoding prints.
+parse("bits/4:1020") → line 1, column 10: expected bit, found "2"
+print({ kind: "text", size: 2, body: "hello" }) → .body: expected 2 UTF-16 code units, got "hello"
 
-```ts
-const Endpoint = Grammar.toSchema(
-  endpoint,
-  Schema.Struct({
-    host: Schema.NonEmptyString,
-    port: Schema.Int.check(Schema.isBetween({ minimum: 1, maximum: 65535 })),
-  }),
-  { identifier: "Endpoint" },
-)
-
-Schema.decodeUnknownSync(Endpoint)("https://effect.website:443")
-// { host: "effect.website", port: 443 }
-Schema.encodeSync(Endpoint)({ host: "effect.website", port: 443 })
-// "https://effect.website:443"
+render(frame) → kind:("text" | "bits") "/" size:<integer> ":" body:match(kind){"text" => <char>{size} | "bits" => (<bit>){size}}
 ```
 
-## Values and alternatives
-
-`transform` maps a value both ways. `decodeTo` takes a Schema that types
-`decode` and `encode` and checks the value on parse and on print. A `choice` of
-Schema-typed branches picks the matching Schema when printing.
+## Schema integration
 
-```ts
-const Num = Schema.Struct({ kind: Schema.Literal("num"), value: Schema.Finite })
-const num = Grammar.integer.pipe(
-  Grammar.decodeTo(Num)({
-    decode: (value) => ({ kind: "num", value }),
-    encode: (n) => n.value,
-  }),
-)
-```
+`codec` combines a grammar with an Effect Schema. Decoding parses the text and
+then checks the value. Encoding checks the value and then prints it. The example
+above shows the full integration in one code block.
 
-`as` turns a silent grammar into a constant. `flag` turns presence into a
-boolean:
+See the [endpoint example](./examples/endpoint.ts) for a complete Schema.
 
-```ts
-const jsonNull = Grammar.symbol("null").pipe(Grammar.as(null))
-const negate = Grammar.flag("-")
-```
+## Main building blocks
 
-Recursion uses `suspend`:
+| Purpose                     | Combinators                                              |
+| --------------------------- | -------------------------------------------------------- |
+| Text                        | `literal`, `regex`, `integer`, `take`, `repeat`          |
+| Sequences and products      | `gen`, `seq`, `struct`, `tuple`                          |
+| Delimiters                  | `prefix`, `suffix`, `between`, `wrap`                    |
+| Repetition and options      | `optional`, `many`, `sepBy`                              |
+| Alternatives                | `choice`, `taggedChoice`, `match`, `matchValue`          |
+| Value conversion            | `transform`, `transformOrFail`, `decodeTo`, `as`, `flag` |
+| Defaults and ignored values | `defaulted`, `skip`                                      |
+| Whitespace                  | `lexeme`, `symbol`, `space`, `spaces`, `trivia`          |
+| Recursion                   | `suspend`                                                |
 
-```ts
-const jsonValue: Grammar.Grammar<Json> = Grammar.suspend(
-  () =>
-    Grammar.choice(
-      jsonNull,
-      jsonBool,
-      jsonNumber,
-      jsonString,
-      jsonArray,
-      jsonObject,
-    ),
-  "value",
-)
-```
+Most delimiter and repetition combinators support data-first and data-last
+calls, so they also work with `pipe`.
 
-See `examples/` for JSON, Scheme, a Postgres DSN, netstrings, and GitHub's
-search syntax.
+## Results, errors, and rendering
 
-## Errors
+`parse` and `print` return `Result` values. Parse errors report the furthest
+text position, the expected forms, and the line and column. Print errors contain
+a `PrintIssue` tree with paths, missing fields, failed branches, and value
+mismatches. `PrintError.format` converts that tree to text.
 
-`choice` backtracks. Errors report the furthest position the parser reached and
-everything that could have matched there:
+`render` describes a complete grammar. `describe` returns a short grammar name.
 
-```
-line 1, column 7: expected one of "null", "true", "false", number, string, "[", "{", found end of input
-```
+## More examples
 
-`label(name)` names a grammar for these messages.
+- [Postgres connection string](./examples/connection-string.ts): optional parts,
+  query parameters, Schema checks, encoding, and round trips
+- [JSON](./examples/json.ts): a recursive grammar and Schema codec
+- [Scheme](./examples/scheme.ts): recursive expressions, tokens, and canonical
+  whitespace
+- [GitHub search](./examples/github-search.ts): a larger search-query DSL
+- [IP address](./examples/ip.ts): transforms and Schema refinements
+- [Printing showcase](./examples/printing.ts): parsing, printing, rendering, and
+  print failures

package/dist/ast.d.ts

@@ -0,0 +1,115 @@
+import { type GrammarInternal, type Value } from "./core.ts";
+/**
+ * A JSON-shaped mirror of a grammar, produced by `toAst`. Scopes become stable
+ * names (`scope0`, `scope1`, …), a recursive `Suspend` is defined once and
+ * referenced by id at every other occurrence, and functions are described by
+ * name instead of being embedded. Constant values are kept as given, so the
+ * result is serializable for every value a grammar can legally hold.
+ */
+export interface RefAst {
+    readonly _tag: "Ref";
+    readonly scope: string;
+    readonly slot: number;
+    readonly name?: string | undefined;
+}
+export type ExprAst = RefAst | {
+    readonly _tag: "Prop";
+    readonly object: ExprAst;
+    readonly key: string | number;
+};
+export type PatternAst = RefAst | {
+    readonly _tag: "Const";
+    readonly value: Value;
+} | {
+    readonly _tag: "Object";
+    readonly fields: ReadonlyArray<readonly [string, PatternAst]>;
+} | {
+    readonly _tag: "Array";
+    readonly items: ReadonlyArray<PatternAst>;
+};
+export interface MatchCaseAst {
+    readonly key: string | number | boolean;
+    readonly grammar: GrammarAst;
+}
+export type StepAst = {
+    readonly _tag: "Silent";
+    readonly grammar: GrammarAst;
+} | {
+    readonly _tag: "Bind";
+    readonly slot: number;
+    readonly name?: string | undefined;
+    readonly grammar: GrammarAst;
+};
+export type GrammarAst = {
+    readonly _tag: "Literal";
+    readonly value: string;
+} | {
+    readonly _tag: "Regex";
+    readonly name: string;
+    readonly source: string;
+    readonly flags: string;
+} | {
+    readonly _tag: "Gen";
+    readonly scope: string;
+    readonly slotCount: number;
+    readonly steps: ReadonlyArray<StepAst>;
+    readonly result: PatternAst;
+} | {
+    readonly _tag: "Wrap";
+    readonly open: GrammarAst;
+    readonly inner: GrammarAst;
+    readonly close: GrammarAst;
+} | {
+    readonly _tag: "Choice";
+    readonly options: ReadonlyArray<GrammarAst>;
+} | {
+    readonly _tag: "Many";
+    readonly inner: GrammarAst;
+    readonly sep: GrammarAst;
+    readonly min: number;
+    readonly max: number | "∞";
+} | {
+    readonly _tag: "Optional";
+    readonly inner: GrammarAst;
+} | {
+    readonly _tag: "Transform";
+    readonly inner: GrammarAst;
+    readonly decode: string;
+    readonly encode: string;
+    readonly is?: string | undefined;
+    readonly name?: string | undefined;
+} | {
+    readonly _tag: "Skip";
+    readonly inner: GrammarAst;
+    readonly printAs: Value;
+    readonly show: boolean;
+} | {
+    readonly _tag: "Label";
+    readonly name: string;
+    readonly inner: GrammarAst;
+} | {
+    readonly _tag: "Suspend";
+    readonly id: number;
+    readonly name?: string | undefined;
+    readonly body: GrammarAst;
+} | {
+    readonly _tag: "SuspendRef";
+    readonly id: number;
+    readonly name?: string | undefined;
+} | {
+    readonly _tag: "Match";
+    readonly scrutinee: ExprAst;
+    readonly cases: ReadonlyArray<MatchCaseAst>;
+} | {
+    readonly _tag: "Take";
+    readonly count: ExprAst;
+} | {
+    readonly _tag: "RepeatExact";
+    readonly count: ExprAst;
+    readonly inner: GrammarAst;
+};
+/** Reflects a grammar into a plain, JSON-shaped tree. */
+export declare const toAst: (grammar: GrammarInternal) => GrammarAst;
+/** Renders a grammar as an indented node tree, one line per AST node. */
+export declare const renderAst: (grammar: GrammarInternal) => string;
+//# sourceMappingURL=ast.d.ts.map

package/dist/ast.d.ts.map

@@ -0,0 +1 @@
+{"version":3,"file":"ast.d.ts","sourceRoot":"","sources":["../src/ast.ts"],"names":[],"mappings":"AAEA,OAAO,EAEL,KAAK,eAAe,EAOpB,KAAK,KAAK,EACX,MAAM,WAAW,CAAA;AAIlB;;;;;;GAMG;AACH,MAAM,WAAW,MAAM;IACrB,QAAQ,CAAC,IAAI,EAAE,KAAK,CAAA;IACpB,QAAQ,CAAC,KAAK,EAAE,MAAM,CAAA;IACtB,QAAQ,CAAC,IAAI,EAAE,MAAM,CAAA;IACrB,QAAQ,CAAC,IAAI,CAAC,EAAE,MAAM,GAAG,SAAS,CAAA;CACnC;AAED,MAAM,MAAM,OAAO,GACf,MAAM,GACN;IAAE,QAAQ,CAAC,IAAI,EAAE,MAAM,CAAC;IAAC,QAAQ,CAAC,MAAM,EAAE,OAAO,CAAC;IAAC,QAAQ,CAAC,GAAG,EAAE,MAAM,GAAG,MAAM,CAAA;CAAE,CAAA;AAEtF,MAAM,MAAM,UAAU,GAClB,MAAM,GACN;IAAE,QAAQ,CAAC,IAAI,EAAE,OAAO,CAAC;IAAC,QAAQ,CAAC,KAAK,EAAE,KAAK,CAAA;CAAE,GACjD;IAAE,QAAQ,CAAC,IAAI,EAAE,QAAQ,CAAC;IAAC,QAAQ,CAAC,MAAM,EAAE,aAAa,CAAC,SAAS,CAAC,MAAM,EAAE,UAAU,CAAC,CAAC,CAAA;CAAE,GAC1F;IAAE,QAAQ,CAAC,IAAI,EAAE,OAAO,CAAC;IAAC,QAAQ,CAAC,KAAK,EAAE,aAAa,CAAC,UAAU,CAAC,CAAA;CAAE,CAAA;AAEzE,MAAM,WAAW,YAAY;IAC3B,QAAQ,CAAC,GAAG,EAAE,MAAM,GAAG,MAAM,GAAG,OAAO,CAAA;IACvC,QAAQ,CAAC,OAAO,EAAE,UAAU,CAAA;CAC7B;AAED,MAAM,MAAM,OAAO,GACf;IAAE,QAAQ,CAAC,IAAI,EAAE,QAAQ,CAAC;IAAC,QAAQ,CAAC,OAAO,EAAE,UAAU,CAAA;CAAE,GACzD;IACE,QAAQ,CAAC,IAAI,EAAE,MAAM,CAAA;IACrB,QAAQ,CAAC,IAAI,EAAE,MAAM,CAAA;IACrB,QAAQ,CAAC,IAAI,CAAC,EAAE,MAAM,GAAG,SAAS,CAAA;IAClC,QAAQ,CAAC,OAAO,EAAE,UAAU,CAAA;CAC7B,CAAA;AAEL,MAAM,MAAM,UAAU,GAClB;IAAE,QAAQ,CAAC,IAAI,EAAE,SAAS,CAAC;IAAC,QAAQ,CAAC,KAAK,EAAE,MAAM,CAAA;CAAE,GACpD;IACE,QAAQ,CAAC,IAAI,EAAE,OAAO,CAAA;IACtB,QAAQ,CAAC,IAAI,EAAE,MAAM,CAAA;IACrB,QAAQ,CAAC,MAAM,EAAE,MAAM,CAAA;IACvB,QAAQ,CAAC,KAAK,EAAE,MAAM,CAAA;CACvB,GACD;IACE,QAAQ,CAAC,IAAI,EAAE,KAAK,CAAA;IACpB,QAAQ,CAAC,KAAK,EAAE,MAAM,CAAA;IACtB,QAAQ,CAAC,SAAS,EAAE,MAAM,CAAA;IAC1B,QAAQ,CAAC,KAAK,EAAE,aAAa,CAAC,OAAO,CAAC,CAAA;IACtC,QAAQ,CAAC,MAAM,EAAE,UAAU,CAAA;CAC5B,GACD;IACE,QAAQ,CAAC,IAAI,EAAE,MAAM,CAAA;IACrB,QAAQ,CAAC,IAAI,EAAE,UAAU,CAAA;IACzB,QAAQ,CAAC,KAAK,EAAE,UAAU,CAAA;IAC1B,QAAQ,CAAC,KAAK,EAAE,UAAU,CAAA;CAC3B,GACD;IAAE,QAAQ,CAAC,IAAI,EAAE,QAAQ,CAAC;IAAC,QAAQ,CAAC,OAAO,EAAE,aAAa,CAAC,UAAU,CAAC,CAAA;CAAE,GACxE;IACE,QAAQ,CAAC,IAAI,EAAE,MAAM,CAAA;IACrB,QAAQ,CAAC,KAAK,EAAE,UAAU,CAAA;IAC1B,QAAQ,CAAC,GAAG,EAAE,UAAU,CAAA;IACxB,QAAQ,CAAC,GAAG,EAAE,MAAM,CAAA;IACpB,QAAQ,CAAC,GAAG,EAAE,MAAM,GAAG,GAAG,CAAA;CAC3B,GACD;IAAE,QAAQ,CAAC,IAAI,EAAE,UAAU,CAAC;IAAC,QAAQ,CAAC,KAAK,EAAE,UAAU,CAAA;CAAE,GACzD;IACE,QAAQ,CAAC,IAAI,EAAE,WAAW,CAAA;IAC1B,QAAQ,CAAC,KAAK,EAAE,UAAU,CAAA;IAC1B,QAAQ,CAAC,MAAM,EAAE,MAAM,CAAA;IACvB,QAAQ,CAAC,MAAM,EAAE,MAAM,CAAA;IACvB,QAAQ,CAAC,EAAE,CAAC,EAAE,MAAM,GAAG,SAAS,CAAA;IAChC,QAAQ,CAAC,IAAI,CAAC,EAAE,MAAM,GAAG,SAAS,CAAA;CACnC,GACD;IACE,QAAQ,CAAC,IAAI,EAAE,MAAM,CAAA;IACrB,QAAQ,CAAC,KAAK,EAAE,UAAU,CAAA;IAC1B,QAAQ,CAAC,OAAO,EAAE,KAAK,CAAA;IACvB,QAAQ,CAAC,IAAI,EAAE,OAAO,CAAA;CACvB,GACD;IAAE,QAAQ,CAAC,IAAI,EAAE,OAAO,CAAC;IAAC,QAAQ,CAAC,IAAI,EAAE,MAAM,CAAC;IAAC,QAAQ,CAAC,KAAK,EAAE,UAAU,CAAA;CAAE,GAC7E;IACE,QAAQ,CAAC,IAAI,EAAE,SAAS,CAAA;IACxB,QAAQ,CAAC,EAAE,EAAE,MAAM,CAAA;IACnB,QAAQ,CAAC,IAAI,CAAC,EAAE,MAAM,GAAG,SAAS,CAAA;IAClC,QAAQ,CAAC,IAAI,EAAE,UAAU,CAAA;CAC1B,GACD;IAAE,QAAQ,CAAC,IAAI,EAAE,YAAY,CAAC;IAAC,QAAQ,CAAC,EAAE,EAAE,MAAM,CAAC;IAAC,QAAQ,CAAC,IAAI,CAAC,EAAE,MAAM,GAAG,SAAS,CAAA;CAAE,GACxF;IACE,QAAQ,CAAC,IAAI,EAAE,OAAO,CAAA;IACtB,QAAQ,CAAC,SAAS,EAAE,OAAO,CAAA;IAC3B,QAAQ,CAAC,KAAK,EAAE,aAAa,CAAC,YAAY,CAAC,CAAA;CAC5C,GACD;IAAE,QAAQ,CAAC,IAAI,EAAE,MAAM,CAAC;IAAC,QAAQ,CAAC,KAAK,EAAE,OAAO,CAAA;CAAE,GAClD;IAAE,QAAQ,CAAC,IAAI,EAAE,aAAa,CAAC;IAAC,QAAQ,CAAC,KAAK,EAAE,OAAO,CAAC;IAAC,QAAQ,CAAC,KAAK,EAAE,UAAU,CAAA;CAAE,CAAA;AAyJzF,yDAAyD;AACzD,eAAO,MAAM,KAAK,YAAa,eAAe,KAAG,UAC4B,CAAA;AA0H7E,yEAAyE;AACzE,eAAO,MAAM,SAAS,YAAa,eAAe,KAAG,MAAoC,CAAA"}

package/dist/ast.js

@@ -0,0 +1,253 @@
+import { Predicate } from "effect";
+import { nodeOf, resolve, } from "./core.js";
+import { preview } from "./errors.js";
+import { nameBindings, namesFor } from "./render.js";
+const scopeName = (context, scope) => {
+    const existing = context.scopes.get(scope);
+    if (existing !== undefined)
+        return existing;
+    const name = `scope${context.scopes.size}`;
+    context.scopes.set(scope, name);
+    return name;
+};
+const refAst = (expr, context) => {
+    const scope = scopeName(context, expr.scope);
+    const name = context.names.get(expr.scope)?.get(expr.slot);
+    if (name === undefined)
+        return { _tag: "Ref", scope, slot: expr.slot };
+    return { _tag: "Ref", scope, slot: expr.slot, name };
+};
+const keyAst = (key) => Predicate.isString(key) || Predicate.isNumber(key) ? key : preview(key);
+const exprAst = (expr, context) => expr._tag === "Ref"
+    ? refAst(expr, context)
+    : { _tag: "Prop", object: exprAst(expr.object, context), key: keyAst(expr.key) };
+const patternAst = (pattern, context) => {
+    switch (pattern._tag) {
+        case "Ref":
+            return refAst(pattern, context);
+        case "Const":
+            return { _tag: "Const", value: pattern.value };
+        case "Object":
+            return {
+                _tag: "Object",
+                fields: pattern.fields.map(([key, field]) => [key, patternAst(field, context)]),
+            };
+        case "Array":
+            return { _tag: "Array", items: pattern.items.map((item) => patternAst(item, context)) };
+    }
+};
+const fnName = (f) => (f.name === "" ? "<anonymous>" : f.name);
+const stepAst = (step, context, names) => step._tag === "Silent"
+    ? { _tag: "Silent", grammar: walk(step.grammar, context) }
+    : {
+        _tag: "Bind",
+        slot: step.slot,
+        name: names.get(step.slot),
+        grammar: walk(step.grammar, context),
+    };
+const walk = (grammar, context) => {
+    const node = nodeOf(grammar);
+    switch (node._tag) {
+        case "Literal":
+            return { _tag: "Literal", value: node.value };
+        case "Regex":
+            return { _tag: "Regex", name: node.name, source: node.re.source, flags: node.re.flags };
+        case "Gen": {
+            const names = namesFor(context.names, node.scope);
+            nameBindings(node.result, undefined, node.scope, names);
+            const scope = scopeName(context, node.scope);
+            return {
+                _tag: "Gen",
+                scope,
+                slotCount: node.slotCount,
+                steps: node.steps.map((step) => stepAst(step, context, names)),
+                result: patternAst(node.result, context),
+            };
+        }
+        case "Wrap":
+            return {
+                _tag: "Wrap",
+                open: walk(node.open, context),
+                inner: walk(node.inner, context),
+                close: walk(node.close, context),
+            };
+        case "Choice":
+            return { _tag: "Choice", options: node.options.map((option) => walk(option, context)) };
+        case "Many":
+            return {
+                _tag: "Many",
+                inner: walk(node.inner, context),
+                sep: walk(node.sep, context),
+                min: node.min,
+                max: node.max === Number.POSITIVE_INFINITY ? "∞" : node.max,
+            };
+        case "Optional":
+            return { _tag: "Optional", inner: walk(node.inner, context) };
+        case "Transform": {
+            const inner = walk(node.inner, context);
+            if (node.is === undefined) {
+                return {
+                    _tag: "Transform",
+                    inner,
+                    decode: fnName(node.decode),
+                    encode: fnName(node.encode),
+                    name: node.name,
+                };
+            }
+            return {
+                _tag: "Transform",
+                inner,
+                decode: fnName(node.decode),
+                encode: fnName(node.encode),
+                is: fnName(node.is),
+                name: node.name,
+            };
+        }
+        case "Skip":
+            return {
+                _tag: "Skip",
+                inner: walk(node.inner, context),
+                printAs: node.printAs,
+                show: node.show,
+            };
+        case "Label":
+            return { _tag: "Label", name: node.name, inner: walk(node.inner, context) };
+        case "Suspend": {
+            const existing = context.suspends.get(node);
+            if (existing !== undefined)
+                return { _tag: "SuspendRef", id: existing, name: node.name };
+            const id = context.suspends.size;
+            context.suspends.set(node, id);
+            return { _tag: "Suspend", id, name: node.name, body: walk(resolve(node), context) };
+        }
+        case "Match":
+            return {
+                _tag: "Match",
+                scrutinee: exprAst(node.scrutinee, context),
+                cases: node.cases.map((matchCase) => ({
+                    key: matchCase.key,
+                    grammar: walk(matchCase.grammar, context),
+                })),
+            };
+        case "Take":
+            return { _tag: "Take", count: exprAst(node.count, context) };
+        case "RepeatExact":
+            return {
+                _tag: "RepeatExact",
+                count: exprAst(node.count, context),
+                inner: walk(node.inner, context),
+            };
+    }
+};
+/** Reflects a grammar into a plain, JSON-shaped tree. */
+export const toAst = (grammar) => walk(grammar, { scopes: new Map(), names: new Map(), suspends: new Map() });
+const formatValue = (value) => Predicate.isString(value) ? JSON.stringify(value) : preview(value);
+const refText = (ref) => ref.name ?? `$${ref.slot}`;
+const exprText = (expr) => {
+    if (expr._tag === "Ref")
+        return refText(expr);
+    const object = exprText(expr.object);
+    return Predicate.isString(expr.key) && /^[A-Za-z_$][\w$]*$/.test(expr.key)
+        ? `${object}.${expr.key}`
+        : `${object}[${preview(expr.key)}]`;
+};
+const patternText = (pattern) => {
+    switch (pattern._tag) {
+        case "Ref":
+            return refText(pattern);
+        case "Const":
+            return formatValue(pattern.value);
+        case "Object":
+            return `{ ${pattern.fields.map(([key, field]) => `${key}: ${patternText(field)}`).join(", ")} }`;
+        case "Array":
+            return `[${pattern.items.map(patternText).join(", ")}]`;
+    }
+};
+const boundsText = (min, max) => {
+    if (max === "∞")
+        return min === 0 ? "*" : min === 1 ? "+" : `{${min},}`;
+    return min === max ? `{${min}}` : `{${min},${max}}`;
+};
+const headerOf = (ast) => {
+    switch (ast._tag) {
+        case "Literal":
+            return `Literal ${formatValue(ast.value)}`;
+        case "Regex":
+            return `Regex ${ast.name} /${ast.source}/${ast.flags}`;
+        case "Gen":
+            return `Gen ${ast.scope} → ${patternText(ast.result)}`;
+        case "Wrap":
+            return "Wrap";
+        case "Choice":
+            return "Choice";
+        case "Many":
+            return `Many ${boundsText(ast.min, ast.max)}`;
+        case "Optional":
+            return "Optional";
+        case "Transform":
+            return ast.name === undefined ? "Transform" : `Transform ${ast.name}`;
+        case "Skip":
+            return ast.show ? "Skip" : "Skip (hidden)";
+        case "Label":
+            return `Label ${ast.name}`;
+        case "Suspend":
+            return ast.name === undefined ? `Suspend #${ast.id}` : `Suspend #${ast.id} ${ast.name}`;
+        case "SuspendRef":
+            return ast.name === undefined ? `SuspendRef #${ast.id}` : `SuspendRef #${ast.id} ${ast.name}`;
+        case "Match":
+            return `Match ${exprText(ast.scrutinee)}`;
+        case "Take":
+            return `Take ${exprText(ast.count)}`;
+        case "RepeatExact":
+            return `RepeatExact ${exprText(ast.count)}`;
+    }
+};
+const childrenOf = (ast) => {
+    switch (ast._tag) {
+        case "Gen":
+            return ast.steps.map((step) => step._tag === "Bind"
+                ? [step.name ?? `bind #${step.slot}`, step.grammar]
+                : [undefined, step.grammar]);
+        case "Wrap":
+            return [
+                [undefined, ast.open],
+                [undefined, ast.inner],
+                [undefined, ast.close],
+            ];
+        case "Choice":
+            return ast.options.map((option) => [undefined, option]);
+        case "Many":
+            return [[undefined, ast.inner], ["sep", ast.sep]];
+        case "Optional":
+        case "Transform":
+        case "Skip":
+        case "Label":
+        case "RepeatExact":
+            return [[undefined, ast.inner]];
+        case "Suspend":
+            return [[undefined, ast.body]];
+        case "Match":
+            return ast.cases.map((matchCase) => [`${formatValue(matchCase.key)} =>`, matchCase.grammar]);
+        case "Literal":
+        case "Regex":
+        case "Take":
+        case "SuspendRef":
+            return [];
+    }
+};
+const renderTree = (ast) => {
+    const lines = [headerOf(ast)];
+    const visit = (node, padding) => {
+        const children = childrenOf(node);
+        children.forEach(([label, child], index) => {
+            const last = index === children.length - 1;
+            lines.push(`${padding}${last ? "└─ " : "├─ "}${label === undefined ? "" : `${label} `}${headerOf(child)}`);
+            visit(child, `${padding}${last ? "   " : "│  "}`);
+        });
+    };
+    visit(ast, "");
+    return lines.join("\n");
+};
+/** Renders a grammar as an indented node tree, one line per AST node. */
+export const renderAst = (grammar) => renderTree(toAst(grammar));
+//# sourceMappingURL=ast.js.map

package/dist/ast.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"ast.js","sourceRoot":"","sources":["../src/ast.ts"],"names":[],"mappings":"AAAA,OAAO,EAAE,SAAS,EAAE,MAAM,QAAQ,CAAA;AAElC,OAAO,EAGL,MAAM,EAGN,OAAO,GAIR,MAAM,WAAW,CAAA;AAClB,OAAO,EAAE,OAAO,EAAE,MAAM,aAAa,CAAA;AACrC,OAAO,EAAE,YAAY,EAAE,QAAQ,EAAE,MAAM,aAAa,CAAA;AA0GpD,MAAM,SAAS,GAAG,CAAC,OAAgB,EAAE,KAAc,EAAU,EAAE;IAC7D,MAAM,QAAQ,GAAG,OAAO,CAAC,MAAM,CAAC,GAAG,CAAC,KAAK,CAAC,CAAA;IAC1C,IAAI,QAAQ,KAAK,SAAS;QAAE,OAAO,QAAQ,CAAA;IAC3C,MAAM,IAAI,GAAG,QAAQ,OAAO,CAAC,MAAM,CAAC,IAAI,EAAE,CAAA;IAC1C,OAAO,CAAC,MAAM,CAAC,GAAG,CAAC,KAAK,EAAE,IAAI,CAAC,CAAA;IAC/B,OAAO,IAAI,CAAA;AACb,CAAC,CAAA;AAED,MAAM,MAAM,GAAG,CAAC,IAAoC,EAAE,OAAgB,EAAU,EAAE;IAChF,MAAM,KAAK,GAAG,SAAS,CAAC,OAAO,EAAE,IAAI,CAAC,KAAK,CAAC,CAAA;IAC5C,MAAM,IAAI,GAAG,OAAO,CAAC,KAAK,CAAC,GAAG,CAAC,IAAI,CAAC,KAAK,CAAC,EAAE,GAAG,CAAC,IAAI,CAAC,IAAI,CAAC,CAAA;IAC1D,IAAI,IAAI,KAAK,SAAS;QAAE,OAAO,EAAE,IAAI,EAAE,KAAK,EAAE,KAAK,EAAE,IAAI,EAAE,IAAI,CAAC,IAAI,EAAE,CAAA;IACtE,OAAO,EAAE,IAAI,EAAE,KAAK,EAAE,KAAK,EAAE,IAAI,EAAE,IAAI,CAAC,IAAI,EAAE,IAAI,EAAE,CAAA;AACtD,CAAC,CAAA;AAED,MAAM,MAAM,GAAG,CAAC,GAAgB,EAAmB,EAAE,CACnD,SAAS,CAAC,QAAQ,CAAC,GAAG,CAAC,IAAI,SAAS,CAAC,QAAQ,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC,OAAO,CAAC,GAAG,CAAC,CAAA;AAEzE,MAAM,OAAO,GAAG,CAAC,IAAU,EAAE,OAAgB,EAAW,EAAE,CACxD,IAAI,CAAC,IAAI,KAAK,KAAK;IACjB,CAAC,CAAC,MAAM,CAAC,IAAI,EAAE,OAAO,CAAC;IACvB,CAAC,CAAC,EAAE,IAAI,EAAE,MAAM,EAAE,MAAM,EAAE,OAAO,CAAC,IAAI,CAAC,MAAM,EAAE,OAAO,CAAC,EAAE,GAAG,EAAE,MAAM,CAAC,IAAI,CAAC,GAAG,CAAC,EAAE,CAAA;AAEpF,MAAM,UAAU,GAAG,CAAC,OAAgB,EAAE,OAAgB,EAAc,EAAE;IACpE,QAAQ,OAAO,CAAC,IAAI,EAAE,CAAC;QACrB,KAAK,KAAK;YACR,OAAO,MAAM,CAAC,OAAO,EAAE,OAAO,CAAC,CAAA;QACjC,KAAK,OAAO;YACV,OAAO,EAAE,IAAI,EAAE,OAAO,EAAE,KAAK,EAAE,OAAO,CAAC,KAAK,EAAE,CAAA;QAChD,KAAK,QAAQ;YACX,OAAO;gBACL,IAAI,EAAE,QAAQ;gBACd,MAAM,EAAE,OAAO,CAAC,MAAM,CAAC,GAAG,CAAC,CAAC,CAAC,GAAG,EAAE,KAAK,CAAC,EAAE,EAAE,CAAC,CAAC,GAAG,EAAE,UAAU,CAAC,KAAK,EAAE,OAAO,CAAC,CAAU,CAAC;aACzF,CAAA;QACH,KAAK,OAAO;YACV,OAAO,EAAE,IAAI,EAAE,OAAO,EAAE,KAAK,EAAE,OAAO,CAAC,KAAK,CAAC,GAAG,CAAC,CAAC,IAAI,EAAE,EAAE,CAAC,UAAU,CAAC,IAAI,EAAE,OAAO,CAAC,CAAC,EAAE,CAAA;IAC3F,CAAC;AACH,CAAC,CAAA;AAED,MAAM,MAAM,GAAG,CAAC,CAA4B,EAAU,EAAE,CAAC,CAAC,CAAC,CAAC,IAAI,KAAK,EAAE,CAAC,CAAC,CAAC,aAAa,CAAC,CAAC,CAAC,CAAC,CAAC,IAAI,CAAC,CAAA;AAEjG,MAAM,OAAO,GAAG,CAAC,IAAU,EAAE,OAAgB,EAAE,KAA0B,EAAW,EAAE,CACpF,IAAI,CAAC,IAAI,KAAK,QAAQ;IACpB,CAAC,CAAC,EAAE,IAAI,EAAE,QAAQ,EAAE,OAAO,EAAE,IAAI,CAAC,IAAI,CAAC,OAAO,EAAE,OAAO,CAAC,EAAE;IAC1D,CAAC,CAAC;QACE,IAAI,EAAE,MAAM;QACZ,IAAI,EAAE,IAAI,CAAC,IAAI;QACf,IAAI,EAAE,KAAK,CAAC,GAAG,CAAC,IAAI,CAAC,IAAI,CAAC;QAC1B,OAAO,EAAE,IAAI,CAAC,IAAI,CAAC,OAAO,EAAE,OAAO,CAAC;KACrC,CAAA;AAEP,MAAM,IAAI,GAAG,CAAC,OAAwB,EAAE,OAAgB,EAAc,EAAE;IACtE,MAAM,IAAI,GAAG,MAAM,CAAC,OAAO,CAAC,CAAA;IAC5B,QAAQ,IAAI,CAAC,IAAI,EAAE,CAAC;QAClB,KAAK,SAAS;YACZ,OAAO,EAAE,IAAI,EAAE,SAAS,EAAE,KAAK,EAAE,IAAI,CAAC,KAAK,EAAE,CAAA;QAC/C,KAAK,OAAO;YACV,OAAO,EAAE,IAAI,EAAE,OAAO,EAAE,IAAI,EAAE,IAAI,CAAC,IAAI,EAAE,MAAM,EAAE,IAAI,CAAC,EAAE,CAAC,MAAM,EAAE,KAAK,EAAE,IAAI,CAAC,EAAE,CAAC,KAAK,EAAE,CAAA;QACzF,KAAK,KAAK,EAAE,CAAC;YACX,MAAM,KAAK,GAAG,QAAQ,CAAC,OAAO,CAAC,KAAK,EAAE,IAAI,CAAC,KAAK,CAAC,CAAA;YACjD,YAAY,CAAC,IAAI,CAAC,MAAM,EAAE,SAAS,EAAE,IAAI,CAAC,KAAK,EAAE,KAAK,CAAC,CAAA;YACvD,MAAM,KAAK,GAAG,SAAS,CAAC,OAAO,EAAE,IAAI,CAAC,KAAK,CAAC,CAAA;YAC5C,OAAO;gBACL,IAAI,EAAE,KAAK;gBACX,KAAK;gBACL,SAAS,EAAE,IAAI,CAAC,SAAS;gBACzB,KAAK,EAAE,IAAI,CAAC,KAAK,CAAC,GAAG,CAAC,CAAC,IAAI,EAAE,EAAE,CAAC,OAAO,CAAC,IAAI,EAAE,OAAO,EAAE,KAAK,CAAC,CAAC;gBAC9D,MAAM,EAAE,UAAU,CAAC,IAAI,CAAC,MAAM,EAAE,OAAO,CAAC;aACzC,CAAA;QACH,CAAC;QACD,KAAK,MAAM;YACT,OAAO;gBACL,IAAI,EAAE,MAAM;gBACZ,IAAI,EAAE,IAAI,CAAC,IAAI,CAAC,IAAI,EAAE,OAAO,CAAC;gBAC9B,KAAK,EAAE,IAAI,CAAC,IAAI,CAAC,KAAK,EAAE,OAAO,CAAC;gBAChC,KAAK,EAAE,IAAI,CAAC,IAAI,CAAC,KAAK,EAAE,OAAO,CAAC;aACjC,CAAA;QACH,KAAK,QAAQ;YACX,OAAO,EAAE,IAAI,EAAE,QAAQ,EAAE,OAAO,EAAE,IAAI,CAAC,OAAO,CAAC,GAAG,CAAC,CAAC,MAAM,EAAE,EAAE,CAAC,IAAI,CAAC,MAAM,EAAE,OAAO,CAAC,CAAC,EAAE,CAAA;QACzF,KAAK,MAAM;YACT,OAAO;gBACL,IAAI,EAAE,MAAM;gBACZ,KAAK,EAAE,IAAI,CAAC,IAAI,CAAC,KAAK,EAAE,OAAO,CAAC;gBAChC,GAAG,EAAE,IAAI,CAAC,IAAI,CAAC,GAAG,EAAE,OAAO,CAAC;gBAC5B,GAAG,EAAE,IAAI,CAAC,GAAG;gBACb,GAAG,EAAE,IAAI,CAAC,GAAG,KAAK,MAAM,CAAC,iBAAiB,CAAC,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC,IAAI,CAAC,GAAG;aAC5D,CAAA;QACH,KAAK,UAAU;YACb,OAAO,EAAE,IAAI,EAAE,UAAU,EAAE,KAAK,EAAE,IAAI,CAAC,IAAI,CAAC,KAAK,EAAE,OAAO,CAAC,EAAE,CAAA;QAC/D,KAAK,WAAW,EAAE,CAAC;YACjB,MAAM,KAAK,GAAG,IAAI,CAAC,IAAI,CAAC,KAAK,EAAE,OAAO,CAAC,CAAA;YACvC,IAAI,IAAI,CAAC,EAAE,KAAK,SAAS,EAAE,CAAC;gBAC1B,OAAO;oBACL,IAAI,EAAE,WAAW;oBACjB,KAAK;oBACL,MAAM,EAAE,MAAM,CAAC,IAAI,CAAC,MAAM,CAAC;oBAC3B,MAAM,EAAE,MAAM,CAAC,IAAI,CAAC,MAAM,CAAC;oBAC3B,IAAI,EAAE,IAAI,CAAC,IAAI;iBAChB,CAAA;YACH,CAAC;YACD,OAAO;gBACL,IAAI,EAAE,WAAW;gBACjB,KAAK;gBACL,MAAM,EAAE,MAAM,CAAC,IAAI,CAAC,MAAM,CAAC;gBAC3B,MAAM,EAAE,MAAM,CAAC,IAAI,CAAC,MAAM,CAAC;gBAC3B,EAAE,EAAE,MAAM,CAAC,IAAI,CAAC,EAAE,CAAC;gBACnB,IAAI,EAAE,IAAI,CAAC,IAAI;aAChB,CAAA;QACH,CAAC;QACD,KAAK,MAAM;YACT,OAAO;gBACL,IAAI,EAAE,MAAM;gBACZ,KAAK,EAAE,IAAI,CAAC,IAAI,CAAC,KAAK,EAAE,OAAO,CAAC;gBAChC,OAAO,EAAE,IAAI,CAAC,OAAO;gBACrB,IAAI,EAAE,IAAI,CAAC,IAAI;aAChB,CAAA;QACH,KAAK,OAAO;YACV,OAAO,EAAE,IAAI,EAAE,OAAO,EAAE,IAAI,EAAE,IAAI,CAAC,IAAI,EAAE,KAAK,EAAE,IAAI,CAAC,IAAI,CAAC,KAAK,EAAE,OAAO,CAAC,EAAE,CAAA;QAC7E,KAAK,SAAS,EAAE,CAAC;YACf,MAAM,QAAQ,GAAG,OAAO,CAAC,QAAQ,CAAC,GAAG,CAAC,IAAI,CAAC,CAAA;YAC3C,IAAI,QAAQ,KAAK,SAAS;gBAAE,OAAO,EAAE,IAAI,EAAE,YAAY,EAAE,EAAE,EAAE,QAAQ,EAAE,IAAI,EAAE,IAAI,CAAC,IAAI,EAAE,CAAA;YACxF,MAAM,EAAE,GAAG,OAAO,CAAC,QAAQ,CAAC,IAAI,CAAA;YAChC,OAAO,CAAC,QAAQ,CAAC,GAAG,CAAC,IAAI,EAAE,EAAE,CAAC,CAAA;YAC9B,OAAO,EAAE,IAAI,EAAE,SAAS,EAAE,EAAE,EAAE,IAAI,EAAE,IAAI,CAAC,IAAI,EAAE,IAAI,EAAE,IAAI,CAAC,OAAO,CAAC,IAAI,CAAC,EAAE,OAAO,CAAC,EAAE,CAAA;QACrF,CAAC;QACD,KAAK,OAAO;YACV,OAAO;gBACL,IAAI,EAAE,OAAO;gBACb,SAAS,EAAE,OAAO,CAAC,IAAI,CAAC,SAAS,EAAE,OAAO,CAAC;gBAC3C,KAAK,EAAE,IAAI,CAAC,KAAK,CAAC,GAAG,CAAC,CAAC,SAAS,EAAE,EAAE,CAAC,CAAC;oBACpC,GAAG,EAAE,SAAS,CAAC,GAAG;oBAClB,OAAO,EAAE,IAAI,CAAC,SAAS,CAAC,OAAO,EAAE,OAAO,CAAC;iBAC1C,CAAC,CAAC;aACJ,CAAA;QACH,KAAK,MAAM;YACT,OAAO,EAAE,IAAI,EAAE,MAAM,EAAE,KAAK,EAAE,OAAO,CAAC,IAAI,CAAC,KAAK,EAAE,OAAO,CAAC,EAAE,CAAA;QAC9D,KAAK,aAAa;YAChB,OAAO;gBACL,IAAI,EAAE,aAAa;gBACnB,KAAK,EAAE,OAAO,CAAC,IAAI,CAAC,KAAK,EAAE,OAAO,CAAC;gBACnC,KAAK,EAAE,IAAI,CAAC,IAAI,CAAC,KAAK,EAAE,OAAO,CAAC;aACjC,CAAA;IACL,CAAC;AACH,CAAC,CAAA;AAED,yDAAyD;AACzD,MAAM,CAAC,MAAM,KAAK,GAAG,CAAC,OAAwB,EAAc,EAAE,CAC5D,IAAI,CAAC,OAAO,EAAE,EAAE,MAAM,EAAE,IAAI,GAAG,EAAE,EAAE,KAAK,EAAE,IAAI,GAAG,EAAE,EAAE,QAAQ,EAAE,IAAI,GAAG,EAAE,EAAE,CAAC,CAAA;AAE7E,MAAM,WAAW,GAAG,CAAC,KAAY,EAAU,EAAE,CAC3C,SAAS,CAAC,QAAQ,CAAC,KAAK,CAAC,CAAC,CAAC,CAAC,IAAI,CAAC,SAAS,CAAC,KAAK,CAAC,CAAC,CAAC,CAAC,OAAO,CAAC,KAAK,CAAC,CAAA;AAEpE,MAAM,OAAO,GAAG,CAAC,GAAW,EAAU,EAAE,CAAC,GAAG,CAAC,IAAI,IAAI,IAAI,GAAG,CAAC,IAAI,EAAE,CAAA;AAEnE,MAAM,QAAQ,GAAG,CAAC,IAAa,EAAU,EAAE;IACzC,IAAI,IAAI,CAAC,IAAI,KAAK,KAAK;QAAE,OAAO,OAAO,CAAC,IAAI,CAAC,CAAA;IAC7C,MAAM,MAAM,GAAG,QAAQ,CAAC,IAAI,CAAC,MAAM,CAAC,CAAA;IACpC,OAAO,SAAS,CAAC,QAAQ,CAAC,IAAI,CAAC,GAAG,CAAC,IAAI,oBAAoB,CAAC,IAAI,CAAC,IAAI,CAAC,GAAG,CAAC;QACxE,CAAC,CAAC,GAAG,MAAM,IAAI,IAAI,CAAC,GAAG,EAAE;QACzB,CAAC,CAAC,GAAG,MAAM,IAAI,OAAO,CAAC,IAAI,CAAC,GAAG,CAAC,GAAG,CAAA;AACvC,CAAC,CAAA;AAED,MAAM,WAAW,GAAG,CAAC,OAAmB,EAAU,EAAE;IAClD,QAAQ,OAAO,CAAC,IAAI,EAAE,CAAC;QACrB,KAAK,KAAK;YACR,OAAO,OAAO,CAAC,OAAO,CAAC,CAAA;QACzB,KAAK,OAAO;YACV,OAAO,WAAW,CAAC,OAAO,CAAC,KAAK,CAAC,CAAA;QACnC,KAAK,QAAQ;YACX,OAAO,KAAK,OAAO,CAAC,MAAM,CAAC,GAAG,CAAC,CAAC,CAAC,GAAG,EAAE,KAAK,CAAC,EAAE,EAAE,CAAC,GAAG,GAAG,KAAK,WAAW,CAAC,KAAK,CAAC,EAAE,CAAC,CAAC,IAAI,CAAC,IAAI,CAAC,IAAI,CAAA;QAClG,KAAK,OAAO;YACV,OAAO,IAAI,OAAO,CAAC,KAAK,CAAC,GAAG,CAAC,WAAW,CAAC,CAAC,IAAI,CAAC,IAAI,CAAC,GAAG,CAAA;IAC3D,CAAC;AACH,CAAC,CAAA;AAED,MAAM,UAAU,GAAG,CAAC,GAAW,EAAE,GAAiB,EAAU,EAAE;IAC5D,IAAI,GAAG,KAAK,GAAG;QAAE,OAAO,GAAG,KAAK,CAAC,CAAC,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC,GAAG,KAAK,CAAC,CAAC,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC,IAAI,GAAG,IAAI,CAAA;IACvE,OAAO,GAAG,KAAK,GAAG,CAAC,CAAC,CAAC,IAAI,GAAG,GAAG,CAAC,CAAC,CAAC,IAAI,GAAG,IAAI,GAAG,GAAG,CAAA;AACrD,CAAC,CAAA;AAED,MAAM,QAAQ,GAAG,CAAC,GAAe,EAAU,EAAE;IAC3C,QAAQ,GAAG,CAAC,IAAI,EAAE,CAAC;QACjB,KAAK,SAAS;YACZ,OAAO,WAAW,WAAW,CAAC,GAAG,CAAC,KAAK,CAAC,EAAE,CAAA;QAC5C,KAAK,OAAO;YACV,OAAO,SAAS,GAAG,CAAC,IAAI,KAAK,GAAG,CAAC,MAAM,IAAI,GAAG,CAAC,KAAK,EAAE,CAAA;QACxD,KAAK,KAAK;YACR,OAAO,OAAO,GAAG,CAAC,KAAK,MAAM,WAAW,CAAC,GAAG,CAAC,MAAM,CAAC,EAAE,CAAA;QACxD,KAAK,MAAM;YACT,OAAO,MAAM,CAAA;QACf,KAAK,QAAQ;YACX,OAAO,QAAQ,CAAA;QACjB,KAAK,MAAM;YACT,OAAO,QAAQ,UAAU,CAAC,GAAG,CAAC,GAAG,EAAE,GAAG,CAAC,GAAG,CAAC,EAAE,CAAA;QAC/C,KAAK,UAAU;YACb,OAAO,UAAU,CAAA;QACnB,KAAK,WAAW;YACd,OAAO,GAAG,CAAC,IAAI,KAAK,SAAS,CAAC,CAAC,CAAC,WAAW,CAAC,CAAC,CAAC,aAAa,GAAG,CAAC,IAAI,EAAE,CAAA;QACvE,KAAK,MAAM;YACT,OAAO,GAAG,CAAC,IAAI,CAAC,CAAC,CAAC,MAAM,CAAC,CAAC,CAAC,eAAe,CAAA;QAC5C,KAAK,OAAO;YACV,OAAO,SAAS,GAAG,CAAC,IAAI,EAAE,CAAA;QAC5B,KAAK,SAAS;YACZ,OAAO,GAAG,CAAC,IAAI,KAAK,SAAS,CAAC,CAAC,CAAC,YAAY,GAAG,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,YAAY,GAAG,CAAC,EAAE,IAAI,GAAG,CAAC,IAAI,EAAE,CAAA;QACzF,KAAK,YAAY;YACf,OAAO,GAAG,CAAC,IAAI,KAAK,SAAS,CAAC,CAAC,CAAC,eAAe,GAAG,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,eAAe,GAAG,CAAC,EAAE,IAAI,GAAG,CAAC,IAAI,EAAE,CAAA;QAC/F,KAAK,OAAO;YACV,OAAO,SAAS,QAAQ,CAAC,GAAG,CAAC,SAAS,CAAC,EAAE,CAAA;QAC3C,KAAK,MAAM;YACT,OAAO,QAAQ,QAAQ,CAAC,GAAG,CAAC,KAAK,CAAC,EAAE,CAAA;QACtC,KAAK,aAAa;YAChB,OAAO,eAAe,QAAQ,CAAC,GAAG,CAAC,KAAK,CAAC,EAAE,CAAA;IAC/C,CAAC;AACH,CAAC,CAAA;AAED,MAAM,UAAU,GAAG,CAAC,GAAe,EAA4D,EAAE;IAC/F,QAAQ,GAAG,CAAC,IAAI,EAAE,CAAC;QACjB,KAAK,KAAK;YACR,OAAO,GAAG,CAAC,KAAK,CAAC,GAAG,CAAC,CAAC,IAAI,EAAE,EAAE,CAC5B,IAAI,CAAC,IAAI,KAAK,MAAM;gBAClB,CAAC,CAAE,CAAC,IAAI,CAAC,IAAI,IAAI,SAAS,IAAI,CAAC,IAAI,EAAE,EAAE,IAAI,CAAC,OAAO,CAAW;gBAC9D,CAAC,CAAE,CAAC,SAAS,EAAE,IAAI,CAAC,OAAO,CAAW,CACzC,CAAA;QACH,KAAK,MAAM;YACT,OAAO;gBACL,CAAC,SAAS,EAAE,GAAG,CAAC,IAAI,CAAU;gBAC9B,CAAC,SAAS,EAAE,GAAG,CAAC,KAAK,CAAU;gBAC/B,CAAC,SAAS,EAAE,GAAG,CAAC,KAAK,CAAU;aAChC,CAAA;QACH,KAAK,QAAQ;YACX,OAAO,GAAG,CAAC,OAAO,CAAC,GAAG,CAAC,CAAC,MAAM,EAAE,EAAE,CAAC,CAAC,SAAS,EAAE,MAAM,CAAU,CAAC,CAAA;QAClE,KAAK,MAAM;YACT,OAAO,CAAC,CAAC,SAAS,EAAE,GAAG,CAAC,KAAK,CAAU,EAAE,CAAC,KAAK,EAAE,GAAG,CAAC,GAAG,CAAU,CAAC,CAAA;QACrE,KAAK,UAAU,CAAC;QAChB,KAAK,WAAW,CAAC;QACjB,KAAK,MAAM,CAAC;QACZ,KAAK,OAAO,CAAC;QACb,KAAK,aAAa;YAChB,OAAO,CAAC,CAAC,SAAS,EAAE,GAAG,CAAC,KAAK,CAAU,CAAC,CAAA;QAC1C,KAAK,SAAS;YACZ,OAAO,CAAC,CAAC,SAAS,EAAE,GAAG,CAAC,IAAI,CAAU,CAAC,CAAA;QACzC,KAAK,OAAO;YACV,OAAO,GAAG,CAAC,KAAK,CAAC,GAAG,CAClB,CAAC,SAAS,EAAE,EAAE,CAAC,CAAC,GAAG,WAAW,CAAC,SAAS,CAAC,GAAG,CAAC,KAAK,EAAE,SAAS,CAAC,OAAO,CAAU,CAChF,CAAA;QACH,KAAK,SAAS,CAAC;QACf,KAAK,OAAO,CAAC;QACb,KAAK,MAAM,CAAC;QACZ,KAAK,YAAY;YACf,OAAO,EAAE,CAAA;IACb,CAAC;AACH,CAAC,CAAA;AAED,MAAM,UAAU,GAAG,CAAC,GAAe,EAAU,EAAE;IAC7C,MAAM,KAAK,GAAkB,CAAC,QAAQ,CAAC,GAAG,CAAC,CAAC,CAAA;IAC5C,MAAM,KAAK,GAAG,CAAC,IAAgB,EAAE,OAAe,EAAQ,EAAE;QACxD,MAAM,QAAQ,GAAG,UAAU,CAAC,IAAI,CAAC,CAAA;QACjC,QAAQ,CAAC,OAAO,CAAC,CAAC,CAAC,KAAK,EAAE,KAAK,CAAC,EAAE,KAAK,EAAE,EAAE;YACzC,MAAM,IAAI,GAAG,KAAK,KAAK,QAAQ,CAAC,MAAM,GAAG,CAAC,CAAA;YAC1C,KAAK,CAAC,IAAI,CACR,GAAG,OAAO,GAAG,IAAI,CAAC,CAAC,CAAC,KAAK,CAAC,CAAC,CAAC,KAAK,GAAG,KAAK,KAAK,SAAS,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC,GAAG,KAAK,GAAG,GAAG,QAAQ,CAAC,KAAK,CAAC,EAAE,CAC/F,CAAA;YACD,KAAK,CAAC,KAAK,EAAE,GAAG,OAAO,GAAG,IAAI,CAAC,CAAC,CAAC,KAAK,CAAC,CAAC,CAAC,KAAK,EAAE,CAAC,CAAA;QACnD,CAAC,CAAC,CAAA;IACJ,CAAC,CAAA;IACD,KAAK,CAAC,GAAG,EAAE,EAAE,CAAC,CAAA;IACd,OAAO,KAAK,CAAC,IAAI,CAAC,IAAI,CAAC,CAAA;AACzB,CAAC,CAAA;AAED,yEAAyE;AACzE,MAAM,CAAC,MAAM,SAAS,GAAG,CAAC,OAAwB,EAAU,EAAE,CAAC,UAAU,CAAC,KAAK,CAAC,OAAO,CAAC,CAAC,CAAA"}