@thomasfosterau/effect-parse 0.2.0 → 0.4.0

package/dist/Syntax.js.map

@@ -1 +1 @@
-{"version":3,"file":"Syntax.js","names":[],"sources":["../src/Syntax.ts"],"sourcesContent":["/**\n * Concrete syntax trees and incremental parsing, in the spirit of\n * [Tree-sitter](https://tree-sitter.github.io).\n *\n * Mark the rules of a grammar that should appear in the tree with\n * {@link node} (and, optionally, {@link token} and {@link field}). Outside\n * this module the marks change nothing: `Parser.parse` returns the same\n * values, and compiled parsers compile them away. {@link parse} runs the\n * grammar and returns a {@link Tree}: a tree of {@link SyntaxNode}s with\n * spans, parents and siblings, to search by position (`descendantAt`) or walk\n * with a {@link TreeCursor}. Each node also carries the value its parser\n * returned.\n *\n * Like Tree-sitter, a syntax parse always produces a tree. Failures handled\n * by `Parser.resumeAfter` and `Parser.retryAfter` become `ERROR` nodes over\n * the input they skipped, and so does any input after a fatal failure.\n *\n * After an edit, {@link reparse} (or {@link replace}) parses the new input\n * reusing every node of the old tree whose input is unchanged: only the\n * nodes that enclose the edit, or looked at the edited input, are parsed\n * again, and each reused node is stepped over whole.\n *\n * @example\n * ```ts\n * import { Ascii, Parser, Syntax, Token } from \"@thomasfosterau/effect-parse\"\n *\n * const ws = Ascii.multispace0\n * const number = Syntax.node(Ascii.decInt, \"number\")\n * const list = Syntax.node(\n *   Parser.delimited(\n *     Token.literal(\"[\"),\n *     Parser.separated(Parser.delimited(ws, number, ws), Token.literal(\",\")),\n *     Token.literal(\"]\")\n *   ),\n *   \"list\"\n * )\n *\n * const tree = Syntax.parse(list, \"[1, 2, 3]\")\n * String(tree.root) // \"(list (number) (number) (number))\"\n * tree.root.descendantAt(4)?.text // \"2\"\n *\n * const edited = Syntax.replace(tree, 4, 5, \"20\") // \"[1, 20, 3]\"\n * edited.root.namedChild(1)?.value // 20\n * edited.reused // 2: only \"20\" was parsed again\n * ```\n *\n * @since 0.2.0\n */\nimport * as Predicate from \"effect/Predicate\"\nimport type * as Context from \"effect/Context\"\nimport { dual } from \"effect/Function\"\nimport * as Option from \"effect/Option\"\nimport type { Input, Slice, Source } from \"./Input.js\"\nimport { Fail, fromSource } from \"./Input.js\"\nimport * as ParseError from \"./ParseError.js\"\nimport { nodeOf } from \"./internal/node.js\"\nimport * as Stack from \"./internal/stack.js\"\nimport type { ErrorInfo, Green, Previous, Segment } from \"./internal/syntax.js\"\nimport { absolute, errorKind, SyntaxState } from \"./internal/syntax.js\"\nimport type { Parser } from \"./Parser.js\"\nimport { described, isParser } from \"./Parser.js\"\n\n// -----------------------------------------------------------------------------\n// Grammar annotations\n// -----------------------------------------------------------------------------\n\nconst syntaxNode = (self: Parser.Any, kind: string, named: boolean): Parser.Any => {\n  const step = self.step\n  // Identifies the nodes this parser builds, so a reparse can reuse them\n  const key = {}\n  return described<unknown, unknown, unknown, Input>(\n    (state) => {\n      const builder = state.syntax\n      return builder === undefined ? step(state) : builder.node(state, step, key, kind, named)\n    },\n    self.name,\n    { _tag: \"Syntax\", self, kind, named }\n  )\n}\n\n/**\n * Marks a parser as a rule of the syntax tree: in a {@link parse}, each\n * match becomes a named node of the given kind, spanning the input it\n * consumed, with the nodes built inside it as children and its output as\n * its `value`. Outside {@link parse}, the parser is unchanged.\n *\n * A match that consumes nothing adds no node (as in Tree-sitter, where rules\n * can't match the empty string).\n *\n * For {@link reparse} to reuse a node, its parser's output must depend only\n * on the input from where the node starts: not on services, on state kept\n * in closures, or on absolute offsets (`Parser.location`, `Parser.span`),\n * which are not updated when the node moves. Use the node's `start` and\n * `end` instead.\n *\n * @since 0.2.0\n * @category annotations\n */\nexport const node: {\n  (kind: string): <A, E, R, I extends Input>(self: Parser<A, E, R, I>) => Parser<A, E, R, I>\n  <A, E, R, I extends Input>(self: Parser<A, E, R, I>, kind: string): Parser<A, E, R, I>\n} = /*#__PURE__*/ dual(\n  2,\n  <A, E, R, I extends Input>(self: Parser<A, E, R, I>, kind: string): Parser<A, E, R, I> =>\n    syntaxNode(self, kind, true) as Parser<A, E, R, I>\n)\n\n/**\n * Like {@link node}, but builds an *anonymous* node, Tree-sitter's name for\n * punctuation and keywords: anonymous nodes are left out of\n * `namedChildren` and of the tree's printed form. The kind defaults to the\n * literal for a `Token.literal` of a string, and to the parser's name\n * otherwise.\n *\n * @example\n * ```ts\n * import { Syntax, Token } from \"@thomasfosterau/effect-parse\"\n *\n * const comma = Syntax.token(Token.literal(\",\")) // kind \",\"\n * ```\n *\n * @since 0.2.0\n * @category annotations\n */\nexport const token: {\n  (kind?: string): <A, E, R, I extends Input>(self: Parser<A, E, R, I>) => Parser<A, E, R, I>\n  <A, E, R, I extends Input>(self: Parser<A, E, R, I>, kind?: string): Parser<A, E, R, I>\n} = /*#__PURE__*/ dual(\n  (args) => isParser(args[0]),\n  <A, E, R, I extends Input>(self: Parser<A, E, R, I>, kind?: string): Parser<A, E, R, I> =>\n    syntaxNode(self, kind ?? defaultTokenKind(self), false) as Parser<A, E, R, I>\n)\n\nconst defaultTokenKind = (self: Parser.Any): string => {\n  const n = nodeOf(self)\n  if (n._tag === \"Literal\" && Predicate.isString(n.literal) && !n.caseless) return n.literal\n  return self.name ?? \"token\"\n}\n\n/**\n * Gives the nodes built by a parser a field name in their parent, like\n * Tree-sitter's `field(name, rule)`: find them with `childByField` and\n * `childrenByField`. Outside {@link parse}, the parser is unchanged.\n *\n * @example\n * ```ts\n * import { Ascii, Parser, Syntax, Token } from \"@thomasfosterau/effect-parse\"\n *\n * const name = Syntax.node(Ascii.alpha1, \"name\")\n * const number = Syntax.node(Ascii.decInt, \"number\")\n * const pair = Syntax.node(\n *   Parser.separatedPair(Syntax.field(name, \"key\"), Token.literal(\"=\"), Syntax.field(number, \"value\")),\n *   \"pair\"\n * )\n * Syntax.parse(pair, \"x=1\").root.childByField(\"value\")?.value // 1\n * ```\n *\n * @since 0.2.0\n * @category annotations\n */\nexport const field: {\n  (name: string): <A, E, R, I extends Input>(self: Parser<A, E, R, I>) => Parser<A, E, R, I>\n  <A, E, R, I extends Input>(self: Parser<A, E, R, I>, name: string): Parser<A, E, R, I>\n} = /*#__PURE__*/ dual(2, <A, E, R, I extends Input>(self: Parser<A, E, R, I>, name: string): Parser<A, E, R, I> => {\n  const step = self.step\n  return described<A, E, R, I>(\n    (state) => {\n      const builder = state.syntax\n      return (builder === undefined ? step(state) : builder.field(state, step, name)) as A | typeof Fail\n    },\n    self.name,\n    { _tag: \"Syntax\", self, kind: undefined, named: false }\n  )\n})\n\n// -----------------------------------------------------------------------------\n// Trees\n// -----------------------------------------------------------------------------\n\n/**\n * The kind of the nodes that stand for input that could not be parsed.\n *\n * @since 0.2.0\n * @category models\n */\nexport const ERROR: \"ERROR\" = errorKind\n\n/**\n * An edit to an input, as Tree-sitter's `TSInputEdit`: the input\n * `[start, oldEnd)` was replaced by `[start, newEnd)`. Offsets are in the\n * input's units (UTF-16 code units for strings, bytes, elements).\n *\n * @since 0.2.0\n * @category models\n */\nexport interface Edit {\n  readonly start: number\n  readonly oldEnd: number\n  readonly newEnd: number\n}\n\n/**\n * Options for {@link parse}.\n *\n * @since 0.2.0\n * @category models\n */\nexport interface ParseOptions {\n  /**\n   * The kind of the root node, when the grammar itself is not a\n   * {@link node}. Defaults to `\"document\"`.\n   */\n  readonly kind?: string | undefined\n  /**\n   * For {@link reparse}: how many input units custom parsers may read past\n   * the furthest position they move the cursor to or record a failure at,\n   * besides one token there. Defaults to 0, which is right for the built-in\n   * parsers, and for custom parsers (`Parser.make`) that only read past\n   * where they stop to see that the token there doesn't match.\n   *\n   * A node is reused only when the input its parse looked at is unchanged.\n   * Built-in parsers that read further, such as a literal that fails part\n   * way or `Token.takeUntil`, record how far they read.\n   */\n  readonly lookahead?: number | undefined\n}\n\n/**\n * Options for {@link parse} with a parser that requires services.\n *\n * @since 0.2.0\n * @category models\n */\nexport interface ParseOptionsWithContext<R> extends ParseOptions {\n  readonly context: Context.Context<R>\n}\n\ninterface Config {\n  readonly kind: string\n  readonly inner: Parser.Any\n  readonly lookahead: number\n  readonly context: Context.Context<never> | undefined\n}\n\n/**\n * The result of a {@link parse}: a syntax tree over the whole input, the\n * grammar's output, and the errors met on the way.\n *\n * @since 0.2.0\n * @category models\n */\nexport class Tree<out A, out E = never, I extends Input = string> {\n  /** The root node. It always spans the whole input. */\n  readonly root: SyntaxNode<I>\n  private lines: Array<number> | undefined\n  private errorList: ReadonlyArray<ParseError.ParseError<E>> | undefined\n\n  /** @internal */\n  constructor(\n    /** The input the tree was parsed from. */\n    readonly input: I,\n    /** The grammar's output: `none` when the parse failed. */\n    readonly value: Option.Option<A>,\n    /** How many nodes were reused from the previous tree by {@link reparse}. */\n    readonly reused: number,\n    /** @internal */\n    readonly green: Green,\n    /** @internal */\n    readonly config: Config,\n    /** @internal */\n    readonly encoding: ParseError.ParseError<never>[\"encoding\"]\n  ) {\n    this.root = new SyntaxNode(this, green, 0, undefined, 0)\n  }\n\n  /**\n   * Every error of the parse, in input order: the failures recovered by\n   * `Parser.resumeAfter` and `Parser.retryAfter`, then the fatal one, if\n   * the parse failed. Each one belongs to an `ERROR` node.\n   */\n  get errors(): ReadonlyArray<ParseError.ParseError<E>> {\n    if (this.errorList === undefined) {\n      const out: Array<ParseError.ParseError<E>> = []\n      const visit = (green: Green, start: number) => {\n        if (!green.hasError) return\n        if (green.error !== undefined) out.push(this.toError(green.error, start))\n        for (let i = 0; i < green.children.length; i++) visit(green.children[i], start + green.offsets[i])\n      }\n      visit(this.green, 0)\n      this.errorList = out\n    }\n    return this.errorList\n  }\n\n  /** Whether the tree has any `ERROR` node. */\n  get hasErrors(): boolean {\n    return this.green.hasError\n  }\n\n  /** The smallest node containing `[start, end)` (see {@link SyntaxNode.descendantAt}). */\n  descendantAt(start: number, end?: number): SyntaxNode<I> {\n    return this.root.descendantAt(start, end)\n  }\n\n  /** A cursor at the root. */\n  walk(): TreeCursor<I> {\n    return new TreeCursor(this.root)\n  }\n\n  /**\n   * The 1-based line and column (in code points) of an offset, as in\n   * `ParseError`. Lines of a string input are indexed once, so lookups take\n   * logarithmic time.\n   */\n  lineColumn(offset: number): ParseError.LineColumn {\n    const input = this.input\n    if (!Predicate.isString(input)) return ParseError.lineColumn(input, offset, this.encoding)\n    let lines = this.lines\n    if (lines === undefined) {\n      lines = [0]\n      for (let i = input.indexOf(\"\\n\"); i >= 0; i = input.indexOf(\"\\n\", i + 1)) lines.push(i + 1)\n      this.lines = lines\n    }\n    const at = Math.max(0, Math.min(offset, input.length))\n    let lo = 0\n    let hi = lines.length - 1\n    while (lo < hi) {\n      const mid = (lo + hi + 1) >> 1\n      if (lines[mid] <= at) lo = mid\n      else hi = mid - 1\n    }\n    const lineStart = lines[lo]\n    return { line: lo + 1, column: ParseError.lineColumn(input.slice(lineStart, at), at - lineStart).column }\n  }\n\n  /** The root's S-expression (see {@link SyntaxNode.toString}). */\n  toString(): string {\n    return this.root.toString()\n  }\n\n  /** @internal */\n  toError(error: ErrorInfo, start: number): ParseError.ParseError<E> {\n    return ParseError.fromFailure<E>(this.input, absolute(error.failure, start), error.mode, this.encoding)\n  }\n}\n\n/**\n * A node of a syntax tree: its kind, span and value, and its place in the\n * tree. Nodes are views built on demand; two views of the same node are\n * different objects but have the same `start`, `end` and `kind`.\n *\n * @since 0.2.0\n * @category models\n */\nexport class SyntaxNode<I extends Input = string> {\n  private childList: ReadonlyArray<SyntaxNode<I>> | undefined\n\n  /** @internal */\n  constructor(\n    /** The tree this node belongs to. */\n    readonly tree: Tree<unknown, unknown, I>,\n    /** @internal */\n    readonly green: Green,\n    /** The offset where the node starts. */\n    readonly start: number,\n    /** The parent node; `undefined` for the root. */\n    readonly parent: SyntaxNode<I> | undefined,\n    /** The node's index among its parent's children. */\n    readonly index: number\n  ) {}\n\n  /** The node's kind: the name given to {@link node} or {@link token}, or `\"ERROR\"`. */\n  get kind(): string {\n    return this.green.kind\n  }\n\n  /** `false` for the anonymous nodes built by {@link token}. */\n  get named(): boolean {\n    return this.green.named\n  }\n\n  /** The field name given by {@link field}, if any. */\n  get field(): string | undefined {\n    return this.parent?.green.fields?.[this.index]\n  }\n\n  /** The offset where the node ends (exclusive). */\n  get end(): number {\n    return this.start + this.green.width\n  }\n\n  /** The number of input units the node spans. */\n  get length(): number {\n    return this.green.width\n  }\n\n  /** The output of the node's parser (`undefined` for `ERROR` nodes, and for a root that failed). */\n  get value(): unknown {\n    return this.green.value\n  }\n\n  /** The input the node spans. */\n  get text(): Slice<I> {\n    const input = this.tree.input as any\n    return input instanceof Uint8Array\n      ? (input.subarray(this.start, this.end) as any)\n      : input.slice(this.start, this.end)\n  }\n\n  /** Whether this is an `ERROR` node. */\n  get isError(): boolean {\n    return this.green.error !== undefined\n  }\n\n  /** Whether this node or a descendant is an `ERROR` node. */\n  get hasError(): boolean {\n    return this.green.hasError\n  }\n\n  /** For an `ERROR` node, the error it stands for. */\n  get error(): ParseError.ParseError<unknown> | undefined {\n    const error = this.green.error\n    return error === undefined ? undefined : this.tree.toError(error, this.start)\n  }\n\n  /** The child nodes, named and anonymous, in input order. */\n  get children(): ReadonlyArray<SyntaxNode<I>> {\n    if (this.childList === undefined) {\n      const green = this.green\n      const out = new Array<SyntaxNode<I>>(green.children.length)\n      for (let i = 0; i < out.length; i++) out[i] = this.makeChild(i)\n      this.childList = out\n    }\n    return this.childList\n  }\n\n  /** The number of children. */\n  get childCount(): number {\n    return this.green.children.length\n  }\n\n  /** The child at `index` (negative indices count from the end). */\n  child(index: number): SyntaxNode<I> | undefined {\n    const n = this.green.children.length\n    const i = index < 0 ? n + index : index\n    return i >= 0 && i < n ? this.children[i] : undefined\n  }\n\n  /** The named children. */\n  get namedChildren(): ReadonlyArray<SyntaxNode<I>> {\n    return this.children.filter((c) => c.named)\n  }\n\n  /** The named child at `index`. */\n  namedChild(index: number): SyntaxNode<I> | undefined {\n    return this.namedChildren[index]\n  }\n\n  /** The first child with the given field name. */\n  childByField(name: string): SyntaxNode<I> | undefined {\n    const fields = this.green.fields\n    if (fields === undefined) return undefined\n    const i = fields.indexOf(name)\n    return i < 0 ? undefined : this.children[i]\n  }\n\n  /** The children with the given field name. */\n  childrenByField(name: string): ReadonlyArray<SyntaxNode<I>> {\n    const fields = this.green.fields\n    if (fields === undefined) return []\n    return this.children.filter((_, i) => fields[i] === name)\n  }\n\n  /** The next sibling, named or anonymous. */\n  get nextSibling(): SyntaxNode<I> | undefined {\n    return this.parent?.children[this.index + 1]\n  }\n\n  /** The previous sibling, named or anonymous. */\n  get previousSibling(): SyntaxNode<I> | undefined {\n    return this.index > 0 ? this.parent?.children[this.index - 1] : undefined\n  }\n\n  /** The next named sibling. */\n  get nextNamedSibling(): SyntaxNode<I> | undefined {\n    const siblings = this.parent?.children\n    if (siblings === undefined) return undefined\n    for (let i = this.index + 1; i < siblings.length; i++) if (siblings[i].named) return siblings[i]\n    return undefined\n  }\n\n  /** The previous named sibling. */\n  get previousNamedSibling(): SyntaxNode<I> | undefined {\n    const siblings = this.parent?.children\n    if (siblings === undefined) return undefined\n    for (let i = this.index - 1; i >= 0; i--) if (siblings[i].named) return siblings[i]\n    return undefined\n  }\n\n  /**\n   * The index of the child containing the input unit at `offset`, or -1.\n   * Takes logarithmic time.\n   */\n  childIndexAt(offset: number): number {\n    const green = this.green\n    const offsets = green.offsets\n    const rel = offset - this.start\n    let lo = 0\n    let hi = offsets.length - 1\n    let found = -1\n    while (lo <= hi) {\n      const mid = (lo + hi) >> 1\n      if (offsets[mid] <= rel) {\n        found = mid\n        lo = mid + 1\n      } else {\n        hi = mid - 1\n      }\n    }\n    // Skip back over empty `ERROR` nodes at `offset`\n    while (found >= 0 && green.children[found].width === 0 && offsets[found] === rel) found--\n    return found >= 0 && rel < offsets[found] + green.children[found].width ? found : -1\n  }\n\n  /** The child containing the input unit at `offset`. */\n  childAt(offset: number): SyntaxNode<I> | undefined {\n    const i = this.childIndexAt(offset)\n    return i < 0 ? undefined : this.children[i]\n  }\n\n  /**\n   * The smallest node, this one or a descendant, that contains\n   * `[start, end)` (Tree-sitter's `descendant_for_byte_range`). With only\n   * `start`, the deepest node containing the input unit at `start`. Takes\n   * time proportional to the depth of the tree times the logarithm of the\n   * number of children.\n   */\n  descendantAt(start: number, end: number = start + 1): SyntaxNode<I> {\n    return descendantOf(this, start, end)\n  }\n\n  /** Like {@link descendantAt}, but only stops at named nodes. */\n  namedDescendantAt(start: number, end: number = start + 1): SyntaxNode<I> {\n    let node: SyntaxNode<I> = this.descendantAt(start, end)\n    // Every node below `this` has a parent, so the walk stops at `this` at the latest\n    while (!node.named && node !== this) node = node.parent ?? this\n    return node\n  }\n\n  /** This node and its descendants, in pre-order. */\n  *descendants(): Generator<SyntaxNode<I>, void, undefined> {\n    const cursor = this.walk()\n    while (true) {\n      yield cursor.node\n      if (cursor.gotoFirstChild()) continue\n      while (!cursor.gotoNextSibling()) {\n        if (!cursor.gotoParent()) return\n      }\n    }\n  }\n\n  /** The descendants of the given kind, in pre-order. */\n  *descendantsOfKind(kind: string): Generator<SyntaxNode<I>, void, undefined> {\n    for (const n of this.descendants()) if (n.kind === kind) yield n\n  }\n\n  /** A cursor at this node, which cannot move above it. */\n  walk(): TreeCursor<I> {\n    return new TreeCursor(this)\n  }\n\n  /**\n   * The node as an S-expression of its named descendants, with field\n   * names, as Tree-sitter prints it: `(pair key: (name) value: (number))`.\n   */\n  toString(): string {\n    let out = \"\"\n    const visit = (green: Green, field: string | undefined) => {\n      if (green.named || green === this.green) {\n        if (out.length > 0) out += \" \"\n        if (field !== undefined) out += `${field}: `\n        out += `(${green.kind}`\n        for (let i = 0; i < green.children.length; i++) visit(green.children[i], green.fields?.[i])\n        out += \")\"\n      } else {\n        for (let i = 0; i < green.children.length; i++) visit(green.children[i], green.fields?.[i])\n      }\n    }\n    visit(this.green, this.field)\n    return out\n  }\n\n  toJSON(): unknown {\n    return { kind: this.kind, start: this.start, end: this.end }\n  }\n\n  private makeChild(i: number): SyntaxNode<I> {\n    const green = this.green\n    return new SyntaxNode(this.tree, green.children[i], this.start + green.offsets[i], this, i)\n  }\n}\n\n/** The smallest node, `root` or a descendant, that contains `[start, end)` (see `SyntaxNode.descendantAt`). */\nconst descendantOf = <I extends Input>(root: SyntaxNode<I>, start: number, end: number): SyntaxNode<I> => {\n  let node = root\n  while (true) {\n    const i = node.childIndexAt(start)\n    if (i < 0) return node\n    const child = node.children[i]\n    if (end > child.end) return node\n    node = child\n  }\n}\n\n/**\n * A cursor for walking a tree, as Tree-sitter's `TreeCursor`. It starts at\n * a node and cannot move above it.\n *\n * @since 0.2.0\n * @category models\n */\nexport class TreeCursor<I extends Input = string> {\n  private current: SyntaxNode<I>\n  private depth = 0\n\n  /** @internal */\n  constructor(node: SyntaxNode<I>) {\n    this.current = node\n  }\n\n  /** The node at the cursor. */\n  get node(): SyntaxNode<I> {\n    return this.current\n  }\n\n  /** The field name of the node at the cursor, if any. */\n  get field(): string | undefined {\n    return this.depth === 0 ? undefined : this.current.field\n  }\n\n  /** Moves to the first child; `false` if there is none. */\n  gotoFirstChild(): boolean {\n    return this.goto(this.current.child(0))\n  }\n\n  /** Moves to the last child; `false` if there is none. */\n  gotoLastChild(): boolean {\n    return this.goto(this.current.child(-1))\n  }\n\n  /** Moves to the child containing the input unit at `offset`; `false` if there is none. */\n  gotoFirstChildForOffset(offset: number): boolean {\n    return this.goto(this.current.childAt(offset))\n  }\n\n  /** Moves to the next sibling; `false` if there is none. */\n  gotoNextSibling(): boolean {\n    if (this.depth === 0) return false\n    const next = this.current.nextSibling\n    if (next === undefined) return false\n    this.current = next\n    return true\n  }\n\n  /** Moves to the previous sibling; `false` if there is none. */\n  gotoPreviousSibling(): boolean {\n    if (this.depth === 0) return false\n    const previous = this.current.previousSibling\n    if (previous === undefined) return false\n    this.current = previous\n    return true\n  }\n\n  /** Moves to the parent; `false` at the node the cursor started at. */\n  gotoParent(): boolean {\n    const parent = this.current.parent\n    if (this.depth === 0 || parent === undefined) return false\n    this.current = parent\n    this.depth--\n    return true\n  }\n\n  /** Moves to the deepest node containing the input unit at `offset`. */\n  gotoDescendantAt(offset: number): void {\n    while (this.gotoFirstChildForOffset(offset)) {\n      // descend\n    }\n  }\n\n  /** Starts again at `node`. */\n  reset(node: SyntaxNode<I>): void {\n    this.current = node\n    this.depth = 0\n  }\n\n  private goto(node: SyntaxNode<I> | undefined): boolean {\n    if (node === undefined) return false\n    this.current = node\n    this.depth++\n    return true\n  }\n}\n\n// -----------------------------------------------------------------------------\n// Parsing\n// -----------------------------------------------------------------------------\n\nconst expectedEof = [\"end of input\"]\n\nconst run = <A, E, I extends Input>(config: Config, input: I, previous: Previous | undefined): Tree<A, E, I> => {\n  const state = new SyntaxState<I>(input, { context: config.context }, previous)\n  const a = Stack.run(config.inner.step, state)\n  // Text parsers record the encoding when they fail, which they may have done inside reused nodes\n  if (state.encoding === undefined && previous !== undefined) state.encoding = previous.encoding\n  let fatal: ErrorInfo | undefined\n  let value: Option.Option<A> = Option.none()\n  if (a === Fail) {\n    fatal = { failure: state.reportedFailure(), mode: state.mode }\n  } else if (state.pos < state.end) {\n    state.backtrack(\"Eof\", expectedEof)\n    fatal = { failure: state.reportedFailure(), mode: \"Backtrack\" }\n  } else {\n    value = Option.some(a as A)\n  }\n  const green = state.finish(config.kind, Option.getOrUndefined(value), fatal, state.pos)\n  return new Tree<A, E, I>(input, value, state.reused, green, config, state.encoding)\n}\n\n/**\n * Parses an input into a syntax {@link Tree}. The grammar's output is the\n * tree's `value`, and its {@link node}s are the tree's nodes. When the\n * grammar is itself a {@link node}, that node is the root; otherwise the\n * root is a node of kind `options.kind` (by default `\"document\"`).\n *\n * The parse never fails: recovered failures (see `Parser.resumeAfter`), a\n * fatal failure and unparsed input at the end all become `ERROR` nodes, and\n * are listed in `tree.errors`. The parse is interpreted, never compiled.\n *\n * @since 0.2.0\n * @category parsing\n */\nexport const parse: {\n  <A, E, I extends Input>(\n    grammar: Parser<A, E, never, I>,\n    input: NoInfer<Source<I>>,\n    options?: ParseOptions\n  ): Tree<A, E, I>\n  <A, E, R, I extends Input>(\n    grammar: Parser<A, E, R, I>,\n    input: NoInfer<Source<I>>,\n    options: ParseOptionsWithContext<R>\n  ): Tree<A, E, I>\n} = <A, E, R, I extends Input>(\n  grammar: Parser<A, E, R, I>,\n  input: I | Source<I>,\n  options?: ParseOptions & { readonly context?: Context.Context<R> }\n): Tree<A, E, I> => {\n  const n = nodeOf(grammar)\n  const isRoot = n._tag === \"Syntax\" && n.kind !== undefined && n.named\n  const config: Config = {\n    kind: isRoot ? n.kind : (options?.kind ?? \"document\"),\n    inner: isRoot ? (n.self as Parser.Any) : grammar,\n    lookahead: options?.lookahead ?? 0,\n    context: options?.context as Context.Context<never> | undefined\n  }\n  return run(config, fromSource(input as Input) as I, undefined)\n}\n\n/**\n * Parses the new version of a tree's input, reusing the nodes of the tree\n * that the edits leave unchanged (Tree-sitter's `ts_tree_edit` followed by\n * `ts_parser_parse` with the old tree). The result is the tree a fresh\n * {@link parse} of `input` would build, but only the parts of the tree\n * around the edits are parsed again. `tree.reused` says how many nodes were\n * reused.\n *\n * `edits` describe how the old input became the new one, applied in order,\n * each in the coordinates of the input as the previous edits left it. When\n * they are omitted, the edit is found by comparing the inputs (their common\n * prefix and suffix), which takes time linear in their length but much less\n * than parsing.\n *\n * Errors in the new tree are those a fresh parse reports, except that an\n * error just after a reused node may list fewer expected alternatives.\n *\n * @example\n * ```ts\n * import { Ascii, Syntax } from \"@thomasfosterau/effect-parse\"\n *\n * const number = Syntax.node(Ascii.decInt, \"number\")\n * const tree = Syntax.parse(number, \"12\")\n * Syntax.reparse(tree, \"123\", [{ start: 2, oldEnd: 2, newEnd: 3 }]).root.value // 123\n * ```\n *\n * @since 0.2.0\n * @category parsing\n */\nexport const reparse = <A, E, I extends Input>(\n  tree: Tree<A, E, I>,\n  input: NoInfer<Source<I>>,\n  edits?: Edit | ReadonlyArray<Edit>\n): Tree<A, E, I> => {\n  const next = fromSource(input as Input) as I\n  const list =\n    edits === undefined\n      ? diffList(tree.input, next)\n      : \"start\" in edits\n        ? [edits as Edit]\n        : (edits as ReadonlyArray<Edit>)\n  const previous: Previous = {\n    root: tree.green,\n    oldLength: tree.input.length,\n    newLength: next.length,\n    segments: segmentsOf(tree.input.length, next.length, list),\n    input: tree.input,\n    extra: tree.config.lookahead,\n    encoding: tree.encoding\n  }\n  return run(tree.config, next, previous)\n}\n\n/**\n * Replaces `[start, end)` of a tree's string input with `text` and parses\n * the result incrementally (see {@link reparse}).\n *\n * @since 0.2.0\n * @category parsing\n */\nexport const replace = <A, E>(\n  tree: Tree<A, E, string>,\n  start: number,\n  end: number,\n  text: string\n): Tree<A, E, string> => {\n  const input = tree.input\n  if (start < 0 || end < start || end > input.length) {\n    throw new RangeError(`invalid range [${start}, ${end}) of an input of length ${input.length}`)\n  }\n  return reparse(tree, input.slice(0, start) + text + input.slice(end), {\n    start,\n    oldEnd: end,\n    newEnd: start + text.length\n  })\n}\n\n/**\n * Finds the edit that turns `before` into `after`: the part between their\n * longest common prefix and suffix. `undefined` when they are equal.\n *\n * @since 0.2.0\n * @category parsing\n */\nexport const diff = <I extends Input>(before: I, after: I): Edit | undefined => {\n  const a = before as any\n  const b = after as any\n  const at = Predicate.isString(a) ? (s: string, i: number) => s.charCodeAt(i) : (s: any, i: number) => s[i]\n  const max = Math.min(a.length, b.length)\n  let prefix = 0\n  while (prefix < max && at(a, prefix) === at(b, prefix)) prefix++\n  if (prefix === a.length && prefix === b.length) return undefined\n  let suffix = 0\n  while (suffix < max - prefix && at(a, a.length - 1 - suffix) === at(b, b.length - 1 - suffix)) suffix++\n  return { start: prefix, oldEnd: a.length - suffix, newEnd: b.length - suffix }\n}\n\nconst diffList = (before: Input, after: Input): ReadonlyArray<Edit> => {\n  const edit = diff(before, after)\n  return edit === undefined ? [] : [edit]\n}\n\n/** The stretches of the new input copied unchanged from the old one. */\nconst segmentsOf = (oldLength: number, newLength: number, edits: ReadonlyArray<Edit>): Array<Segment> => {\n  let segments: Array<Segment> = oldLength > 0 ? [{ newStart: 0, oldStart: 0, length: oldLength }] : []\n  let length = oldLength\n  for (const { newEnd, oldEnd, start } of edits) {\n    if (!(start >= 0 && oldEnd >= start && oldEnd <= length && newEnd >= start)) {\n      throw new RangeError(\n        `invalid edit { start: ${start}, oldEnd: ${oldEnd}, newEnd: ${newEnd} } of an input of length ${length}`\n      )\n    }\n    const delta = newEnd - oldEnd\n    const out: Array<Segment> = []\n    for (const s of segments) {\n      const end = s.newStart + s.length\n      if (s.newStart < start) {\n        out.push({ newStart: s.newStart, oldStart: s.oldStart, length: Math.min(end, start) - s.newStart })\n      }\n      if (end > oldEnd) {\n        const from = Math.max(s.newStart, oldEnd)\n        out.push({ newStart: from + delta, oldStart: s.oldStart + (from - s.newStart), length: end - from })\n      }\n    }\n    segments = out\n    length += delta\n  }\n  if (length !== newLength) {\n    throw new RangeError(`the edits give an input of length ${length}, but the new input has length ${newLength}`)\n  }\n  return segments\n}\n"],"mappings":";;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;AAkEA,MAAM,cAAc,MAAkB,MAAc,UAA+B;CACjF,MAAM,OAAO,KAAK;CAElB,MAAM,MAAM,CAAC;CACb,OAAO,WACJ,UAAU;EACT,MAAM,UAAU,MAAM;EACtB,OAAO,YAAY,KAAA,IAAY,KAAK,KAAK,IAAI,QAAQ,KAAK,OAAO,MAAM,KAAK,MAAM,KAAK;CACzF,GACA,KAAK,MACL;EAAE,MAAM;EAAU;EAAM;EAAM;CAAM,CACtC;AACF;;;;;;;;;;;;;;;;;;;AAoBA,MAAa,OAGK,mBAChB,IAC2B,MAA0B,SACnD,WAAW,MAAM,MAAM,IAAI,CAC/B;;;;;;;;;;;;;;;;;;AAmBA,MAAa,QAGK,oBACf,SAAS,SAAS,KAAK,EAAE,IACC,MAA0B,SACnD,WAAW,MAAM,QAAQ,iBAAiB,IAAI,GAAG,KAAK,CAC1D;AAEA,MAAM,oBAAoB,SAA6B;CACrD,MAAM,IAAI,OAAO,IAAI;CACrB,IAAI,EAAE,SAAS,aAAa,UAAU,SAAS,EAAE,OAAO,KAAK,CAAC,EAAE,UAAU,OAAO,EAAE;CACnF,OAAO,KAAK,QAAQ;AACtB;;;;;;;;;;;;;;;;;;;;;;AAuBA,MAAa,QAGK,mBAAK,IAA8B,MAA0B,SAAqC;CAClH,MAAM,OAAO,KAAK;CAClB,OAAO,WACJ,UAAU;EACT,MAAM,UAAU,MAAM;EACtB,OAAQ,YAAY,KAAA,IAAY,KAAK,KAAK,IAAI,QAAQ,MAAM,OAAO,MAAM,IAAI;CAC/E,GACA,KAAK,MACL;EAAE,MAAM;EAAU;EAAM,MAAM,KAAA;EAAW,OAAO;CAAM,CACxD;AACF,CAAC;;;;;;;AAYD,MAAa,QAAiB;;;;;;;;AAkE9B,IAAa,OAAb,MAAkE;CASrD;CAEA;CAEA;CAEA;CAEA;CAEA;;CAjBX;CACA;CACA;;CAGA,YAEE,OAEA,OAEA,QAEA,OAEA,QAEA,UACA;EAXS,KAAA,QAAA;EAEA,KAAA,QAAA;EAEA,KAAA,SAAA;EAEA,KAAA,QAAA;EAEA,KAAA,SAAA;EAEA,KAAA,WAAA;EAET,KAAK,OAAO,IAAI,WAAW,MAAM,OAAO,GAAG,KAAA,GAAW,CAAC;CACzD;;;;;;CAOA,IAAI,SAAkD;EACpD,IAAI,KAAK,cAAc,KAAA,GAAW;GAChC,MAAM,MAAuC,CAAC;GAC9C,MAAM,SAAS,OAAc,UAAkB;IAC7C,IAAI,CAAC,MAAM,UAAU;IACrB,IAAI,MAAM,UAAU,KAAA,GAAW,IAAI,KAAK,KAAK,QAAQ,MAAM,OAAO,KAAK,CAAC;IACxE,KAAK,IAAI,IAAI,GAAG,IAAI,MAAM,SAAS,QAAQ,KAAK,MAAM,MAAM,SAAS,IAAI,QAAQ,MAAM,QAAQ,EAAE;GACnG;GACA,MAAM,KAAK,OAAO,CAAC;GACnB,KAAK,YAAY;EACnB;EACA,OAAO,KAAK;CACd;;CAGA,IAAI,YAAqB;EACvB,OAAO,KAAK,MAAM;CACpB;;CAGA,aAAa,OAAe,KAA6B;EACvD,OAAO,KAAK,KAAK,aAAa,OAAO,GAAG;CAC1C;;CAGA,OAAsB;EACpB,OAAO,IAAI,WAAW,KAAK,IAAI;CACjC;;;;;;CAOA,WAAW,QAAuC;EAChD,MAAM,QAAQ,KAAK;EACnB,IAAI,CAAC,UAAU,SAAS,KAAK,GAAG,OAAO,WAAW,WAAW,OAAO,QAAQ,KAAK,QAAQ;EACzF,IAAI,QAAQ,KAAK;EACjB,IAAI,UAAU,KAAA,GAAW;GACvB,QAAQ,CAAC,CAAC;GACV,KAAK,IAAI,IAAI,MAAM,QAAQ,IAAI,GAAG,KAAK,GAAG,IAAI,MAAM,QAAQ,MAAM,IAAI,CAAC,GAAG,MAAM,KAAK,IAAI,CAAC;GAC1F,KAAK,QAAQ;EACf;EACA,MAAM,KAAK,KAAK,IAAI,GAAG,KAAK,IAAI,QAAQ,MAAM,MAAM,CAAC;EACrD,IAAI,KAAK;EACT,IAAI,KAAK,MAAM,SAAS;EACxB,OAAO,KAAK,IAAI;GACd,MAAM,MAAO,KAAK,KAAK,KAAM;GAC7B,IAAI,MAAM,QAAQ,IAAI,KAAK;QACtB,KAAK,MAAM;EAClB;EACA,MAAM,YAAY,MAAM;EACxB,OAAO;GAAE,MAAM,KAAK;GAAG,QAAQ,WAAW,WAAW,MAAM,MAAM,WAAW,EAAE,GAAG,KAAK,SAAS,CAAC,CAAC;EAAO;CAC1G;;CAGA,WAAmB;EACjB,OAAO,KAAK,KAAK,SAAS;CAC5B;;CAGA,QAAQ,OAAkB,OAAyC;EACjE,OAAO,WAAW,YAAe,KAAK,OAAO,SAAS,MAAM,SAAS,KAAK,GAAG,MAAM,MAAM,KAAK,QAAQ;CACxG;AACF;;;;;;;;;AAUA,IAAa,aAAb,MAAa,WAAqC;CAMrC;CAEA;CAEA;CAEA;CAEA;CAbX;;CAGA,YAEE,MAEA,OAEA,OAEA,QAEA,OACA;EATS,KAAA,OAAA;EAEA,KAAA,QAAA;EAEA,KAAA,QAAA;EAEA,KAAA,SAAA;EAEA,KAAA,QAAA;CACR;;CAGH,IAAI,OAAe;EACjB,OAAO,KAAK,MAAM;CACpB;;CAGA,IAAI,QAAiB;EACnB,OAAO,KAAK,MAAM;CACpB;;CAGA,IAAI,QAA4B;EAC9B,OAAO,KAAK,QAAQ,MAAM,SAAS,KAAK;CAC1C;;CAGA,IAAI,MAAc;EAChB,OAAO,KAAK,QAAQ,KAAK,MAAM;CACjC;;CAGA,IAAI,SAAiB;EACnB,OAAO,KAAK,MAAM;CACpB;;CAGA,IAAI,QAAiB;EACnB,OAAO,KAAK,MAAM;CACpB;;CAGA,IAAI,OAAiB;EACnB,MAAM,QAAQ,KAAK,KAAK;EACxB,OAAO,iBAAiB,aACnB,MAAM,SAAS,KAAK,OAAO,KAAK,GAAG,IACpC,MAAM,MAAM,KAAK,OAAO,KAAK,GAAG;CACtC;;CAGA,IAAI,UAAmB;EACrB,OAAO,KAAK,MAAM,UAAU,KAAA;CAC9B;;CAGA,IAAI,WAAoB;EACtB,OAAO,KAAK,MAAM;CACpB;;CAGA,IAAI,QAAoD;EACtD,MAAM,QAAQ,KAAK,MAAM;EACzB,OAAO,UAAU,KAAA,IAAY,KAAA,IAAY,KAAK,KAAK,QAAQ,OAAO,KAAK,KAAK;CAC9E;;CAGA,IAAI,WAAyC;EAC3C,IAAI,KAAK,cAAc,KAAA,GAAW;GAChC,MAAM,QAAQ,KAAK;GACnB,MAAM,MAAM,IAAI,MAAqB,MAAM,SAAS,MAAM;GAC1D,KAAK,IAAI,IAAI,GAAG,IAAI,IAAI,QAAQ,KAAK,IAAI,KAAK,KAAK,UAAU,CAAC;GAC9D,KAAK,YAAY;EACnB;EACA,OAAO,KAAK;CACd;;CAGA,IAAI,aAAqB;EACvB,OAAO,KAAK,MAAM,SAAS;CAC7B;;CAGA,MAAM,OAA0C;EAC9C,MAAM,IAAI,KAAK,MAAM,SAAS;EAC9B,MAAM,IAAI,QAAQ,IAAI,IAAI,QAAQ;EAClC,OAAO,KAAK,KAAK,IAAI,IAAI,KAAK,SAAS,KAAK,KAAA;CAC9C;;CAGA,IAAI,gBAA8C;EAChD,OAAO,KAAK,SAAS,QAAQ,MAAM,EAAE,KAAK;CAC5C;;CAGA,WAAW,OAA0C;EACnD,OAAO,KAAK,cAAc;CAC5B;;CAGA,aAAa,MAAyC;EACpD,MAAM,SAAS,KAAK,MAAM;EAC1B,IAAI,WAAW,KAAA,GAAW,OAAO,KAAA;EACjC,MAAM,IAAI,OAAO,QAAQ,IAAI;EAC7B,OAAO,IAAI,IAAI,KAAA,IAAY,KAAK,SAAS;CAC3C;;CAGA,gBAAgB,MAA4C;EAC1D,MAAM,SAAS,KAAK,MAAM;EAC1B,IAAI,WAAW,KAAA,GAAW,OAAO,CAAC;EAClC,OAAO,KAAK,SAAS,QAAQ,GAAG,MAAM,OAAO,OAAO,IAAI;CAC1D;;CAGA,IAAI,cAAyC;EAC3C,OAAO,KAAK,QAAQ,SAAS,KAAK,QAAQ;CAC5C;;CAGA,IAAI,kBAA6C;EAC/C,OAAO,KAAK,QAAQ,IAAI,KAAK,QAAQ,SAAS,KAAK,QAAQ,KAAK,KAAA;CAClE;;CAGA,IAAI,mBAA8C;EAChD,MAAM,WAAW,KAAK,QAAQ;EAC9B,IAAI,aAAa,KAAA,GAAW,OAAO,KAAA;EACnC,KAAK,IAAI,IAAI,KAAK,QAAQ,GAAG,IAAI,SAAS,QAAQ,KAAK,IAAI,SAAS,EAAE,CAAC,OAAO,OAAO,SAAS;CAEhG;;CAGA,IAAI,uBAAkD;EACpD,MAAM,WAAW,KAAK,QAAQ;EAC9B,IAAI,aAAa,KAAA,GAAW,OAAO,KAAA;EACnC,KAAK,IAAI,IAAI,KAAK,QAAQ,GAAG,KAAK,GAAG,KAAK,IAAI,SAAS,EAAE,CAAC,OAAO,OAAO,SAAS;CAEnF;;;;;CAMA,aAAa,QAAwB;EACnC,MAAM,QAAQ,KAAK;EACnB,MAAM,UAAU,MAAM;EACtB,MAAM,MAAM,SAAS,KAAK;EAC1B,IAAI,KAAK;EACT,IAAI,KAAK,QAAQ,SAAS;EAC1B,IAAI,QAAQ;EACZ,OAAO,MAAM,IAAI;GACf,MAAM,MAAO,KAAK,MAAO;GACzB,IAAI,QAAQ,QAAQ,KAAK;IACvB,QAAQ;IACR,KAAK,MAAM;GACb,OACE,KAAK,MAAM;EAEf;EAEA,OAAO,SAAS,KAAK,MAAM,SAAS,MAAM,CAAC,UAAU,KAAK,QAAQ,WAAW,KAAK;EAClF,OAAO,SAAS,KAAK,MAAM,QAAQ,SAAS,MAAM,SAAS,MAAM,CAAC,QAAQ,QAAQ;CACpF;;CAGA,QAAQ,QAA2C;EACjD,MAAM,IAAI,KAAK,aAAa,MAAM;EAClC,OAAO,IAAI,IAAI,KAAA,IAAY,KAAK,SAAS;CAC3C;;;;;;;;CASA,aAAa,OAAe,MAAc,QAAQ,GAAkB;EAClE,OAAO,aAAa,MAAM,OAAO,GAAG;CACtC;;CAGA,kBAAkB,OAAe,MAAc,QAAQ,GAAkB;EACvE,IAAI,OAAsB,KAAK,aAAa,OAAO,GAAG;EAEtD,OAAO,CAAC,KAAK,SAAS,SAAS,MAAM,OAAO,KAAK,UAAU;EAC3D,OAAO;CACT;;CAGA,CAAC,cAAyD;EACxD,MAAM,SAAS,KAAK,KAAK;EACzB,OAAO,MAAM;GACX,MAAM,OAAO;GACb,IAAI,OAAO,eAAe,GAAG;GAC7B,OAAO,CAAC,OAAO,gBAAgB,GAC7B,IAAI,CAAC,OAAO,WAAW,GAAG;EAE9B;CACF;;CAGA,CAAC,kBAAkB,MAAyD;EAC1E,KAAK,MAAM,KAAK,KAAK,YAAY,GAAG,IAAI,EAAE,SAAS,MAAM,MAAM;CACjE;;CAGA,OAAsB;EACpB,OAAO,IAAI,WAAW,IAAI;CAC5B;;;;;CAMA,WAAmB;EACjB,IAAI,MAAM;EACV,MAAM,SAAS,OAAc,UAA8B;GACzD,IAAI,MAAM,SAAS,UAAU,KAAK,OAAO;IACvC,IAAI,IAAI,SAAS,GAAG,OAAO;IAC3B,IAAI,UAAU,KAAA,GAAW,OAAO,GAAG,MAAM;IACzC,OAAO,IAAI,MAAM;IACjB,KAAK,IAAI,IAAI,GAAG,IAAI,MAAM,SAAS,QAAQ,KAAK,MAAM,MAAM,SAAS,IAAI,MAAM,SAAS,EAAE;IAC1F,OAAO;GACT,OACE,KAAK,IAAI,IAAI,GAAG,IAAI,MAAM,SAAS,QAAQ,KAAK,MAAM,MAAM,SAAS,IAAI,MAAM,SAAS,EAAE;EAE9F;EACA,MAAM,KAAK,OAAO,KAAK,KAAK;EAC5B,OAAO;CACT;CAEA,SAAkB;EAChB,OAAO;GAAE,MAAM,KAAK;GAAM,OAAO,KAAK;GAAO,KAAK,KAAK;EAAI;CAC7D;CAEA,UAAkB,GAA0B;EAC1C,MAAM,QAAQ,KAAK;EACnB,OAAO,IAAI,WAAW,KAAK,MAAM,MAAM,SAAS,IAAI,KAAK,QAAQ,MAAM,QAAQ,IAAI,MAAM,CAAC;CAC5F;AACF;;AAGA,MAAM,gBAAiC,MAAqB,OAAe,QAA+B;CACxG,IAAI,OAAO;CACX,OAAO,MAAM;EACX,MAAM,IAAI,KAAK,aAAa,KAAK;EACjC,IAAI,IAAI,GAAG,OAAO;EAClB,MAAM,QAAQ,KAAK,SAAS;EAC5B,IAAI,MAAM,MAAM,KAAK,OAAO;EAC5B,OAAO;CACT;AACF;;;;;;;;AASA,IAAa,aAAb,MAAkD;CAChD;CACA,QAAgB;;CAGhB,YAAY,MAAqB;EAC/B,KAAK,UAAU;CACjB;;CAGA,IAAI,OAAsB;EACxB,OAAO,KAAK;CACd;;CAGA,IAAI,QAA4B;EAC9B,OAAO,KAAK,UAAU,IAAI,KAAA,IAAY,KAAK,QAAQ;CACrD;;CAGA,iBAA0B;EACxB,OAAO,KAAK,KAAK,KAAK,QAAQ,MAAM,CAAC,CAAC;CACxC;;CAGA,gBAAyB;EACvB,OAAO,KAAK,KAAK,KAAK,QAAQ,MAAM,EAAE,CAAC;CACzC;;CAGA,wBAAwB,QAAyB;EAC/C,OAAO,KAAK,KAAK,KAAK,QAAQ,QAAQ,MAAM,CAAC;CAC/C;;CAGA,kBAA2B;EACzB,IAAI,KAAK,UAAU,GAAG,OAAO;EAC7B,MAAM,OAAO,KAAK,QAAQ;EAC1B,IAAI,SAAS,KAAA,GAAW,OAAO;EAC/B,KAAK,UAAU;EACf,OAAO;CACT;;CAGA,sBAA+B;EAC7B,IAAI,KAAK,UAAU,GAAG,OAAO;EAC7B,MAAM,WAAW,KAAK,QAAQ;EAC9B,IAAI,aAAa,KAAA,GAAW,OAAO;EACnC,KAAK,UAAU;EACf,OAAO;CACT;;CAGA,aAAsB;EACpB,MAAM,SAAS,KAAK,QAAQ;EAC5B,IAAI,KAAK,UAAU,KAAK,WAAW,KAAA,GAAW,OAAO;EACrD,KAAK,UAAU;EACf,KAAK;EACL,OAAO;CACT;;CAGA,iBAAiB,QAAsB;EACrC,OAAO,KAAK,wBAAwB,MAAM;CAG5C;;CAGA,MAAM,MAA2B;EAC/B,KAAK,UAAU;EACf,KAAK,QAAQ;CACf;CAEA,KAAa,MAA0C;EACrD,IAAI,SAAS,KAAA,GAAW,OAAO;EAC/B,KAAK,UAAU;EACf,KAAK;EACL,OAAO;CACT;AACF;AAMA,MAAM,cAAc,CAAC,cAAc;AAEnC,MAAM,OAA8B,QAAgB,OAAU,aAAkD;CAC9G,MAAM,QAAQ,IAAI,YAAe,OAAO,EAAE,SAAS,OAAO,QAAQ,GAAG,QAAQ;CAC7E,MAAM,IAAI,MAAM,IAAI,OAAO,MAAM,MAAM,KAAK;CAE5C,IAAI,MAAM,aAAa,KAAA,KAAa,aAAa,KAAA,GAAW,MAAM,WAAW,SAAS;CACtF,IAAI;CACJ,IAAI,QAA0B,OAAO,KAAK;CAC1C,IAAI,MAAM,MACR,QAAQ;EAAE,SAAS,MAAM,gBAAgB;EAAG,MAAM,MAAM;CAAK;MACxD,IAAI,MAAM,MAAM,MAAM,KAAK;EAChC,MAAM,UAAU,OAAO,WAAW;EAClC,QAAQ;GAAE,SAAS,MAAM,gBAAgB;GAAG,MAAM;EAAY;CAChE,OACE,QAAQ,OAAO,KAAK,CAAM;CAE5B,MAAM,QAAQ,MAAM,OAAO,OAAO,MAAM,OAAO,eAAe,KAAK,GAAG,OAAO,MAAM,GAAG;CACtF,OAAO,IAAI,KAAc,OAAO,OAAO,MAAM,QAAQ,OAAO,QAAQ,MAAM,QAAQ;AACpF;;;;;;;;;;;;;;AAeA,MAAa,SAYX,SACA,OACA,YACkB;CAClB,MAAM,IAAI,OAAO,OAAO;CACxB,MAAM,SAAS,EAAE,SAAS,YAAY,EAAE,SAAS,KAAA,KAAa,EAAE;CAChE,MAAM,SAAiB;EACrB,MAAM,SAAS,EAAE,OAAQ,SAAS,QAAQ;EAC1C,OAAO,SAAU,EAAE,OAAsB;EACzC,WAAW,SAAS,aAAa;EACjC,SAAS,SAAS;CACpB;CACA,OAAO,IAAI,QAAQ,WAAW,KAAc,GAAQ,KAAA,CAAS;AAC/D;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;AA+BA,MAAa,WACX,MACA,OACA,UACkB;CAClB,MAAM,OAAO,WAAW,KAAc;CACtC,MAAM,OACJ,UAAU,KAAA,IACN,SAAS,KAAK,OAAO,IAAI,IACzB,WAAW,QACT,CAAC,KAAa,IACb;CACT,MAAM,WAAqB;EACzB,MAAM,KAAK;EACX,WAAW,KAAK,MAAM;EACtB,WAAW,KAAK;EAChB,UAAU,WAAW,KAAK,MAAM,QAAQ,KAAK,QAAQ,IAAI;EACzD,OAAO,KAAK;EACZ,OAAO,KAAK,OAAO;EACnB,UAAU,KAAK;CACjB;CACA,OAAO,IAAI,KAAK,QAAQ,MAAM,QAAQ;AACxC;;;;;;;;AASA,MAAa,WACX,MACA,OACA,KACA,SACuB;CACvB,MAAM,QAAQ,KAAK;CACnB,IAAI,QAAQ,KAAK,MAAM,SAAS,MAAM,MAAM,QAC1C,MAAM,IAAI,WAAW,kBAAkB,MAAM,IAAI,IAAI,0BAA0B,MAAM,QAAQ;CAE/F,OAAO,QAAQ,MAAM,MAAM,MAAM,GAAG,KAAK,IAAI,OAAO,MAAM,MAAM,GAAG,GAAG;EACpE;EACA,QAAQ;EACR,QAAQ,QAAQ,KAAK;CACvB,CAAC;AACH;;;;;;;;AASA,MAAa,QAAyB,QAAW,UAA+B;CAC9E,MAAM,IAAI;CACV,MAAM,IAAI;CACV,MAAM,KAAK,UAAU,SAAS,CAAC,KAAK,GAAW,MAAc,EAAE,WAAW,CAAC,KAAK,GAAQ,MAAc,EAAE;CACxG,MAAM,MAAM,KAAK,IAAI,EAAE,QAAQ,EAAE,MAAM;CACvC,IAAI,SAAS;CACb,OAAO,SAAS,OAAO,GAAG,GAAG,MAAM,MAAM,GAAG,GAAG,MAAM,GAAG;CACxD,IAAI,WAAW,EAAE,UAAU,WAAW,EAAE,QAAQ,OAAO,KAAA;CACvD,IAAI,SAAS;CACb,OAAO,SAAS,MAAM,UAAU,GAAG,GAAG,EAAE,SAAS,IAAI,MAAM,MAAM,GAAG,GAAG,EAAE,SAAS,IAAI,MAAM,GAAG;CAC/F,OAAO;EAAE,OAAO;EAAQ,QAAQ,EAAE,SAAS;EAAQ,QAAQ,EAAE,SAAS;CAAO;AAC/E;AAEA,MAAM,YAAY,QAAe,UAAsC;CACrE,MAAM,OAAO,KAAK,QAAQ,KAAK;CAC/B,OAAO,SAAS,KAAA,IAAY,CAAC,IAAI,CAAC,IAAI;AACxC;;AAGA,MAAM,cAAc,WAAmB,WAAmB,UAA+C;CACvG,IAAI,WAA2B,YAAY,IAAI,CAAC;EAAE,UAAU;EAAG,UAAU;EAAG,QAAQ;CAAU,CAAC,IAAI,CAAC;CACpG,IAAI,SAAS;CACb,KAAK,MAAM,EAAE,QAAQ,QAAQ,WAAW,OAAO;EAC7C,IAAI,EAAE,SAAS,KAAK,UAAU,SAAS,UAAU,UAAU,UAAU,QACnE,MAAM,IAAI,WACR,yBAAyB,MAAM,YAAY,OAAO,YAAY,OAAO,2BAA2B,QAClG;EAEF,MAAM,QAAQ,SAAS;EACvB,MAAM,MAAsB,CAAC;EAC7B,KAAK,MAAM,KAAK,UAAU;GACxB,MAAM,MAAM,EAAE,WAAW,EAAE;GAC3B,IAAI,EAAE,WAAW,OACf,IAAI,KAAK;IAAE,UAAU,EAAE;IAAU,UAAU,EAAE;IAAU,QAAQ,KAAK,IAAI,KAAK,KAAK,IAAI,EAAE;GAAS,CAAC;GAEpG,IAAI,MAAM,QAAQ;IAChB,MAAM,OAAO,KAAK,IAAI,EAAE,UAAU,MAAM;IACxC,IAAI,KAAK;KAAE,UAAU,OAAO;KAAO,UAAU,EAAE,YAAY,OAAO,EAAE;KAAW,QAAQ,MAAM;IAAK,CAAC;GACrG;EACF;EACA,WAAW;EACX,UAAU;CACZ;CACA,IAAI,WAAW,WACb,MAAM,IAAI,WAAW,qCAAqC,OAAO,iCAAiC,WAAW;CAE/G,OAAO;AACT"}
+{"version":3,"file":"Syntax.js","names":[],"sources":["../src/Syntax.ts"],"sourcesContent":["/**\n * Concrete syntax trees and incremental parsing, in the spirit of\n * [Tree-sitter](https://tree-sitter.github.io).\n *\n * Mark the rules of a grammar that should appear in the tree with\n * {@link node} (and, optionally, {@link token} and {@link field}). Outside\n * this module the marks change nothing: `Parser.parse` returns the same\n * values, and compiled parsers compile them away. {@link parse} runs the\n * grammar and returns a {@link Tree}: a tree of {@link SyntaxNode}s with\n * spans, parents and siblings, to search by position (`descendantAt`) or walk\n * with a {@link TreeCursor}. Each node also carries the value its parser\n * returned.\n *\n * Like Tree-sitter, a syntax parse always produces a tree. Failures handled\n * by `Parser.resumeAfter` and `Parser.retryAfter` become `ERROR` nodes over\n * the input they skipped, and so does any input after a fatal failure.\n *\n * After an edit, {@link reparse} (or {@link replace}) parses the new input\n * reusing every node of the old tree whose input is unchanged: only the\n * nodes that enclose the edit, or looked at the edited input, are parsed\n * again, and each reused node is stepped over whole.\n *\n * @example\n * ```ts\n * import { Ascii, Parser, Syntax, Token } from \"@thomasfosterau/effect-parse\"\n *\n * const ws = Ascii.multispace0\n * const number = Syntax.node(Ascii.decInt, \"number\")\n * const list = Syntax.node(\n *   Parser.delimited(\n *     Token.literal(\"[\"),\n *     Parser.separated(Parser.delimited(ws, number, ws), Token.literal(\",\")),\n *     Token.literal(\"]\")\n *   ),\n *   \"list\"\n * )\n *\n * const tree = Syntax.parse(list, \"[1, 2, 3]\")\n * String(tree.root) // \"(list (number) (number) (number))\"\n * tree.root.descendantAt(4)?.text // \"2\"\n *\n * const edited = Syntax.replace(tree, 4, 5, \"20\") // \"[1, 20, 3]\"\n * edited.root.namedChild(1)?.value // 20\n * edited.reused // 2: only \"20\" was parsed again\n * ```\n *\n * @since 0.2.0\n */\nimport * as Str from \"effect/String\"\nimport * as Predicate from \"effect/Predicate\"\nimport type * as Context from \"effect/Context\"\nimport { dual } from \"effect/Function\"\nimport * as Option from \"effect/Option\"\nimport type { Input, Slice, Source } from \"./Input.js\"\nimport { Fail, fromSource, State } from \"./Input.js\"\nimport * as ParseError from \"./ParseError.js\"\nimport { nodeOf } from \"./internal/node.js\"\nimport { Key } from \"./internal/key.js\"\nimport * as Stack from \"./internal/stack.js\"\nimport type { ErrorInfo, Green, Previous, Segment } from \"./internal/syntax.js\"\nimport { absolute, errorKind, SyntaxBuilder } from \"./internal/syntax.js\"\nimport type { Parser } from \"./Parser.js\"\nimport { described, isParser } from \"./Parser.js\"\n\n// -----------------------------------------------------------------------------\n// Grammar annotations\n// -----------------------------------------------------------------------------\n\nconst syntaxNode = (self: Parser.Any, kind: string, named: boolean): Parser.Any => {\n  const step = self.step\n  // Identifies the nodes this parser builds, so a reparse can reuse them\n  const key = new Key()\n  return described<unknown, unknown, unknown, Input>(\n    (state) => {\n      const builder = state.syntax\n      return builder === undefined ? step(state) : builder.node(state, step, key, kind, named)\n    },\n    self.name,\n    { _tag: \"Syntax\", self, kind, named }\n  )\n}\n\n/**\n * Marks a parser as a rule of the syntax tree: in a {@link parse}, each\n * match becomes a named node of the given kind, spanning the input it\n * consumed, with the nodes built inside it as children and its output as\n * its `value`. Outside {@link parse}, the parser is unchanged.\n *\n * A match that consumes nothing adds no node (as in Tree-sitter, where rules\n * can't match the empty string).\n *\n * For {@link reparse} to reuse a node, its parser's output must depend only\n * on the input from where the node starts: not on services, on state kept\n * in closures, or on absolute offsets (`Parser.location`, `Parser.span`),\n * which are not updated when the node moves. Use the node's `start` and\n * `end` instead.\n *\n * @since 0.2.0\n * @category annotations\n */\nexport const node: {\n  (kind: string): <A, E, R, I extends Input>(self: Parser<A, E, R, I>) => Parser<A, E, R, I>\n  <A, E, R, I extends Input>(self: Parser<A, E, R, I>, kind: string): Parser<A, E, R, I>\n} = /*#__PURE__*/ dual(\n  2,\n  <A, E, R, I extends Input>(self: Parser<A, E, R, I>, kind: string): Parser<A, E, R, I> =>\n    syntaxNode(self, kind, true) as Parser<A, E, R, I>\n)\n\n/**\n * Like {@link node}, but builds an *anonymous* node, Tree-sitter's name for\n * punctuation and keywords: anonymous nodes are left out of\n * `namedChildren` and of the tree's printed form. The kind defaults to the\n * literal for a `Token.literal` of a string, and to the parser's name\n * otherwise.\n *\n * @example\n * ```ts\n * import { Syntax, Token } from \"@thomasfosterau/effect-parse\"\n *\n * const comma = Syntax.token(Token.literal(\",\")) // kind \",\"\n * ```\n *\n * @since 0.2.0\n * @category annotations\n */\nexport const token: {\n  (kind?: string): <A, E, R, I extends Input>(self: Parser<A, E, R, I>) => Parser<A, E, R, I>\n  <A, E, R, I extends Input>(self: Parser<A, E, R, I>, kind?: string): Parser<A, E, R, I>\n} = /*#__PURE__*/ dual(\n  (args) => isParser(args[0]),\n  <A, E, R, I extends Input>(self: Parser<A, E, R, I>, kind?: string): Parser<A, E, R, I> =>\n    syntaxNode(self, kind ?? defaultTokenKind(self), false) as Parser<A, E, R, I>\n)\n\nconst defaultTokenKind = (self: Parser.Any): string => {\n  const n = nodeOf(self)\n  if (Predicate.isTagged(n, \"Literal\") && Predicate.isString(n.literal) && !n.caseless) return n.literal\n  return self.name ?? \"token\"\n}\n\n/**\n * Gives the nodes built by a parser a field name in their parent, like\n * Tree-sitter's `field(name, rule)`: find them with `childByField` and\n * `childrenByField`. Outside {@link parse}, the parser is unchanged.\n *\n * @example\n * ```ts\n * import { Ascii, Parser, Syntax, Token } from \"@thomasfosterau/effect-parse\"\n *\n * const name = Syntax.node(Ascii.alpha1, \"name\")\n * const number = Syntax.node(Ascii.decInt, \"number\")\n * const pair = Syntax.node(\n *   Parser.separatedPair(Syntax.field(name, \"key\"), Token.literal(\"=\"), Syntax.field(number, \"value\")),\n *   \"pair\"\n * )\n * Syntax.parse(pair, \"x=1\").root.childByField(\"value\")?.value // 1\n * ```\n *\n * @since 0.2.0\n * @category annotations\n */\nexport const field: {\n  (name: string): <A, E, R, I extends Input>(self: Parser<A, E, R, I>) => Parser<A, E, R, I>\n  <A, E, R, I extends Input>(self: Parser<A, E, R, I>, name: string): Parser<A, E, R, I>\n} = /*#__PURE__*/ dual(2, <A, E, R, I extends Input>(self: Parser<A, E, R, I>, name: string): Parser<A, E, R, I> => {\n  const step = self.step\n  return described<A, E, R, I>(\n    (state) => {\n      const builder = state.syntax\n      return (builder === undefined ? step(state) : builder.field(state, step, name)) as A | typeof Fail\n    },\n    self.name,\n    { _tag: \"Syntax\", self, kind: undefined, named: false }\n  )\n})\n\n// -----------------------------------------------------------------------------\n// Trees\n// -----------------------------------------------------------------------------\n\n/**\n * The kind of the nodes that stand for input that could not be parsed.\n *\n * @since 0.2.0\n * @category models\n */\nexport const ERROR: \"ERROR\" = errorKind\n\n/**\n * An edit to an input, as Tree-sitter's `TSInputEdit`: the input\n * `[start, oldEnd)` was replaced by `[start, newEnd)`. Offsets are in the\n * input's units (UTF-16 code units for strings, bytes, elements).\n *\n * @since 0.2.0\n * @category models\n */\nexport interface Edit {\n  readonly start: number\n  readonly oldEnd: number\n  readonly newEnd: number\n}\n\n/**\n * Options for {@link parse}.\n *\n * @since 0.2.0\n * @category models\n */\nexport interface ParseOptions {\n  /**\n   * The kind of the root node, when the grammar itself is not a\n   * {@link node}. Defaults to `\"document\"`.\n   */\n  readonly kind?: string | undefined\n  /**\n   * For {@link reparse}: how many input units custom parsers may read past\n   * the furthest position they move the cursor to or record a failure at,\n   * besides one token there. Defaults to 0, which is right for the built-in\n   * parsers, and for custom parsers (`Parser.make`) that only read past\n   * where they stop to see that the token there doesn't match.\n   *\n   * A node is reused only when the input its parse looked at is unchanged.\n   * Built-in parsers that read further, such as a literal that fails part\n   * way or `Token.takeUntil`, record how far they read.\n   */\n  readonly lookahead?: number | undefined\n}\n\n/**\n * Options for {@link parse} with a parser that requires services.\n *\n * @since 0.2.0\n * @category models\n */\nexport interface ParseOptionsWithContext<R> extends ParseOptions {\n  readonly context: Context.Context<R>\n}\n\ninterface Config {\n  readonly kind: string\n  readonly inner: Parser.Any\n  readonly lookahead: number\n  readonly context: Context.Context<never> | undefined\n}\n\n/**\n * The result of a {@link parse}: a syntax tree over the whole input, the\n * grammar's output, and the errors met on the way.\n *\n * @since 0.2.0\n * @category models\n */\nexport class Tree<out A, out E = never, I extends Input = string> {\n  /** The root node. It always spans the whole input. */\n  readonly root: SyntaxNode<I>\n  private lines: Array<number> | undefined\n  private errorList: ReadonlyArray<ParseError.ParseError<E>> | undefined\n\n  /** @internal */\n  constructor(\n    /** The input the tree was parsed from. */\n    readonly input: I,\n    /** The grammar's output: `none` when the parse failed. */\n    readonly value: Option.Option<A>,\n    /** How many nodes were reused from the previous tree by {@link reparse}. */\n    readonly reused: number,\n    /** @internal */\n    readonly green: Green,\n    /** @internal */\n    readonly config: Config,\n    /** @internal */\n    readonly encoding: ParseError.ParseError<never>[\"encoding\"]\n  ) {\n    this.root = new SyntaxNode(this, green, 0, undefined, 0)\n  }\n\n  /**\n   * Every error of the parse, in input order: the failures recovered by\n   * `Parser.resumeAfter` and `Parser.retryAfter`, then the fatal one, if\n   * the parse failed. Each one belongs to an `ERROR` node.\n   */\n  get errors(): ReadonlyArray<ParseError.ParseError<E>> {\n    if (this.errorList === undefined) {\n      const out: Array<ParseError.ParseError<E>> = []\n      const visit = (green: Green, start: number) => {\n        if (!green.hasError) return\n        if (green.error !== undefined) out.push(this.toError(green.error, start))\n        for (let i = 0; i < green.children.length; i++) visit(green.children[i], start + green.offsets[i])\n      }\n      visit(this.green, 0)\n      this.errorList = out\n    }\n    return this.errorList\n  }\n\n  /** Whether the tree has any `ERROR` node. */\n  get hasErrors(): boolean {\n    return this.green.hasError\n  }\n\n  /** The smallest node containing `[start, end)` (see {@link SyntaxNode.descendantAt}). */\n  descendantAt(start: number, end?: number): SyntaxNode<I> {\n    return this.root.descendantAt(start, end)\n  }\n\n  /** A cursor at the root. */\n  walk(): TreeCursor<I> {\n    return new TreeCursor(this.root)\n  }\n\n  /**\n   * The 1-based line and column (in code points) of an offset, as in\n   * `ParseError`. Lines of a string input are indexed once, so lookups take\n   * logarithmic time.\n   */\n  lineColumn(offset: number): ParseError.LineColumn {\n    const input = this.input\n    if (!Predicate.isString(input)) return ParseError.lineColumn(input, offset, this.encoding)\n    let lines = this.lines\n    if (lines === undefined) {\n      lines = [0]\n      for (let i = input.indexOf(\"\\n\"); i >= 0; i = input.indexOf(\"\\n\", i + 1)) lines.push(i + 1)\n      this.lines = lines\n    }\n    const at = Math.max(0, Math.min(offset, input.length))\n    let lo = 0\n    let hi = lines.length - 1\n    while (lo < hi) {\n      const mid = (lo + hi + 1) >> 1\n      if (lines[mid] <= at) lo = mid\n      else hi = mid - 1\n    }\n    const lineStart = lines[lo]\n    return { line: lo + 1, column: ParseError.lineColumn(input.slice(lineStart, at), at - lineStart).column }\n  }\n\n  /** The root's S-expression (see {@link SyntaxNode.toString}). */\n  toString(): string {\n    return this.root.toString()\n  }\n\n  /** @internal */\n  toError(error: ErrorInfo, start: number): ParseError.ParseError<E> {\n    return ParseError.fromFailure<E>(this.input, absolute(error.failure, start), error.mode, this.encoding)\n  }\n}\n\n/**\n * A node of a syntax tree: its kind, span and value, and its place in the\n * tree. Nodes are views built on demand; two views of the same node are\n * different objects but have the same `start`, `end` and `kind`.\n *\n * @since 0.2.0\n * @category models\n */\nexport class SyntaxNode<I extends Input = string> {\n  private childList: ReadonlyArray<SyntaxNode<I>> | undefined\n\n  /** @internal */\n  constructor(\n    /** The tree this node belongs to. */\n    readonly tree: Tree<unknown, unknown, I>,\n    /** @internal */\n    readonly green: Green,\n    /** The offset where the node starts. */\n    readonly start: number,\n    /** The parent node; `undefined` for the root. */\n    readonly parent: SyntaxNode<I> | undefined,\n    /** The node's index among its parent's children. */\n    readonly index: number\n  ) {}\n\n  /** The node's kind: the name given to {@link node} or {@link token}, or `\"ERROR\"`. */\n  get kind(): string {\n    return this.green.kind\n  }\n\n  /** `false` for the anonymous nodes built by {@link token}. */\n  get named(): boolean {\n    return this.green.named\n  }\n\n  /** The field name given by {@link field}, if any. */\n  get field(): string | undefined {\n    return this.parent?.green.fields?.[this.index]\n  }\n\n  /** The offset where the node ends (exclusive). */\n  get end(): number {\n    return this.start + this.green.width\n  }\n\n  /** The number of input units the node spans. */\n  get length(): number {\n    return this.green.width\n  }\n\n  /** The output of the node's parser (`undefined` for `ERROR` nodes, and for a root that failed). */\n  get value(): unknown {\n    return this.green.value\n  }\n\n  /** The input the node spans. */\n  get text(): Slice<I> {\n    const input = this.tree.input as any\n    return input instanceof Uint8Array\n      ? (input.subarray(this.start, this.end) as any)\n      : input.slice(this.start, this.end)\n  }\n\n  /** Whether this is an `ERROR` node. */\n  get isError(): boolean {\n    return this.green.error !== undefined\n  }\n\n  /** Whether this node or a descendant is an `ERROR` node. */\n  get hasError(): boolean {\n    return this.green.hasError\n  }\n\n  /** For an `ERROR` node, the error it stands for. */\n  get error(): ParseError.ParseError<unknown> | undefined {\n    const error = this.green.error\n    return error === undefined ? undefined : this.tree.toError(error, this.start)\n  }\n\n  /** The child nodes, named and anonymous, in input order. */\n  get children(): ReadonlyArray<SyntaxNode<I>> {\n    if (this.childList === undefined) {\n      const green = this.green\n      const out = new Array<SyntaxNode<I>>(green.children.length)\n      for (let i = 0; i < out.length; i++) out[i] = this.makeChild(i)\n      this.childList = out\n    }\n    return this.childList\n  }\n\n  /** The number of children. */\n  get childCount(): number {\n    return this.green.children.length\n  }\n\n  /** The child at `index` (negative indices count from the end). */\n  child(index: number): SyntaxNode<I> | undefined {\n    const n = this.green.children.length\n    const i = index < 0 ? n + index : index\n    return i >= 0 && i < n ? this.children[i] : undefined\n  }\n\n  /** The named children. */\n  get namedChildren(): ReadonlyArray<SyntaxNode<I>> {\n    return this.children.filter((c) => c.named)\n  }\n\n  /** The named child at `index`. */\n  namedChild(index: number): SyntaxNode<I> | undefined {\n    return this.namedChildren[index]\n  }\n\n  /** The first child with the given field name. */\n  childByField(name: string): SyntaxNode<I> | undefined {\n    const fields = this.green.fields\n    if (fields === undefined) return undefined\n    const i = fields.indexOf(name)\n    return i < 0 ? undefined : this.children[i]\n  }\n\n  /** The children with the given field name. */\n  childrenByField(name: string): ReadonlyArray<SyntaxNode<I>> {\n    const fields = this.green.fields\n    if (fields === undefined) return []\n    return this.children.filter((_, i) => fields[i] === name)\n  }\n\n  /** The next sibling, named or anonymous. */\n  get nextSibling(): SyntaxNode<I> | undefined {\n    return this.parent?.children[this.index + 1]\n  }\n\n  /** The previous sibling, named or anonymous. */\n  get previousSibling(): SyntaxNode<I> | undefined {\n    return this.index > 0 ? this.parent?.children[this.index - 1] : undefined\n  }\n\n  /** The next named sibling. */\n  get nextNamedSibling(): SyntaxNode<I> | undefined {\n    const siblings = this.parent?.children\n    if (siblings === undefined) return undefined\n    for (let i = this.index + 1; i < siblings.length; i++) if (siblings[i].named) return siblings[i]\n    return undefined\n  }\n\n  /** The previous named sibling. */\n  get previousNamedSibling(): SyntaxNode<I> | undefined {\n    const siblings = this.parent?.children\n    if (siblings === undefined) return undefined\n    for (let i = this.index - 1; i >= 0; i--) if (siblings[i].named) return siblings[i]\n    return undefined\n  }\n\n  /**\n   * The index of the child containing the input unit at `offset`, or -1.\n   * Takes logarithmic time.\n   */\n  childIndexAt(offset: number): number {\n    const green = this.green\n    const offsets = green.offsets\n    const rel = offset - this.start\n    let lo = 0\n    let hi = offsets.length - 1\n    let found = -1\n    while (lo <= hi) {\n      const mid = (lo + hi) >> 1\n      if (offsets[mid] <= rel) {\n        found = mid\n        lo = mid + 1\n      } else {\n        hi = mid - 1\n      }\n    }\n    // Skip back over empty `ERROR` nodes at `offset`\n    while (found >= 0 && green.children[found].width === 0 && offsets[found] === rel) found--\n    return found >= 0 && rel < offsets[found] + green.children[found].width ? found : -1\n  }\n\n  /** The child containing the input unit at `offset`. */\n  childAt(offset: number): SyntaxNode<I> | undefined {\n    const i = this.childIndexAt(offset)\n    return i < 0 ? undefined : this.children[i]\n  }\n\n  /**\n   * The smallest node, this one or a descendant, that contains\n   * `[start, end)` (Tree-sitter's `descendant_for_byte_range`). With only\n   * `start`, the deepest node containing the input unit at `start`. Takes\n   * time proportional to the depth of the tree times the logarithm of the\n   * number of children.\n   */\n  descendantAt(start: number, end: number = start + 1): SyntaxNode<I> {\n    return descendantOf(this, start, end)\n  }\n\n  /** Like {@link descendantAt}, but only stops at named nodes. */\n  namedDescendantAt(start: number, end: number = start + 1): SyntaxNode<I> {\n    let node: SyntaxNode<I> = this.descendantAt(start, end)\n    // Every node below `this` has a parent, so the walk stops at `this` at the latest\n    while (!node.named && node !== this) node = node.parent ?? this\n    return node\n  }\n\n  /** This node and its descendants, in pre-order. */\n  *descendants(): Generator<SyntaxNode<I>, void, undefined> {\n    const cursor = this.walk()\n    while (true) {\n      yield cursor.node\n      if (cursor.gotoFirstChild()) continue\n      while (!cursor.gotoNextSibling()) {\n        if (!cursor.gotoParent()) return\n      }\n    }\n  }\n\n  /** The descendants of the given kind, in pre-order. */\n  *descendantsOfKind(kind: string): Generator<SyntaxNode<I>, void, undefined> {\n    for (const n of this.descendants()) if (n.kind === kind) yield n\n  }\n\n  /** A cursor at this node, which cannot move above it. */\n  walk(): TreeCursor<I> {\n    return new TreeCursor(this)\n  }\n\n  /**\n   * The node as an S-expression of its named descendants, with field\n   * names, as Tree-sitter prints it: `(pair key: (name) value: (number))`.\n   */\n  toString(): string {\n    let out = \"\"\n    const visit = (green: Green, field: string | undefined) => {\n      if (green.named || green === this.green) {\n        if (Str.isNonEmpty(out)) out += \" \"\n        if (field !== undefined) out += `${field}: `\n        out += `(${green.kind}`\n        for (let i = 0; i < green.children.length; i++) visit(green.children[i], green.fields?.[i])\n        out += \")\"\n      } else {\n        for (let i = 0; i < green.children.length; i++) visit(green.children[i], green.fields?.[i])\n      }\n    }\n    visit(this.green, this.field)\n    return out\n  }\n\n  toJSON(): unknown {\n    return { kind: this.kind, start: this.start, end: this.end }\n  }\n\n  private makeChild(i: number): SyntaxNode<I> {\n    const green = this.green\n    return new SyntaxNode(this.tree, green.children[i], this.start + green.offsets[i], this, i)\n  }\n}\n\n/** The smallest node, `root` or a descendant, that contains `[start, end)` (see `SyntaxNode.descendantAt`). */\nconst descendantOf = <I extends Input>(root: SyntaxNode<I>, start: number, end: number): SyntaxNode<I> => {\n  let node = root\n  while (true) {\n    const i = node.childIndexAt(start)\n    if (i < 0) return node\n    const child = node.children[i]\n    if (end > child.end) return node\n    node = child\n  }\n}\n\n/**\n * A cursor for walking a tree, as Tree-sitter's `TreeCursor`. It starts at\n * a node and cannot move above it.\n *\n * @since 0.2.0\n * @category models\n */\nexport class TreeCursor<I extends Input = string> {\n  private current: SyntaxNode<I>\n  private depth = 0\n\n  /** @internal */\n  constructor(node: SyntaxNode<I>) {\n    this.current = node\n  }\n\n  /** The node at the cursor. */\n  get node(): SyntaxNode<I> {\n    return this.current\n  }\n\n  /** The field name of the node at the cursor, if any. */\n  get field(): string | undefined {\n    return this.depth === 0 ? undefined : this.current.field\n  }\n\n  /** Moves to the first child; `false` if there is none. */\n  gotoFirstChild(): boolean {\n    return this.goto(this.current.child(0))\n  }\n\n  /** Moves to the last child; `false` if there is none. */\n  gotoLastChild(): boolean {\n    return this.goto(this.current.child(-1))\n  }\n\n  /** Moves to the child containing the input unit at `offset`; `false` if there is none. */\n  gotoFirstChildForOffset(offset: number): boolean {\n    return this.goto(this.current.childAt(offset))\n  }\n\n  /** Moves to the next sibling; `false` if there is none. */\n  gotoNextSibling(): boolean {\n    if (this.depth === 0) return false\n    const next = this.current.nextSibling\n    if (next === undefined) return false\n    this.current = next\n    return true\n  }\n\n  /** Moves to the previous sibling; `false` if there is none. */\n  gotoPreviousSibling(): boolean {\n    if (this.depth === 0) return false\n    const previous = this.current.previousSibling\n    if (previous === undefined) return false\n    this.current = previous\n    return true\n  }\n\n  /** Moves to the parent; `false` at the node the cursor started at. */\n  gotoParent(): boolean {\n    const parent = this.current.parent\n    if (this.depth === 0 || parent === undefined) return false\n    this.current = parent\n    this.depth--\n    return true\n  }\n\n  /** Moves to the deepest node containing the input unit at `offset`. */\n  gotoDescendantAt(offset: number): void {\n    while (this.gotoFirstChildForOffset(offset)) {\n      // descend\n    }\n  }\n\n  /** Starts again at `node`. */\n  reset(node: SyntaxNode<I>): void {\n    this.current = node\n    this.depth = 0\n  }\n\n  private goto(node: SyntaxNode<I> | undefined): boolean {\n    if (node === undefined) return false\n    this.current = node\n    this.depth++\n    return true\n  }\n}\n\n// -----------------------------------------------------------------------------\n// Parsing\n// -----------------------------------------------------------------------------\n\nconst expectedEof = [\"end of input\"]\n\nconst run = <A, E, I extends Input>(config: Config, input: I, previous: Previous | undefined): Tree<A, E, I> => {\n  const state = new State<I>(input, { context: config.context })\n  const builder = new SyntaxBuilder(state, previous)\n  const a = Stack.run(config.inner.step, state)\n  // Text parsers record the encoding when they fail, which they may have done inside reused nodes\n  if (state.encoding === undefined && previous !== undefined) state.encoding = previous.encoding\n  let fatal: ErrorInfo | undefined\n  let value: Option.Option<A> = Option.none()\n  if (a === Fail) {\n    fatal = { failure: state.reportedFailure(), mode: state.mode }\n  } else if (state.pos < state.end) {\n    state.backtrack(\"Eof\", expectedEof)\n    fatal = { failure: state.reportedFailure(), mode: \"Backtrack\" }\n  } else {\n    value = Option.some(a as A)\n  }\n  const green = builder.finish(config.kind, Option.getOrUndefined(value), fatal, state.pos)\n  return new Tree<A, E, I>(input, value, builder.reused, green, config, state.encoding)\n}\n\n/**\n * Parses an input into a syntax {@link Tree}. The grammar's output is the\n * tree's `value`, and its {@link node}s are the tree's nodes. When the\n * grammar is itself a {@link node}, that node is the root; otherwise the\n * root is a node of kind `options.kind` (by default `\"document\"`).\n *\n * The parse never fails: recovered failures (see `Parser.resumeAfter`), a\n * fatal failure and unparsed input at the end all become `ERROR` nodes, and\n * are listed in `tree.errors`. The parse is interpreted, never compiled.\n *\n * @since 0.2.0\n * @category parsing\n */\nexport const parse: {\n  <A, E, I extends Input>(\n    grammar: Parser<A, E, never, I>,\n    input: NoInfer<Source<I>>,\n    options?: ParseOptions\n  ): Tree<A, E, I>\n  <A, E, R, I extends Input>(\n    grammar: Parser<A, E, R, I>,\n    input: NoInfer<Source<I>>,\n    options: ParseOptionsWithContext<R>\n  ): Tree<A, E, I>\n} = <A, E, R, I extends Input>(\n  grammar: Parser<A, E, R, I>,\n  input: I | Source<I>,\n  options?: ParseOptions & { readonly context?: Context.Context<R> }\n): Tree<A, E, I> => {\n  const n = nodeOf(grammar)\n  const isRoot = Predicate.isTagged(n, \"Syntax\") && n.kind !== undefined && n.named\n  const config: Config = {\n    kind: isRoot ? n.kind : (options?.kind ?? \"document\"),\n    inner: isRoot ? (n.self as Parser.Any) : grammar,\n    lookahead: options?.lookahead ?? 0,\n    context: options?.context as Context.Context<never> | undefined\n  }\n  return run(config, fromSource(input as Input) as I, undefined)\n}\n\n/**\n * Parses the new version of a tree's input, reusing the nodes of the tree\n * that the edits leave unchanged (Tree-sitter's `ts_tree_edit` followed by\n * `ts_parser_parse` with the old tree). The result is the tree a fresh\n * {@link parse} of `input` would build, but only the parts of the tree\n * around the edits are parsed again. `tree.reused` says how many nodes were\n * reused.\n *\n * `edits` describe how the old input became the new one, applied in order,\n * each in the coordinates of the input as the previous edits left it. When\n * they are omitted, the edit is found by comparing the inputs (their common\n * prefix and suffix), which takes time linear in their length but much less\n * than parsing.\n *\n * Errors in the new tree are those a fresh parse reports, except that an\n * error just after a reused node may list fewer expected alternatives.\n *\n * @example\n * ```ts\n * import { Ascii, Syntax } from \"@thomasfosterau/effect-parse\"\n *\n * const number = Syntax.node(Ascii.decInt, \"number\")\n * const tree = Syntax.parse(number, \"12\")\n * Syntax.reparse(tree, \"123\", [{ start: 2, oldEnd: 2, newEnd: 3 }]).root.value // 123\n * ```\n *\n * @since 0.2.0\n * @category parsing\n */\nexport const reparse = <A, E, I extends Input>(\n  tree: Tree<A, E, I>,\n  input: NoInfer<Source<I>>,\n  edits?: Edit | ReadonlyArray<Edit>\n): Tree<A, E, I> => {\n  const next = fromSource(input as Input) as I\n  const list =\n    edits === undefined\n      ? diffList(tree.input, next)\n      : \"start\" in edits\n        ? [edits as Edit]\n        : (edits as ReadonlyArray<Edit>)\n  const previous: Previous = {\n    root: tree.green,\n    oldLength: tree.input.length,\n    newLength: next.length,\n    segments: segmentsOf(tree.input.length, next.length, list),\n    input: tree.input,\n    extra: tree.config.lookahead,\n    encoding: tree.encoding\n  }\n  return run(tree.config, next, previous)\n}\n\n/**\n * Replaces `[start, end)` of a tree's string input with `text` and parses\n * the result incrementally (see {@link reparse}).\n *\n * @since 0.2.0\n * @category parsing\n */\nexport const replace = <A, E>(\n  tree: Tree<A, E, string>,\n  start: number,\n  end: number,\n  text: string\n): Tree<A, E, string> => {\n  const input = tree.input\n  if (start < 0 || end < start || end > input.length) {\n    throw new RangeError(`invalid range [${start}, ${end}) of an input of length ${input.length}`)\n  }\n  return reparse(tree, input.slice(0, start) + text + input.slice(end), {\n    start,\n    oldEnd: end,\n    newEnd: start + text.length\n  })\n}\n\n/**\n * Finds the edit that turns `before` into `after`: the part between their\n * longest common prefix and suffix. `undefined` when they are equal.\n *\n * @since 0.2.0\n * @category parsing\n */\nexport const diff = <I extends Input>(before: I, after: I): Edit | undefined => {\n  const a = before as any\n  const b = after as any\n  const at = Predicate.isString(a) ? (s: string, i: number) => s.charCodeAt(i) : (s: any, i: number) => s[i]\n  const max = Math.min(a.length, b.length)\n  let prefix = 0\n  while (prefix < max && at(a, prefix) === at(b, prefix)) prefix++\n  if (prefix === a.length && prefix === b.length) return undefined\n  let suffix = 0\n  while (suffix < max - prefix && at(a, a.length - 1 - suffix) === at(b, b.length - 1 - suffix)) suffix++\n  return { start: prefix, oldEnd: a.length - suffix, newEnd: b.length - suffix }\n}\n\nconst diffList = (before: Input, after: Input): ReadonlyArray<Edit> => {\n  const edit = diff(before, after)\n  return edit === undefined ? [] : [edit]\n}\n\n/** The stretches of the new input copied unchanged from the old one. */\nconst segmentsOf = (oldLength: number, newLength: number, edits: ReadonlyArray<Edit>): Array<Segment> => {\n  let segments: Array<Segment> = oldLength > 0 ? [{ newStart: 0, oldStart: 0, length: oldLength }] : []\n  let length = oldLength\n  for (const { newEnd, oldEnd, start } of edits) {\n    if (!(start >= 0 && oldEnd >= start && oldEnd <= length && newEnd >= start)) {\n      throw new RangeError(\n        `invalid edit { start: ${start}, oldEnd: ${oldEnd}, newEnd: ${newEnd} } of an input of length ${length}`\n      )\n    }\n    const delta = newEnd - oldEnd\n    const out: Array<Segment> = []\n    for (const s of segments) {\n      const end = s.newStart + s.length\n      if (s.newStart < start) {\n        out.push({ newStart: s.newStart, oldStart: s.oldStart, length: Math.min(end, start) - s.newStart })\n      }\n      if (end > oldEnd) {\n        const from = Math.max(s.newStart, oldEnd)\n        out.push({ newStart: from + delta, oldStart: s.oldStart + (from - s.newStart), length: end - from })\n      }\n    }\n    segments = out\n    length += delta\n  }\n  if (length !== newLength) {\n    throw new RangeError(`the edits give an input of length ${length}, but the new input has length ${newLength}`)\n  }\n  return segments\n}\n"],"mappings":";;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;AAoEA,MAAM,cAAc,MAAkB,MAAc,UAA+B;CACjF,MAAM,OAAO,KAAK;CAElB,MAAM,MAAM,IAAI,IAAI;CACpB,OAAO,WACJ,UAAU;EACT,MAAM,UAAU,MAAM;EACtB,OAAO,YAAY,KAAA,IAAY,KAAK,KAAK,IAAI,QAAQ,KAAK,OAAO,MAAM,KAAK,MAAM,KAAK;CACzF,GACA,KAAK,MACL;EAAE,MAAM;EAAU;EAAM;EAAM;CAAM,CACtC;AACF;;;;;;;;;;;;;;;;;;;AAoBA,MAAa,OAGK,mBAChB,IAC2B,MAA0B,SACnD,WAAW,MAAM,MAAM,IAAI,CAC/B;;;;;;;;;;;;;;;;;;AAmBA,MAAa,QAGK,oBACf,SAAS,SAAS,KAAK,EAAE,IACC,MAA0B,SACnD,WAAW,MAAM,QAAQ,iBAAiB,IAAI,GAAG,KAAK,CAC1D;AAEA,MAAM,oBAAoB,SAA6B;CACrD,MAAM,IAAI,OAAO,IAAI;CACrB,IAAI,UAAU,SAAS,GAAG,SAAS,KAAK,UAAU,SAAS,EAAE,OAAO,KAAK,CAAC,EAAE,UAAU,OAAO,EAAE;CAC/F,OAAO,KAAK,QAAQ;AACtB;;;;;;;;;;;;;;;;;;;;;;AAuBA,MAAa,QAGK,mBAAK,IAA8B,MAA0B,SAAqC;CAClH,MAAM,OAAO,KAAK;CAClB,OAAO,WACJ,UAAU;EACT,MAAM,UAAU,MAAM;EACtB,OAAQ,YAAY,KAAA,IAAY,KAAK,KAAK,IAAI,QAAQ,MAAM,OAAO,MAAM,IAAI;CAC/E,GACA,KAAK,MACL;EAAE,MAAM;EAAU;EAAM,MAAM,KAAA;EAAW,OAAO;CAAM,CACxD;AACF,CAAC;;;;;;;AAYD,MAAa,QAAiB;;;;;;;;AAkE9B,IAAa,OAAb,MAAkE;CASrD;CAEA;CAEA;CAEA;CAEA;CAEA;;CAjBX;CACA;CACA;;CAGA,YAEE,OAEA,OAEA,QAEA,OAEA,QAEA,UACA;EAXS,KAAA,QAAA;EAEA,KAAA,QAAA;EAEA,KAAA,SAAA;EAEA,KAAA,QAAA;EAEA,KAAA,SAAA;EAEA,KAAA,WAAA;EAET,KAAK,OAAO,IAAI,WAAW,MAAM,OAAO,GAAG,KAAA,GAAW,CAAC;CACzD;;;;;;CAOA,IAAI,SAAkD;EACpD,IAAI,KAAK,cAAc,KAAA,GAAW;GAChC,MAAM,MAAuC,CAAC;GAC9C,MAAM,SAAS,OAAc,UAAkB;IAC7C,IAAI,CAAC,MAAM,UAAU;IACrB,IAAI,MAAM,UAAU,KAAA,GAAW,IAAI,KAAK,KAAK,QAAQ,MAAM,OAAO,KAAK,CAAC;IACxE,KAAK,IAAI,IAAI,GAAG,IAAI,MAAM,SAAS,QAAQ,KAAK,MAAM,MAAM,SAAS,IAAI,QAAQ,MAAM,QAAQ,EAAE;GACnG;GACA,MAAM,KAAK,OAAO,CAAC;GACnB,KAAK,YAAY;EACnB;EACA,OAAO,KAAK;CACd;;CAGA,IAAI,YAAqB;EACvB,OAAO,KAAK,MAAM;CACpB;;CAGA,aAAa,OAAe,KAA6B;EACvD,OAAO,KAAK,KAAK,aAAa,OAAO,GAAG;CAC1C;;CAGA,OAAsB;EACpB,OAAO,IAAI,WAAW,KAAK,IAAI;CACjC;;;;;;CAOA,WAAW,QAAuC;EAChD,MAAM,QAAQ,KAAK;EACnB,IAAI,CAAC,UAAU,SAAS,KAAK,GAAG,OAAO,WAAW,WAAW,OAAO,QAAQ,KAAK,QAAQ;EACzF,IAAI,QAAQ,KAAK;EACjB,IAAI,UAAU,KAAA,GAAW;GACvB,QAAQ,CAAC,CAAC;GACV,KAAK,IAAI,IAAI,MAAM,QAAQ,IAAI,GAAG,KAAK,GAAG,IAAI,MAAM,QAAQ,MAAM,IAAI,CAAC,GAAG,MAAM,KAAK,IAAI,CAAC;GAC1F,KAAK,QAAQ;EACf;EACA,MAAM,KAAK,KAAK,IAAI,GAAG,KAAK,IAAI,QAAQ,MAAM,MAAM,CAAC;EACrD,IAAI,KAAK;EACT,IAAI,KAAK,MAAM,SAAS;EACxB,OAAO,KAAK,IAAI;GACd,MAAM,MAAO,KAAK,KAAK,KAAM;GAC7B,IAAI,MAAM,QAAQ,IAAI,KAAK;QACtB,KAAK,MAAM;EAClB;EACA,MAAM,YAAY,MAAM;EACxB,OAAO;GAAE,MAAM,KAAK;GAAG,QAAQ,WAAW,WAAW,MAAM,MAAM,WAAW,EAAE,GAAG,KAAK,SAAS,CAAC,CAAC;EAAO;CAC1G;;CAGA,WAAmB;EACjB,OAAO,KAAK,KAAK,SAAS;CAC5B;;CAGA,QAAQ,OAAkB,OAAyC;EACjE,OAAO,WAAW,YAAe,KAAK,OAAO,SAAS,MAAM,SAAS,KAAK,GAAG,MAAM,MAAM,KAAK,QAAQ;CACxG;AACF;;;;;;;;;AAUA,IAAa,aAAb,MAAa,WAAqC;CAMrC;CAEA;CAEA;CAEA;CAEA;CAbX;;CAGA,YAEE,MAEA,OAEA,OAEA,QAEA,OACA;EATS,KAAA,OAAA;EAEA,KAAA,QAAA;EAEA,KAAA,QAAA;EAEA,KAAA,SAAA;EAEA,KAAA,QAAA;CACR;;CAGH,IAAI,OAAe;EACjB,OAAO,KAAK,MAAM;CACpB;;CAGA,IAAI,QAAiB;EACnB,OAAO,KAAK,MAAM;CACpB;;CAGA,IAAI,QAA4B;EAC9B,OAAO,KAAK,QAAQ,MAAM,SAAS,KAAK;CAC1C;;CAGA,IAAI,MAAc;EAChB,OAAO,KAAK,QAAQ,KAAK,MAAM;CACjC;;CAGA,IAAI,SAAiB;EACnB,OAAO,KAAK,MAAM;CACpB;;CAGA,IAAI,QAAiB;EACnB,OAAO,KAAK,MAAM;CACpB;;CAGA,IAAI,OAAiB;EACnB,MAAM,QAAQ,KAAK,KAAK;EACxB,OAAO,iBAAiB,aACnB,MAAM,SAAS,KAAK,OAAO,KAAK,GAAG,IACpC,MAAM,MAAM,KAAK,OAAO,KAAK,GAAG;CACtC;;CAGA,IAAI,UAAmB;EACrB,OAAO,KAAK,MAAM,UAAU,KAAA;CAC9B;;CAGA,IAAI,WAAoB;EACtB,OAAO,KAAK,MAAM;CACpB;;CAGA,IAAI,QAAoD;EACtD,MAAM,QAAQ,KAAK,MAAM;EACzB,OAAO,UAAU,KAAA,IAAY,KAAA,IAAY,KAAK,KAAK,QAAQ,OAAO,KAAK,KAAK;CAC9E;;CAGA,IAAI,WAAyC;EAC3C,IAAI,KAAK,cAAc,KAAA,GAAW;GAChC,MAAM,QAAQ,KAAK;GACnB,MAAM,MAAM,IAAI,MAAqB,MAAM,SAAS,MAAM;GAC1D,KAAK,IAAI,IAAI,GAAG,IAAI,IAAI,QAAQ,KAAK,IAAI,KAAK,KAAK,UAAU,CAAC;GAC9D,KAAK,YAAY;EACnB;EACA,OAAO,KAAK;CACd;;CAGA,IAAI,aAAqB;EACvB,OAAO,KAAK,MAAM,SAAS;CAC7B;;CAGA,MAAM,OAA0C;EAC9C,MAAM,IAAI,KAAK,MAAM,SAAS;EAC9B,MAAM,IAAI,QAAQ,IAAI,IAAI,QAAQ;EAClC,OAAO,KAAK,KAAK,IAAI,IAAI,KAAK,SAAS,KAAK,KAAA;CAC9C;;CAGA,IAAI,gBAA8C;EAChD,OAAO,KAAK,SAAS,QAAQ,MAAM,EAAE,KAAK;CAC5C;;CAGA,WAAW,OAA0C;EACnD,OAAO,KAAK,cAAc;CAC5B;;CAGA,aAAa,MAAyC;EACpD,MAAM,SAAS,KAAK,MAAM;EAC1B,IAAI,WAAW,KAAA,GAAW,OAAO,KAAA;EACjC,MAAM,IAAI,OAAO,QAAQ,IAAI;EAC7B,OAAO,IAAI,IAAI,KAAA,IAAY,KAAK,SAAS;CAC3C;;CAGA,gBAAgB,MAA4C;EAC1D,MAAM,SAAS,KAAK,MAAM;EAC1B,IAAI,WAAW,KAAA,GAAW,OAAO,CAAC;EAClC,OAAO,KAAK,SAAS,QAAQ,GAAG,MAAM,OAAO,OAAO,IAAI;CAC1D;;CAGA,IAAI,cAAyC;EAC3C,OAAO,KAAK,QAAQ,SAAS,KAAK,QAAQ;CAC5C;;CAGA,IAAI,kBAA6C;EAC/C,OAAO,KAAK,QAAQ,IAAI,KAAK,QAAQ,SAAS,KAAK,QAAQ,KAAK,KAAA;CAClE;;CAGA,IAAI,mBAA8C;EAChD,MAAM,WAAW,KAAK,QAAQ;EAC9B,IAAI,aAAa,KAAA,GAAW,OAAO,KAAA;EACnC,KAAK,IAAI,IAAI,KAAK,QAAQ,GAAG,IAAI,SAAS,QAAQ,KAAK,IAAI,SAAS,EAAE,CAAC,OAAO,OAAO,SAAS;CAEhG;;CAGA,IAAI,uBAAkD;EACpD,MAAM,WAAW,KAAK,QAAQ;EAC9B,IAAI,aAAa,KAAA,GAAW,OAAO,KAAA;EACnC,KAAK,IAAI,IAAI,KAAK,QAAQ,GAAG,KAAK,GAAG,KAAK,IAAI,SAAS,EAAE,CAAC,OAAO,OAAO,SAAS;CAEnF;;;;;CAMA,aAAa,QAAwB;EACnC,MAAM,QAAQ,KAAK;EACnB,MAAM,UAAU,MAAM;EACtB,MAAM,MAAM,SAAS,KAAK;EAC1B,IAAI,KAAK;EACT,IAAI,KAAK,QAAQ,SAAS;EAC1B,IAAI,QAAQ;EACZ,OAAO,MAAM,IAAI;GACf,MAAM,MAAO,KAAK,MAAO;GACzB,IAAI,QAAQ,QAAQ,KAAK;IACvB,QAAQ;IACR,KAAK,MAAM;GACb,OACE,KAAK,MAAM;EAEf;EAEA,OAAO,SAAS,KAAK,MAAM,SAAS,MAAM,CAAC,UAAU,KAAK,QAAQ,WAAW,KAAK;EAClF,OAAO,SAAS,KAAK,MAAM,QAAQ,SAAS,MAAM,SAAS,MAAM,CAAC,QAAQ,QAAQ;CACpF;;CAGA,QAAQ,QAA2C;EACjD,MAAM,IAAI,KAAK,aAAa,MAAM;EAClC,OAAO,IAAI,IAAI,KAAA,IAAY,KAAK,SAAS;CAC3C;;;;;;;;CASA,aAAa,OAAe,MAAc,QAAQ,GAAkB;EAClE,OAAO,aAAa,MAAM,OAAO,GAAG;CACtC;;CAGA,kBAAkB,OAAe,MAAc,QAAQ,GAAkB;EACvE,IAAI,OAAsB,KAAK,aAAa,OAAO,GAAG;EAEtD,OAAO,CAAC,KAAK,SAAS,SAAS,MAAM,OAAO,KAAK,UAAU;EAC3D,OAAO;CACT;;CAGA,CAAC,cAAyD;EACxD,MAAM,SAAS,KAAK,KAAK;EACzB,OAAO,MAAM;GACX,MAAM,OAAO;GACb,IAAI,OAAO,eAAe,GAAG;GAC7B,OAAO,CAAC,OAAO,gBAAgB,GAC7B,IAAI,CAAC,OAAO,WAAW,GAAG;EAE9B;CACF;;CAGA,CAAC,kBAAkB,MAAyD;EAC1E,KAAK,MAAM,KAAK,KAAK,YAAY,GAAG,IAAI,EAAE,SAAS,MAAM,MAAM;CACjE;;CAGA,OAAsB;EACpB,OAAO,IAAI,WAAW,IAAI;CAC5B;;;;;CAMA,WAAmB;EACjB,IAAI,MAAM;EACV,MAAM,SAAS,OAAc,UAA8B;GACzD,IAAI,MAAM,SAAS,UAAU,KAAK,OAAO;IACvC,IAAI,IAAI,WAAW,GAAG,GAAG,OAAO;IAChC,IAAI,UAAU,KAAA,GAAW,OAAO,GAAG,MAAM;IACzC,OAAO,IAAI,MAAM;IACjB,KAAK,IAAI,IAAI,GAAG,IAAI,MAAM,SAAS,QAAQ,KAAK,MAAM,MAAM,SAAS,IAAI,MAAM,SAAS,EAAE;IAC1F,OAAO;GACT,OACE,KAAK,IAAI,IAAI,GAAG,IAAI,MAAM,SAAS,QAAQ,KAAK,MAAM,MAAM,SAAS,IAAI,MAAM,SAAS,EAAE;EAE9F;EACA,MAAM,KAAK,OAAO,KAAK,KAAK;EAC5B,OAAO;CACT;CAEA,SAAkB;EAChB,OAAO;GAAE,MAAM,KAAK;GAAM,OAAO,KAAK;GAAO,KAAK,KAAK;EAAI;CAC7D;CAEA,UAAkB,GAA0B;EAC1C,MAAM,QAAQ,KAAK;EACnB,OAAO,IAAI,WAAW,KAAK,MAAM,MAAM,SAAS,IAAI,KAAK,QAAQ,MAAM,QAAQ,IAAI,MAAM,CAAC;CAC5F;AACF;;AAGA,MAAM,gBAAiC,MAAqB,OAAe,QAA+B;CACxG,IAAI,OAAO;CACX,OAAO,MAAM;EACX,MAAM,IAAI,KAAK,aAAa,KAAK;EACjC,IAAI,IAAI,GAAG,OAAO;EAClB,MAAM,QAAQ,KAAK,SAAS;EAC5B,IAAI,MAAM,MAAM,KAAK,OAAO;EAC5B,OAAO;CACT;AACF;;;;;;;;AASA,IAAa,aAAb,MAAkD;CAChD;CACA,QAAgB;;CAGhB,YAAY,MAAqB;EAC/B,KAAK,UAAU;CACjB;;CAGA,IAAI,OAAsB;EACxB,OAAO,KAAK;CACd;;CAGA,IAAI,QAA4B;EAC9B,OAAO,KAAK,UAAU,IAAI,KAAA,IAAY,KAAK,QAAQ;CACrD;;CAGA,iBAA0B;EACxB,OAAO,KAAK,KAAK,KAAK,QAAQ,MAAM,CAAC,CAAC;CACxC;;CAGA,gBAAyB;EACvB,OAAO,KAAK,KAAK,KAAK,QAAQ,MAAM,EAAE,CAAC;CACzC;;CAGA,wBAAwB,QAAyB;EAC/C,OAAO,KAAK,KAAK,KAAK,QAAQ,QAAQ,MAAM,CAAC;CAC/C;;CAGA,kBAA2B;EACzB,IAAI,KAAK,UAAU,GAAG,OAAO;EAC7B,MAAM,OAAO,KAAK,QAAQ;EAC1B,IAAI,SAAS,KAAA,GAAW,OAAO;EAC/B,KAAK,UAAU;EACf,OAAO;CACT;;CAGA,sBAA+B;EAC7B,IAAI,KAAK,UAAU,GAAG,OAAO;EAC7B,MAAM,WAAW,KAAK,QAAQ;EAC9B,IAAI,aAAa,KAAA,GAAW,OAAO;EACnC,KAAK,UAAU;EACf,OAAO;CACT;;CAGA,aAAsB;EACpB,MAAM,SAAS,KAAK,QAAQ;EAC5B,IAAI,KAAK,UAAU,KAAK,WAAW,KAAA,GAAW,OAAO;EACrD,KAAK,UAAU;EACf,KAAK;EACL,OAAO;CACT;;CAGA,iBAAiB,QAAsB;EACrC,OAAO,KAAK,wBAAwB,MAAM;CAG5C;;CAGA,MAAM,MAA2B;EAC/B,KAAK,UAAU;EACf,KAAK,QAAQ;CACf;CAEA,KAAa,MAA0C;EACrD,IAAI,SAAS,KAAA,GAAW,OAAO;EAC/B,KAAK,UAAU;EACf,KAAK;EACL,OAAO;CACT;AACF;AAMA,MAAM,cAAc,CAAC,cAAc;AAEnC,MAAM,OAA8B,QAAgB,OAAU,aAAkD;CAC9G,MAAM,QAAQ,IAAI,MAAS,OAAO,EAAE,SAAS,OAAO,QAAQ,CAAC;CAC7D,MAAM,UAAU,IAAI,cAAc,OAAO,QAAQ;CACjD,MAAM,IAAI,MAAM,IAAI,OAAO,MAAM,MAAM,KAAK;CAE5C,IAAI,MAAM,aAAa,KAAA,KAAa,aAAa,KAAA,GAAW,MAAM,WAAW,SAAS;CACtF,IAAI;CACJ,IAAI,QAA0B,OAAO,KAAK;CAC1C,IAAI,MAAM,MACR,QAAQ;EAAE,SAAS,MAAM,gBAAgB;EAAG,MAAM,MAAM;CAAK;MACxD,IAAI,MAAM,MAAM,MAAM,KAAK;EAChC,MAAM,UAAU,OAAO,WAAW;EAClC,QAAQ;GAAE,SAAS,MAAM,gBAAgB;GAAG,MAAM;EAAY;CAChE,OACE,QAAQ,OAAO,KAAK,CAAM;CAE5B,MAAM,QAAQ,QAAQ,OAAO,OAAO,MAAM,OAAO,eAAe,KAAK,GAAG,OAAO,MAAM,GAAG;CACxF,OAAO,IAAI,KAAc,OAAO,OAAO,QAAQ,QAAQ,OAAO,QAAQ,MAAM,QAAQ;AACtF;;;;;;;;;;;;;;AAeA,MAAa,SAYX,SACA,OACA,YACkB;CAClB,MAAM,IAAI,OAAO,OAAO;CACxB,MAAM,SAAS,UAAU,SAAS,GAAG,QAAQ,KAAK,EAAE,SAAS,KAAA,KAAa,EAAE;CAC5E,MAAM,SAAiB;EACrB,MAAM,SAAS,EAAE,OAAQ,SAAS,QAAQ;EAC1C,OAAO,SAAU,EAAE,OAAsB;EACzC,WAAW,SAAS,aAAa;EACjC,SAAS,SAAS;CACpB;CACA,OAAO,IAAI,QAAQ,WAAW,KAAc,GAAQ,KAAA,CAAS;AAC/D;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;AA+BA,MAAa,WACX,MACA,OACA,UACkB;CAClB,MAAM,OAAO,WAAW,KAAc;CACtC,MAAM,OACJ,UAAU,KAAA,IACN,SAAS,KAAK,OAAO,IAAI,IACzB,WAAW,QACT,CAAC,KAAa,IACb;CACT,MAAM,WAAqB;EACzB,MAAM,KAAK;EACX,WAAW,KAAK,MAAM;EACtB,WAAW,KAAK;EAChB,UAAU,WAAW,KAAK,MAAM,QAAQ,KAAK,QAAQ,IAAI;EACzD,OAAO,KAAK;EACZ,OAAO,KAAK,OAAO;EACnB,UAAU,KAAK;CACjB;CACA,OAAO,IAAI,KAAK,QAAQ,MAAM,QAAQ;AACxC;;;;;;;;AASA,MAAa,WACX,MACA,OACA,KACA,SACuB;CACvB,MAAM,QAAQ,KAAK;CACnB,IAAI,QAAQ,KAAK,MAAM,SAAS,MAAM,MAAM,QAC1C,MAAM,IAAI,WAAW,kBAAkB,MAAM,IAAI,IAAI,0BAA0B,MAAM,QAAQ;CAE/F,OAAO,QAAQ,MAAM,MAAM,MAAM,GAAG,KAAK,IAAI,OAAO,MAAM,MAAM,GAAG,GAAG;EACpE;EACA,QAAQ;EACR,QAAQ,QAAQ,KAAK;CACvB,CAAC;AACH;;;;;;;;AASA,MAAa,QAAyB,QAAW,UAA+B;CAC9E,MAAM,IAAI;CACV,MAAM,IAAI;CACV,MAAM,KAAK,UAAU,SAAS,CAAC,KAAK,GAAW,MAAc,EAAE,WAAW,CAAC,KAAK,GAAQ,MAAc,EAAE;CACxG,MAAM,MAAM,KAAK,IAAI,EAAE,QAAQ,EAAE,MAAM;CACvC,IAAI,SAAS;CACb,OAAO,SAAS,OAAO,GAAG,GAAG,MAAM,MAAM,GAAG,GAAG,MAAM,GAAG;CACxD,IAAI,WAAW,EAAE,UAAU,WAAW,EAAE,QAAQ,OAAO,KAAA;CACvD,IAAI,SAAS;CACb,OAAO,SAAS,MAAM,UAAU,GAAG,GAAG,EAAE,SAAS,IAAI,MAAM,MAAM,GAAG,GAAG,EAAE,SAAS,IAAI,MAAM,GAAG;CAC/F,OAAO;EAAE,OAAO;EAAQ,QAAQ,EAAE,SAAS;EAAQ,QAAQ,EAAE,SAAS;CAAO;AAC/E;AAEA,MAAM,YAAY,QAAe,UAAsC;CACrE,MAAM,OAAO,KAAK,QAAQ,KAAK;CAC/B,OAAO,SAAS,KAAA,IAAY,CAAC,IAAI,CAAC,IAAI;AACxC;;AAGA,MAAM,cAAc,WAAmB,WAAmB,UAA+C;CACvG,IAAI,WAA2B,YAAY,IAAI,CAAC;EAAE,UAAU;EAAG,UAAU;EAAG,QAAQ;CAAU,CAAC,IAAI,CAAC;CACpG,IAAI,SAAS;CACb,KAAK,MAAM,EAAE,QAAQ,QAAQ,WAAW,OAAO;EAC7C,IAAI,EAAE,SAAS,KAAK,UAAU,SAAS,UAAU,UAAU,UAAU,QACnE,MAAM,IAAI,WACR,yBAAyB,MAAM,YAAY,OAAO,YAAY,OAAO,2BAA2B,QAClG;EAEF,MAAM,QAAQ,SAAS;EACvB,MAAM,MAAsB,CAAC;EAC7B,KAAK,MAAM,KAAK,UAAU;GACxB,MAAM,MAAM,EAAE,WAAW,EAAE;GAC3B,IAAI,EAAE,WAAW,OACf,IAAI,KAAK;IAAE,UAAU,EAAE;IAAU,UAAU,EAAE;IAAU,QAAQ,KAAK,IAAI,KAAK,KAAK,IAAI,EAAE;GAAS,CAAC;GAEpG,IAAI,MAAM,QAAQ;IAChB,MAAM,OAAO,KAAK,IAAI,EAAE,UAAU,MAAM;IACxC,IAAI,KAAK;KAAE,UAAU,OAAO;KAAO,UAAU,EAAE,YAAY,OAAO,EAAE;KAAW,QAAQ,MAAM;IAAK,CAAC;GACrG;EACF;EACA,WAAW;EACX,UAAU;CACZ;CACA,IAAI,WAAW,WACb,MAAM,IAAI,WAAW,qCAAqC,OAAO,iCAAiC,WAAW;CAE/G,OAAO;AACT"}

package/dist/Text.d.ts

@@ -1,7 +1,6 @@
 import { Parser, Range } from "./Parser.js";
 import { StringTokenSet } from "./Token.js";
 import { Encoding } from "./Encoding.js";
-//#region src/Text.d.ts
 /**
  * A predicate over characters. It accepts a one-character string or a code
  * point.
@@ -290,5 +289,4 @@ export declare const utf16be: TextParsers<Uint8Array>;
  * @category instances
  */
 export declare const latin1: TextParsers<Uint8Array>;
-//#endregion
 //# sourceMappingURL=Text.d.ts.map

package/dist/Text.d.ts.map

@@ -1 +1 @@
-{"version":3,"file":"Text.d.ts","names":[],"sources":["../src/Text.ts"],"mappings":";;;;;;;;;;;YAgEY,iBAAiB;;;;;;;;;;;;;;;;;qBAsChB,WAAY,iBAAe;;;;;;;;qBAS3B,cAAc;;;;;;;qBAQd,UAAU;;;;;;;qBAQV,aAAa;;;;;;;qBAQb,aAAa;;;;;;;;qBASb,gBAAgB;;;;;;;;qBAShB,WAAW;;;;;;;qBAQX,gBAAgB;;;;;;;;qBAShB,cAAc;;;;;;;;qBASd,SAAS;;;;;;;;qBAYT,WAAW;;;;;;;;qBASX,cAAc;;;;;;;qBAQd,eAAe;;;;;;;qBAQf,WAAW;;;;;;;;;;;;iBAiBP,YAAY,mBAAmB;;WAErC,UAAU,SAAS;;WAKnB,KAAK,6BAA6B;;;;;WAKlC,gBAAgB,kBAAkB,SAAS,MAAM,OAAO,iBAAiB;;;;;;WAMzE,WAAW,oBAAoB,6BAA6B;;WAE5D,QAAQ,KAAK,mBAAmB,6BAA6B;;WAE7D,SAAS,KAAK,mBAAmB,6BAA6B;;WAE9D,KAAK,8BAA8B;;WAKnC,OAAO,kBAAkB,6BAA6B;;WAEtD,YAAY,KAAK,gBAAgB,QAAQ,UAAU,6BAA6B;;WAEhF,WAAW,KAAK,gBAAgB,QAAQ,UAAU,6BAA6B;;WAE/E,YAAY,iBAAiB,QAAQ,UAAU,6BAA6B;;WAE5E,MAAM,6BAA6B;;;;;WAKnC,QAAQ,GAAG,GAAG,GAAG,MAAM,OAAO,GAAG,GAAG,GAAG,OAAO,eAAe,GAAG,GAAG;;WAKnE,QAAQ,6BAA6B;;WAErC,QAAQ,6BAA6B;;WAErC,QAAQ,6BAA6B;;WAErC,QAAQ,6BAA6B;;WAErC,eAAe,6BAA6B;;WAE5C,eAAe,6BAA6B;;WAE5C,QAAQ,6BAA6B;;WAErC,QAAQ,6BAA6B;;WAErC,aAAa,6BAA6B;;WAE1C,aAAa,6BAA6B;;;;;WAK1C,YAAY,6BAA6B;;WAKzC,SAAS,2BAA2B;;WAEpC,MAAM,6BAA6B;;WAEnC,KAAK,2BAA2B;;WAEhC,YAAY,oCAAoC;;WAEhD,gBAAgB,6BAA6B;;WAK7C,SAAS,8BAA8B;;WAEvC,QAAQ,8BAA8B;;WAEtC,YAAY,6BAA6B;;WAEzC,WAAW,6BAA6B;;WAExC,SAAS,8BAA8B;;WAEvC,OAAO,6BAA6B;;;;;WAQpC,cAAc,GAAG,GAAG,GAAG,GAAG,IAAI,IACrC,QAAQ,OAAO,GAAG,GAAG,GAAG,IACxB,iBACA,WAAW,OAAO,GAAG,IAAI,IAAI,OAC1B,eAAe,IAAI,IAAI,IAAI,IAAI;;;;;WAK3B,UAAU,GAAG,GAAG,IAAI,IAC3B,QAAQ,eAAe,GAAG,GAAG,IAC7B,iBACA,QAAQ,eAAe,IAAI,IAAI,OAC5B,eAAe,IAAI,IAAI,IAAI,IAAI;;;;;;;;;;;;;;;;qBAyCzB,OAAQ,mBAAmB,YAAY,UAAU,SAAS,OAAK,YAAY;;;;;;;qBAuZ3E,QAAQ;;;;;;;;;;;;;;;;qBAiBR,MAAM,YAAY;;;;;;;qBAQlB,SAAS,YAAY;;;;;;;qBAQrB,SAAS,YAAY;;;;;;;qBAQrB,QAAQ,YAAY"}
+{"version":3,"file":"Text.d.ts","names":[],"sources":["../src/Text.ts"],"mappings":";;;;;;;;;;YAgEY,iBAAiB;;;;;;;;;;;;;;;;;qBAsChB,WAAY,iBAAe;;;;;;;;qBAS3B,cAAc;;;;;;;qBAQd,UAAU;;;;;;;qBAQV,aAAa;;;;;;;qBAQb,aAAa;;;;;;;;qBASb,gBAAgB;;;;;;;;qBAShB,WAAW;;;;;;;qBAQX,gBAAgB;;;;;;;;qBAShB,cAAc;;;;;;;;qBASd,SAAS;;;;;;;;qBAYT,WAAW;;;;;;;;qBASX,cAAc;;;;;;;qBAQd,eAAe;;;;;;;qBAQf,WAAW;;;;;;;;;;;;iBAiBP,YAAY,mBAAmB;;WAErC,UAAU,SAAS;;WAKnB,KAAK,6BAA6B;;;;;WAKlC,gBAAgB,kBAAkB,SAAS,MAAM,OAAO,iBAAiB;;;;;;WAMzE,WAAW,oBAAoB,6BAA6B;;WAE5D,QAAQ,KAAK,mBAAmB,6BAA6B;;WAE7D,SAAS,KAAK,mBAAmB,6BAA6B;;WAE9D,KAAK,8BAA8B;;WAKnC,OAAO,kBAAkB,6BAA6B;;WAEtD,YAAY,KAAK,gBAAgB,QAAQ,UAAU,6BAA6B;;WAEhF,WAAW,KAAK,gBAAgB,QAAQ,UAAU,6BAA6B;;WAE/E,YAAY,iBAAiB,QAAQ,UAAU,6BAA6B;;WAE5E,MAAM,6BAA6B;;;;;WAKnC,QAAQ,GAAG,GAAG,GAAG,MAAM,OAAO,GAAG,GAAG,GAAG,OAAO,eAAe,GAAG,GAAG;;WAKnE,QAAQ,6BAA6B;;WAErC,QAAQ,6BAA6B;;WAErC,QAAQ,6BAA6B;;WAErC,QAAQ,6BAA6B;;WAErC,eAAe,6BAA6B;;WAE5C,eAAe,6BAA6B;;WAE5C,QAAQ,6BAA6B;;WAErC,QAAQ,6BAA6B;;WAErC,aAAa,6BAA6B;;WAE1C,aAAa,6BAA6B;;;;;WAK1C,YAAY,6BAA6B;;WAKzC,SAAS,2BAA2B;;WAEpC,MAAM,6BAA6B;;WAEnC,KAAK,2BAA2B;;WAEhC,YAAY,oCAAoC;;WAEhD,gBAAgB,6BAA6B;;WAK7C,SAAS,8BAA8B;;WAEvC,QAAQ,8BAA8B;;WAEtC,YAAY,6BAA6B;;WAEzC,WAAW,6BAA6B;;WAExC,SAAS,8BAA8B;;WAEvC,OAAO,6BAA6B;;;;;WAQpC,cAAc,GAAG,GAAG,GAAG,GAAG,IAAI,IACrC,QAAQ,OAAO,GAAG,GAAG,GAAG,IACxB,iBACA,WAAW,OAAO,GAAG,IAAI,IAAI,OAC1B,eAAe,IAAI,IAAI,IAAI,IAAI;;;;;WAK3B,UAAU,GAAG,GAAG,IAAI,IAC3B,QAAQ,eAAe,GAAG,GAAG,IAC7B,iBACA,QAAQ,eAAe,IAAI,IAAI,OAC5B,eAAe,IAAI,IAAI,IAAI,IAAI;;;;;;;;;;;;;;;;qBAyCzB,OAAQ,mBAAmB,YAAY,UAAU,SAAS,OAAK,YAAY;;;;;;;qBAuZ3E,QAAQ;;;;;;;;;;;;;;;;qBAiBR,MAAM,YAAY;;;;;;;qBAQlB,SAAS,YAAY;;;;;;;qBAQrB,SAAS,YAAY;;;;;;;qBAQrB,QAAQ,YAAY"}

package/dist/Text.js

@@ -6,7 +6,7 @@ import { codePointPredicate, compile, indexOf, matchLiteral } from "./internal/t
 import * as internal from "./internal/text.js";
 import { escapedImpl, overflow, takeEscapedImpl, toFloat as toFloat$1 } from "./Ascii.js";
 import * as Encodings from "./Encoding.js";
-//#region src/Text.ts
+// src/Text.ts
 /**
 * Unicode text parsers, generic over the input's encoding.
 *
@@ -561,7 +561,6 @@ const utf16be = /*#__PURE__*/ make(Encodings.utf16be);
 * @category instances
 */
 const latin1 = /*#__PURE__*/ make(Encodings.latin1);
-//#endregion
 export { isAlphabetic, isAlphanumeric, isControl, isDecimalDigit, isIdContinue, isIdStart, isLetter, isLowercase, isNumeric, isPunctuation, isSpace, isUppercase, isWhitespace, latin1, make, property, string, utf16be, utf16le, utf8 };
 
 //# sourceMappingURL=Text.js.map

package/dist/Token.d.ts

@@ -1,7 +1,6 @@
 import { Input, Slice, Token } from "./Input.js";
 import { Parser, Range } from "./Parser.js";
 import { ErrorKind } from "./ParseError.js";
-//#region src/Token.d.ts
 /**
  * An inclusive range of tokens, e.g. `Token.range("a", "z")`.
  *
@@ -238,6 +237,5 @@ export declare const restLen: Parser<number, never, never, Input>;
  * @category tokens
  */
 export declare const satisfy: <I extends Input = string>(predicate: (token: Token<I>) => boolean) => Parser<Token<NoInfer<I>>, never, never, NoInfer<I>>;
-//#endregion
 export type { Token };
 //# sourceMappingURL=Token.d.ts.map

package/dist/Token.d.ts.map

@@ -1 +1 @@
-{"version":3,"file":"Token.d.ts","names":[],"sources":["../src/Token.ts"],"mappings":";;;;;;;;;;iBAyDiB,WAAW;WACjB;WACA,MAAM;WACN,IAAI;;;;;;;;qBASF,QAAS,2BAA2B,MAAM,GAAG,IAAI,MAAI,WAAW;cAE/D;;;;;;;;;iBAUG;GACd;YACS;;;;;;;;;;;;;;;;;;;;;;;;;;;;;qBA8BC,aACX,cACA,YAAY,+BACZ,SAAS,6CACR;;;;;;;;;;YAiBS,0BAER,qBACA,eACE,4BACF,cAAc;;;;;;;;YASN,iCAGR,aACA,qBACA,eACE,4BACF,cAAc;;;;;;;;YASN,SAAS,KAAK,mBACtB,iBACA,UAAU,aACR,eACA,UAAU,oBAAoB,OAC1B,OAAO,iBAAiB,cAAc;;;;;;;;qBAoCnC,KAAK;;;;;;;;;;;;;;;qBAgBL,WAAY,UAAU,qBAAmB,OAAO,MAAM,QAAQ,mBAAmB,QAAQ;;;;;;;;;;;;;;;;;qBAkBzF;SACJ,kBAAkB,SAAS,IAAI,OAAO;GAC5C,SAAS,aAAa,OAAO,0BAA0B;SACjD,GAAG,SAAS,cAAc,KAAK,OAAO,cAAc,kBAAkB,cAAc;;;qBAIhF,cAAe,KAAK,OAAO,sBAAoB;;;;;;;;;;;;;;;;;qBAyC/C,QAAS,UAAU,gBAC9B,KAAK,SAAS,OACb,OAAO,MAAM,QAAQ,mBAAmB,QAAQ;;;;;;;;qBAsBtC,SAAU,UAAU,gBAC/B,KAAK,SAAS,OACb,OAAO,MAAM,QAAQ,mBAAmB,QAAQ;;;;;;;qBAqBtC,OAAQ,UAAU,gBAAgB,kBAAgB,OAAO,MAAM,QAAQ,mBAAmB,QAAQ;;qBAsBlG,gBAAiB,UAAU,OACtC,cACA,GAAG,mBACH,iBACA,cACA,sBACA,OAAM,WACN,mBACC,OAAO,MAAM,QAAQ,mBAAmB,QAAQ;;;;;;;;;;;;;;;;;;;;qBAuCtC,YAAa,UAAU,gBAClC,KAAK,SAAS,IACd,QAAQ,UACP,OAAO,MAAM,QAAQ,mBAAmB,QAAQ;;;;;;;;qBAStC,WAAY,UAAU,gBACjC,KAAK,SAAS,IACd,QAAQ,UACP,OAAO,MAAM,QAAQ,mBAAmB,QAAQ;;;;;;;;;qBAUtC;GACV,iBAAiB,QAAQ,QAAQ;GACjC,SAAS,YAAY,QAAQ,QAAQ,OAAO,0BAA0B;GACtE,GAAG,SAAS,cAAc,IAAI,QAAQ,QAAQ,OAAO,cAAc,kBAAkB,cAAc;;;;;;;;qBAmCzF,MAAM;;;;;;;qBAgBN,SAAU,UAAU,qBAAmB,OAAO,MAAM,QAAQ,mBAAmB,QAAQ;;;;;;;;qBASvF,SAAS,6BAA6B;;;;;;;;qBAetC,UAAW,UAAU,gBAChC,YAAY,OAAO,MAAM,mBACxB,OAAO,MAAM,QAAQ,mBAAmB,QAAQ"}
+{"version":3,"file":"Token.d.ts","names":[],"sources":["../src/Token.ts"],"mappings":";;;;;;;;;iBAyDiB,WAAW;WACjB;WACA,MAAM;WACN,IAAI;;;;;;;;qBASF,QAAS,2BAA2B,MAAM,GAAG,IAAI,MAAI,WAAW;cAE/D;;;;;;;;;iBAUG;GACd;YACS;;;;;;;;;;;;;;;;;;;;;;;;;;;;;qBA8BC,aACX,cACA,YAAY,+BACZ,SAAS,6CACR;;;;;;;;;;YAiBS,0BAER,qBACA,eACE,4BACF,cAAc;;;;;;;;YASN,iCAGR,aACA,qBACA,eACE,4BACF,cAAc;;;;;;;;YASN,SAAS,KAAK,mBACtB,iBACA,UAAU,aACR,eACA,UAAU,oBAAoB,OAC1B,OAAO,iBAAiB,cAAc;;;;;;;;qBAoCnC,KAAK;;;;;;;;;;;;;;;qBAgBL,WAAY,UAAU,qBAAmB,OAAO,MAAM,QAAQ,mBAAmB,QAAQ;;;;;;;;;;;;;;;;;qBAkBzF;SACJ,kBAAkB,SAAS,IAAI,OAAO;GAC5C,SAAS,aAAa,OAAO,0BAA0B;SACjD,GAAG,SAAS,cAAc,KAAK,OAAO,cAAc,kBAAkB,cAAc;;;qBAIhF,cAAe,KAAK,OAAO,sBAAoB;;;;;;;;;;;;;;;;;qBAyC/C,QAAS,UAAU,gBAC9B,KAAK,SAAS,OACb,OAAO,MAAM,QAAQ,mBAAmB,QAAQ;;;;;;;;qBAsBtC,SAAU,UAAU,gBAC/B,KAAK,SAAS,OACb,OAAO,MAAM,QAAQ,mBAAmB,QAAQ;;;;;;;qBAqBtC,OAAQ,UAAU,gBAAgB,kBAAgB,OAAO,MAAM,QAAQ,mBAAmB,QAAQ;;qBAsBlG,gBAAiB,UAAU,OACtC,cACA,GAAG,mBACH,iBACA,cACA,sBACA,OAAM,WACN,mBACC,OAAO,MAAM,QAAQ,mBAAmB,QAAQ;;;;;;;;;;;;;;;;;;;;qBAuCtC,YAAa,UAAU,gBAClC,KAAK,SAAS,IACd,QAAQ,UACP,OAAO,MAAM,QAAQ,mBAAmB,QAAQ;;;;;;;;qBAStC,WAAY,UAAU,gBACjC,KAAK,SAAS,IACd,QAAQ,UACP,OAAO,MAAM,QAAQ,mBAAmB,QAAQ;;;;;;;;;qBAUtC;GACV,iBAAiB,QAAQ,QAAQ;GACjC,SAAS,YAAY,QAAQ,QAAQ,OAAO,0BAA0B;GACtE,GAAG,SAAS,cAAc,IAAI,QAAQ,QAAQ,OAAO,cAAc,kBAAkB,cAAc;;;;;;;;qBAmCzF,MAAM;;;;;;;qBAgBN,SAAU,UAAU,qBAAmB,OAAO,MAAM,QAAQ,mBAAmB,QAAQ;;;;;;;;qBASvF,SAAS,6BAA6B;;;;;;;;qBAetC,UAAW,UAAU,gBAChC,YAAY,OAAO,MAAM,mBACxB,OAAO,MAAM,QAAQ,mBAAmB,QAAQ"}

package/dist/Token.js

@@ -2,7 +2,7 @@ import * as Predicate from "effect/Predicate";
 import { described } from "./Parser.js";
 import { End, NoMatch, advance, codePointPredicate, compileAny, countTokens, describeLiteral, indexOf, matchLiteral, nextIf, scan, splitSurrogate } from "./internal/tokens.js";
 import { bounds } from "./internal/node.js";
-//#region src/Token.ts
+// src/Token.ts
 /**
 * Parsers for individual tokens and slices of tokens (winnow's `token`
 * module, nom's `bytes` module).
@@ -354,7 +354,6 @@ const restLen = /*#__PURE__*/ described((state) => state.end - state.pos, "restL
 * @category tokens
 */
 const satisfy = (predicate) => oneOf(predicate);
-//#endregion
 export { any, anyToken, codePoints, literal, literalImpl, noneOf, oneOf, range, rest, restLen, restOf, satisfy, take, takeTill, takeUntil, takeWhile, takeWhileImpl };
 
 //# sourceMappingURL=Token.js.map

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

@@ -2,7 +2,6 @@ import { State } from "../../Input.js";
 import { Backend } from "./registry.js";
 import { Node, ParserLike } from "../node.js";
 import { FirstSets } from "./first.js";
-//#region src/internal/compiler/closure.d.ts
 export type Step = (state: State<any>) => any;
 /** A parser that the compiler left to its interpreted step. */
 export interface Fallback {
@@ -17,7 +16,11 @@ export interface ClosureCompiler {
   readonly fallbacks: ReadonlyArray<Fallback>;
 }
 export declare const createClosureCompiler: (kind: 0 | 1 | 2, resumable?: boolean) => ClosureCompiler;
+/** A compiled root parser, with the parts of it that run interpreted. */
+export interface CompiledRoot {
+  readonly step: Step;
+  readonly fallbacks: ReadonlyArray<Fallback>;
+}
 /** The closure compiler as a backend. */
 export declare const backend: Backend;
-//#endregion
 //# sourceMappingURL=closure.d.ts.map

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

@@ -1 +1 @@
-{"version":3,"file":"closure.d.ts","names":[],"sources":["../../../src/internal/compiler/closure.ts"],"mappings":";;;;;YA6BY,QAAQ,OAAO;;iBAGV;WACN;WACA,KAAK;WACL;;iBAsgDM;WACN,UAAU,GAAG,YAAY,kBAAkB;WAC3C,OAAO,GAAG,YAAY,MAAM,MAAM;WAClC,QAAQ;WACR,WAAW,cAAc;;qBAGvB,wBAAyB,iBAAiB,wBAAoB;;qBAsB9D,SAAS"}
+{"version":3,"file":"closure.d.ts","names":[],"sources":["../../../src/internal/compiler/closure.ts"],"mappings":";;;;YA8BY,QAAQ,OAAO;;iBAGV;WACN;WACA,KAAK;WACL;;iBAmnDM;WACN,UAAU,GAAG,YAAY,kBAAkB;WAC3C,OAAO,GAAG,YAAY,MAAM,MAAM;WAClC,QAAQ;WACR,WAAW,cAAc;;qBAGvB,wBAAyB,iBAAiB,wBAAoB;;iBAW1D;WACN,MAAM;WACN,WAAW,cAAc;;;qBAWvB,SAAS"}