@prisma-next/psl-parser 0.13.0-dev.4 → 0.13.0-dev.40

package/dist/syntax.mjs.map

@@ -1 +1 @@
-{"version":3,"file":"syntax.mjs","names":["#lastSegment","#penultimateSegment","#stack"],"sources":["../src/syntax/red.ts","../src/syntax/ast-helpers.ts","../src/syntax/ast/identifier.ts","../src/syntax/ast/expressions.ts","../src/syntax/ast/attributes.ts","../src/syntax/ast/type-annotation.ts","../src/syntax/ast/declarations.ts","../src/syntax/green.ts","../src/syntax/green-builder.ts"],"sourcesContent":["import type { Token } from '../tokenizer';\nimport type { GreenElement, GreenNode } from './green';\nimport type { SyntaxKind } from './syntax-kind';\n\n/**\n * A token in the red tree. Unlike the green-layer {@link Token} (kind + text\n * only), a red token also carries its absolute `offset` within the source,\n * computed lazily as the tree is walked.\n */\nexport interface SyntaxToken extends Token {\n  readonly offset: number;\n}\n\nexport type SyntaxElement = SyntaxNode | SyntaxToken;\n\nexport class SyntaxNode {\n  readonly green: GreenNode;\n  readonly offset: number;\n  readonly parent: SyntaxNode | undefined;\n\n  constructor(green: GreenNode, offset: number, parent: SyntaxNode | undefined) {\n    this.green = green;\n    this.offset = offset;\n    this.parent = parent;\n  }\n\n  get kind(): SyntaxKind {\n    return this.green.kind;\n  }\n\n  get textLength(): number {\n    return this.green.textLength;\n  }\n\n  get firstChild(): SyntaxElement | undefined {\n    return childAt(this, 0);\n  }\n\n  get lastChild(): SyntaxElement | undefined {\n    const len = this.green.children.length;\n    if (len === 0) return undefined;\n    return childAt(this, len - 1);\n  }\n\n  get nextSibling(): SyntaxElement | undefined {\n    if (!this.parent) return undefined;\n    const siblings = this.parent.green.children;\n    let offset = this.parent.offset;\n    let found = false;\n    for (const child of siblings) {\n      if (found) {\n        return wrapElement(child, offset, this.parent);\n      }\n      const childLen = elementTextLength(child);\n      if (child.type === 'node' && offset === this.offset && child === this.green) {\n        found = true;\n      }\n      offset += childLen;\n    }\n    return undefined;\n  }\n\n  get prevSibling(): SyntaxElement | undefined {\n    if (!this.parent) return undefined;\n    const siblings = this.parent.green.children;\n    let offset = this.parent.offset;\n    let prev: { green: GreenElement; offset: number } | undefined;\n    for (const child of siblings) {\n      if (child.type === 'node' && offset === this.offset && child === this.green) {\n        if (!prev) return undefined;\n        return wrapElement(prev.green, prev.offset, this.parent);\n      }\n      prev = { green: child, offset };\n      offset += elementTextLength(child);\n    }\n    return undefined;\n  }\n\n  *children(): Iterable<SyntaxElement> {\n    let offset = this.offset;\n    for (const child of this.green.children) {\n      yield wrapElement(child, offset, this);\n      offset += elementTextLength(child);\n    }\n  }\n\n  *childNodes(): Iterable<SyntaxNode> {\n    for (const child of this.children()) {\n      if (child instanceof SyntaxNode) yield child;\n    }\n  }\n\n  *ancestors(): Iterable<SyntaxNode> {\n    let current: SyntaxNode | undefined = this.parent;\n    while (current) {\n      yield current;\n      current = current.parent;\n    }\n  }\n\n  *descendants(): Iterable<SyntaxElement> {\n    const stack: SyntaxElement[] = [this];\n    for (let el = stack.pop(); el !== undefined; el = stack.pop()) {\n      yield el;\n      if (el instanceof SyntaxNode) {\n        const children = Array.from(el.children());\n        for (let i = children.length - 1; i >= 0; i--) {\n          const child = children[i];\n          if (child !== undefined) {\n            stack.push(child);\n          }\n        }\n      }\n    }\n  }\n\n  *tokens(): Iterable<SyntaxToken> {\n    for (const el of this.descendants()) {\n      if (!(el instanceof SyntaxNode)) {\n        yield el;\n      }\n    }\n  }\n}\n\nfunction elementTextLength(el: GreenElement): number {\n  return el.type === 'token' ? el.text.length : el.textLength;\n}\n\nfunction wrapElement(green: GreenElement, offset: number, parent: SyntaxNode): SyntaxElement {\n  if (green.type === 'token') {\n    const token: SyntaxToken = { kind: green.kind, text: green.text, offset };\n    return token;\n  }\n  return new SyntaxNode(green, offset, parent);\n}\n\nfunction childAt(node: SyntaxNode, index: number): SyntaxElement | undefined {\n  const children = node.green.children;\n  const target = children[index];\n  if (target === undefined) return undefined;\n  let offset = node.offset;\n  for (let i = 0; i < index; i++) {\n    const child = children[i];\n    if (child !== undefined) {\n      offset += elementTextLength(child);\n    }\n  }\n  return wrapElement(target, offset, node);\n}\n\nexport function createSyntaxTree(green: GreenNode): SyntaxNode {\n  return new SyntaxNode(green, 0, undefined);\n}\n","import type { Token, TokenKind } from '../tokenizer';\nimport { SyntaxNode } from './red';\n\nexport interface AstNode {\n  readonly syntax: SyntaxNode;\n}\n\nexport function findChildToken(node: SyntaxNode, kind: TokenKind): Token | undefined {\n  for (const child of node.children()) {\n    if (!(child instanceof SyntaxNode) && child.kind === kind) {\n      return child;\n    }\n  }\n  return undefined;\n}\n\nexport function findFirstChild<T>(\n  node: SyntaxNode,\n  cast: (node: SyntaxNode) => T | undefined,\n): T | undefined {\n  for (const child of node.childNodes()) {\n    const result = cast(child);\n    if (result !== undefined) return result;\n  }\n  return undefined;\n}\n\nexport function* filterChildren<T>(\n  node: SyntaxNode,\n  cast: (node: SyntaxNode) => T | undefined,\n): Iterable<T> {\n  for (const child of node.childNodes()) {\n    const result = cast(child);\n    if (result !== undefined) yield result;\n  }\n}\n","import type { Token } from '../../tokenizer';\nimport type { AstNode } from '../ast-helpers';\nimport { findChildToken } from '../ast-helpers';\nimport type { SyntaxNode } from '../red';\n\nexport class IdentifierAst implements AstNode {\n  readonly syntax: SyntaxNode;\n\n  constructor(syntax: SyntaxNode) {\n    this.syntax = syntax;\n  }\n\n  token(): Token | undefined {\n    return findChildToken(this.syntax, 'Ident');\n  }\n\n  static cast(node: SyntaxNode): IdentifierAst | undefined {\n    return node.kind === 'Identifier' ? new IdentifierAst(node) : undefined;\n  }\n}\n","import type { Token } from '../../tokenizer';\nimport type { AstNode } from '../ast-helpers';\nimport { filterChildren, findChildToken, findFirstChild } from '../ast-helpers';\nimport { SyntaxNode } from '../red';\nimport { IdentifierAst } from './identifier';\n\nexport class FunctionCallAst implements AstNode {\n  readonly syntax: SyntaxNode;\n\n  constructor(syntax: SyntaxNode) {\n    this.syntax = syntax;\n  }\n\n  name(): IdentifierAst | undefined {\n    return findFirstChild(this.syntax, IdentifierAst.cast);\n  }\n\n  lparen(): Token | undefined {\n    return findChildToken(this.syntax, 'LParen');\n  }\n\n  rparen(): Token | undefined {\n    return findChildToken(this.syntax, 'RParen');\n  }\n\n  *args(): Iterable<AttributeArgAst> {\n    yield* filterChildren(this.syntax, AttributeArgAst.cast);\n  }\n\n  static cast(node: SyntaxNode): FunctionCallAst | undefined {\n    return node.kind === 'FunctionCall' ? new FunctionCallAst(node) : undefined;\n  }\n}\n\nexport class ArrayLiteralAst implements AstNode {\n  readonly syntax: SyntaxNode;\n\n  constructor(syntax: SyntaxNode) {\n    this.syntax = syntax;\n  }\n\n  lbracket(): Token | undefined {\n    return findChildToken(this.syntax, 'LBracket');\n  }\n\n  rbracket(): Token | undefined {\n    return findChildToken(this.syntax, 'RBracket');\n  }\n\n  *elements(): Iterable<ExpressionAst> {\n    yield* filterChildren(this.syntax, castExpression);\n  }\n\n  static cast(node: SyntaxNode): ArrayLiteralAst | undefined {\n    return node.kind === 'ArrayLiteral' ? new ArrayLiteralAst(node) : undefined;\n  }\n}\n\nexport class StringLiteralExprAst implements AstNode {\n  readonly syntax: SyntaxNode;\n\n  constructor(syntax: SyntaxNode) {\n    this.syntax = syntax;\n  }\n\n  token(): Token | undefined {\n    return findChildToken(this.syntax, 'StringLiteral');\n  }\n\n  value(): string | undefined {\n    const tok = this.token();\n    if (!tok) return undefined;\n    const raw = tok.text.slice(1, -1);\n    return raw.replace(/\\\\(.)/g, (_match, char: string) => {\n      switch (char) {\n        case 'n':\n          return '\\n';\n        case 'r':\n          return '\\r';\n        case 't':\n          return '\\t';\n        case '\"':\n          return '\"';\n        case '\\\\':\n          return '\\\\';\n        default:\n          return `\\\\${char}`;\n      }\n    });\n  }\n\n  static cast(node: SyntaxNode): StringLiteralExprAst | undefined {\n    return node.kind === 'StringLiteralExpr' ? new StringLiteralExprAst(node) : undefined;\n  }\n}\n\nexport class NumberLiteralExprAst implements AstNode {\n  readonly syntax: SyntaxNode;\n\n  constructor(syntax: SyntaxNode) {\n    this.syntax = syntax;\n  }\n\n  token(): Token | undefined {\n    return findChildToken(this.syntax, 'NumberLiteral');\n  }\n\n  value(): number | undefined {\n    const tok = this.token();\n    if (!tok) return undefined;\n    return Number(tok.text);\n  }\n\n  static cast(node: SyntaxNode): NumberLiteralExprAst | undefined {\n    return node.kind === 'NumberLiteralExpr' ? new NumberLiteralExprAst(node) : undefined;\n  }\n}\n\nexport class BooleanLiteralExprAst implements AstNode {\n  readonly syntax: SyntaxNode;\n\n  constructor(syntax: SyntaxNode) {\n    this.syntax = syntax;\n  }\n\n  token(): Token | undefined {\n    return findChildToken(this.syntax, 'Ident');\n  }\n\n  value(): boolean | undefined {\n    const tok = this.token();\n    if (!tok) return undefined;\n    if (tok.text === 'true') return true;\n    if (tok.text === 'false') return false;\n    return undefined;\n  }\n\n  static cast(node: SyntaxNode): BooleanLiteralExprAst | undefined {\n    return node.kind === 'BooleanLiteralExpr' ? new BooleanLiteralExprAst(node) : undefined;\n  }\n}\n\nexport type ExpressionAst =\n  | FunctionCallAst\n  | ArrayLiteralAst\n  | StringLiteralExprAst\n  | NumberLiteralExprAst\n  | BooleanLiteralExprAst\n  | IdentifierAst;\n\nexport function castExpression(node: SyntaxNode): ExpressionAst | undefined {\n  return (\n    FunctionCallAst.cast(node) ??\n    ArrayLiteralAst.cast(node) ??\n    StringLiteralExprAst.cast(node) ??\n    NumberLiteralExprAst.cast(node) ??\n    BooleanLiteralExprAst.cast(node) ??\n    IdentifierAst.cast(node)\n  );\n}\n\nexport class AttributeArgAst implements AstNode {\n  readonly syntax: SyntaxNode;\n\n  constructor(syntax: SyntaxNode) {\n    this.syntax = syntax;\n  }\n\n  name(): IdentifierAst | undefined {\n    if (!this.colon()) return undefined;\n    return findFirstChild(this.syntax, IdentifierAst.cast);\n  }\n\n  colon(): Token | undefined {\n    return findChildToken(this.syntax, 'Colon');\n  }\n\n  value(): ExpressionAst | undefined {\n    if (this.colon()) {\n      let pastColon = false;\n      for (const child of this.syntax.children()) {\n        if (!(child instanceof SyntaxNode)) {\n          if (child.kind === 'Colon') pastColon = true;\n          continue;\n        }\n        if (pastColon) {\n          const expr = castExpression(child);\n          if (expr) return expr;\n        }\n      }\n      return undefined;\n    }\n    return findFirstChild(this.syntax, castExpression);\n  }\n\n  static cast(node: SyntaxNode): AttributeArgAst | undefined {\n    return node.kind === 'AttributeArg' ? new AttributeArgAst(node) : undefined;\n  }\n}\n","import type { Token } from '../../tokenizer';\nimport type { AstNode } from '../ast-helpers';\nimport { filterChildren, findChildToken, findFirstChild } from '../ast-helpers';\nimport type { SyntaxNode } from '../red';\nimport { AttributeArgAst } from './expressions';\nimport { IdentifierAst } from './identifier';\n\nexport class AttributeArgListAst implements AstNode {\n  readonly syntax: SyntaxNode;\n\n  constructor(syntax: SyntaxNode) {\n    this.syntax = syntax;\n  }\n\n  lparen(): Token | undefined {\n    return findChildToken(this.syntax, 'LParen');\n  }\n\n  rparen(): Token | undefined {\n    return findChildToken(this.syntax, 'RParen');\n  }\n\n  *args(): Iterable<AttributeArgAst> {\n    yield* filterChildren(this.syntax, AttributeArgAst.cast);\n  }\n\n  static cast(node: SyntaxNode): AttributeArgListAst | undefined {\n    return node.kind === 'AttributeArgList' ? new AttributeArgListAst(node) : undefined;\n  }\n}\n\nexport class FieldAttributeAst implements AstNode {\n  readonly syntax: SyntaxNode;\n\n  constructor(syntax: SyntaxNode) {\n    this.syntax = syntax;\n  }\n\n  at(): Token | undefined {\n    return findChildToken(this.syntax, 'At');\n  }\n\n  name(): IdentifierAst | undefined {\n    if (this.dot()) {\n      let count = 0;\n      for (const child of this.syntax.childNodes()) {\n        if (child.kind === 'Identifier') {\n          count++;\n          if (count === 2) return new IdentifierAst(child);\n        }\n      }\n      return undefined;\n    }\n    return findFirstChild(this.syntax, IdentifierAst.cast);\n  }\n\n  dot(): Token | undefined {\n    return findChildToken(this.syntax, 'Dot');\n  }\n\n  namespaceName(): IdentifierAst | undefined {\n    if (!this.dot()) return undefined;\n    return findFirstChild(this.syntax, IdentifierAst.cast);\n  }\n\n  argList(): AttributeArgListAst | undefined {\n    return findFirstChild(this.syntax, AttributeArgListAst.cast);\n  }\n\n  static cast(node: SyntaxNode): FieldAttributeAst | undefined {\n    return node.kind === 'FieldAttribute' ? new FieldAttributeAst(node) : undefined;\n  }\n}\n\nexport class ModelAttributeAst implements AstNode {\n  readonly syntax: SyntaxNode;\n\n  constructor(syntax: SyntaxNode) {\n    this.syntax = syntax;\n  }\n\n  doubleAt(): Token | undefined {\n    return findChildToken(this.syntax, 'DoubleAt');\n  }\n\n  name(): IdentifierAst | undefined {\n    return findFirstChild(this.syntax, IdentifierAst.cast);\n  }\n\n  argList(): AttributeArgListAst | undefined {\n    return findFirstChild(this.syntax, AttributeArgListAst.cast);\n  }\n\n  static cast(node: SyntaxNode): ModelAttributeAst | undefined {\n    return node.kind === 'ModelAttribute' ? new ModelAttributeAst(node) : undefined;\n  }\n}\n","import type { Token } from '../../tokenizer';\nimport type { AstNode } from '../ast-helpers';\nimport { filterChildren, findChildToken, findFirstChild } from '../ast-helpers';\nimport type { SyntaxNode } from '../red';\nimport { FunctionCallAst } from './expressions';\nimport { IdentifierAst } from './identifier';\n\nexport class TypeAnnotationAst implements AstNode {\n  readonly syntax: SyntaxNode;\n\n  constructor(syntax: SyntaxNode) {\n    this.syntax = syntax;\n  }\n\n  #lastSegment(): IdentifierAst | undefined {\n    let last: IdentifierAst | undefined;\n    for (const segment of filterChildren(this.syntax, IdentifierAst.cast)) {\n      last = segment;\n    }\n    return last;\n  }\n\n  #penultimateSegment(): IdentifierAst | undefined {\n    let last: IdentifierAst | undefined;\n    let penultimate: IdentifierAst | undefined;\n    for (const segment of filterChildren(this.syntax, IdentifierAst.cast)) {\n      penultimate = last;\n      last = segment;\n    }\n    return penultimate;\n  }\n\n  name(): IdentifierAst | undefined {\n    return this.#lastSegment();\n  }\n\n  colon(): Token | undefined {\n    return findChildToken(this.syntax, 'Colon');\n  }\n\n  dot(): Token | undefined {\n    return findChildToken(this.syntax, 'Dot');\n  }\n\n  spaceName(): IdentifierAst | undefined {\n    if (!this.colon()) return undefined;\n    return findFirstChild(this.syntax, IdentifierAst.cast);\n  }\n\n  namespaceName(): IdentifierAst | undefined {\n    if (!this.dot()) return undefined;\n    return this.#penultimateSegment();\n  }\n\n  constructorCall(): FunctionCallAst | undefined {\n    return findFirstChild(this.syntax, FunctionCallAst.cast);\n  }\n\n  lbracket(): Token | undefined {\n    return findChildToken(this.syntax, 'LBracket');\n  }\n\n  rbracket(): Token | undefined {\n    return findChildToken(this.syntax, 'RBracket');\n  }\n\n  questionMark(): Token | undefined {\n    return findChildToken(this.syntax, 'Question');\n  }\n\n  isList(): boolean {\n    return this.lbracket() !== undefined;\n  }\n\n  isOptional(): boolean {\n    return this.questionMark() !== undefined;\n  }\n\n  static cast(node: SyntaxNode): TypeAnnotationAst | undefined {\n    return node.kind === 'TypeAnnotation' ? new TypeAnnotationAst(node) : undefined;\n  }\n}\n","import type { Token } from '../../tokenizer';\nimport type { AstNode } from '../ast-helpers';\nimport { filterChildren, findChildToken, findFirstChild } from '../ast-helpers';\nimport { SyntaxNode } from '../red';\nimport { FieldAttributeAst, ModelAttributeAst } from './attributes';\nimport type { ExpressionAst } from './expressions';\nimport { castExpression } from './expressions';\nimport { IdentifierAst } from './identifier';\nimport { TypeAnnotationAst } from './type-annotation';\n\n/**\n * What may appear inside a `namespace` block: models, enums, composite types,\n * and extension (block) declarations. Mirrors what `parsePslDocument` accepts\n * in a namespace body. `types {}` blocks and nested `namespace` blocks are\n * document-only, so they are not namespace members.\n */\nexport type NamespaceMemberAst =\n  | ModelDeclarationAst\n  | EnumDeclarationAst\n  | CompositeTypeDeclarationAst\n  | BlockDeclarationAst;\n\nfunction castNamespaceMember(node: SyntaxNode): NamespaceMemberAst | undefined {\n  return (\n    ModelDeclarationAst.cast(node) ??\n    EnumDeclarationAst.cast(node) ??\n    CompositeTypeDeclarationAst.cast(node) ??\n    BlockDeclarationAst.cast(node)\n  );\n}\n\nexport class DocumentAst implements AstNode {\n  readonly syntax: SyntaxNode;\n\n  constructor(syntax: SyntaxNode) {\n    this.syntax = syntax;\n  }\n\n  *declarations(): Iterable<NamespaceMemberAst | TypesBlockAst | NamespaceDeclarationAst> {\n    yield* filterChildren(\n      this.syntax,\n      (node) =>\n        castNamespaceMember(node) ?? TypesBlockAst.cast(node) ?? NamespaceDeclarationAst.cast(node),\n    );\n  }\n\n  static cast(node: SyntaxNode): DocumentAst | undefined {\n    return node.kind === 'Document' ? new DocumentAst(node) : undefined;\n  }\n}\n\nexport class ModelDeclarationAst implements AstNode {\n  readonly syntax: SyntaxNode;\n\n  constructor(syntax: SyntaxNode) {\n    this.syntax = syntax;\n  }\n\n  keyword(): Token | undefined {\n    return findChildToken(this.syntax, 'Ident');\n  }\n\n  name(): IdentifierAst | undefined {\n    return findFirstChild(this.syntax, IdentifierAst.cast);\n  }\n\n  lbrace(): Token | undefined {\n    return findChildToken(this.syntax, 'LBrace');\n  }\n\n  rbrace(): Token | undefined {\n    return findChildToken(this.syntax, 'RBrace');\n  }\n\n  *fields(): Iterable<FieldDeclarationAst> {\n    yield* filterChildren(this.syntax, FieldDeclarationAst.cast);\n  }\n\n  *attributes(): Iterable<ModelAttributeAst> {\n    yield* filterChildren(this.syntax, ModelAttributeAst.cast);\n  }\n\n  static cast(node: SyntaxNode): ModelDeclarationAst | undefined {\n    return node.kind === 'ModelDeclaration' ? new ModelDeclarationAst(node) : undefined;\n  }\n}\n\nexport class EnumDeclarationAst implements AstNode {\n  readonly syntax: SyntaxNode;\n\n  constructor(syntax: SyntaxNode) {\n    this.syntax = syntax;\n  }\n\n  keyword(): Token | undefined {\n    return findChildToken(this.syntax, 'Ident');\n  }\n\n  name(): IdentifierAst | undefined {\n    return findFirstChild(this.syntax, IdentifierAst.cast);\n  }\n\n  lbrace(): Token | undefined {\n    return findChildToken(this.syntax, 'LBrace');\n  }\n\n  rbrace(): Token | undefined {\n    return findChildToken(this.syntax, 'RBrace');\n  }\n\n  *values(): Iterable<EnumValueDeclarationAst> {\n    yield* filterChildren(this.syntax, EnumValueDeclarationAst.cast);\n  }\n\n  *attributes(): Iterable<ModelAttributeAst> {\n    yield* filterChildren(this.syntax, ModelAttributeAst.cast);\n  }\n\n  static cast(node: SyntaxNode): EnumDeclarationAst | undefined {\n    return node.kind === 'EnumDeclaration' ? new EnumDeclarationAst(node) : undefined;\n  }\n}\n\nexport class CompositeTypeDeclarationAst implements AstNode {\n  readonly syntax: SyntaxNode;\n\n  constructor(syntax: SyntaxNode) {\n    this.syntax = syntax;\n  }\n\n  keyword(): Token | undefined {\n    return findChildToken(this.syntax, 'Ident');\n  }\n\n  name(): IdentifierAst | undefined {\n    return findFirstChild(this.syntax, IdentifierAst.cast);\n  }\n\n  lbrace(): Token | undefined {\n    return findChildToken(this.syntax, 'LBrace');\n  }\n\n  rbrace(): Token | undefined {\n    return findChildToken(this.syntax, 'RBrace');\n  }\n\n  *fields(): Iterable<FieldDeclarationAst> {\n    yield* filterChildren(this.syntax, FieldDeclarationAst.cast);\n  }\n\n  *attributes(): Iterable<ModelAttributeAst> {\n    yield* filterChildren(this.syntax, ModelAttributeAst.cast);\n  }\n\n  static cast(node: SyntaxNode): CompositeTypeDeclarationAst | undefined {\n    return node.kind === 'CompositeTypeDeclaration'\n      ? new CompositeTypeDeclarationAst(node)\n      : undefined;\n  }\n}\n\nexport class NamespaceDeclarationAst implements AstNode {\n  readonly syntax: SyntaxNode;\n\n  constructor(syntax: SyntaxNode) {\n    this.syntax = syntax;\n  }\n\n  keyword(): Token | undefined {\n    return findChildToken(this.syntax, 'Ident');\n  }\n\n  name(): IdentifierAst | undefined {\n    return findFirstChild(this.syntax, IdentifierAst.cast);\n  }\n\n  lbrace(): Token | undefined {\n    return findChildToken(this.syntax, 'LBrace');\n  }\n\n  rbrace(): Token | undefined {\n    return findChildToken(this.syntax, 'RBrace');\n  }\n\n  *declarations(): Iterable<NamespaceMemberAst> {\n    yield* filterChildren(this.syntax, castNamespaceMember);\n  }\n\n  static cast(node: SyntaxNode): NamespaceDeclarationAst | undefined {\n    return node.kind === 'Namespace' ? new NamespaceDeclarationAst(node) : undefined;\n  }\n}\n\nexport class TypesBlockAst implements AstNode {\n  readonly syntax: SyntaxNode;\n\n  constructor(syntax: SyntaxNode) {\n    this.syntax = syntax;\n  }\n\n  keyword(): Token | undefined {\n    return findChildToken(this.syntax, 'Ident');\n  }\n\n  lbrace(): Token | undefined {\n    return findChildToken(this.syntax, 'LBrace');\n  }\n\n  rbrace(): Token | undefined {\n    return findChildToken(this.syntax, 'RBrace');\n  }\n\n  *declarations(): Iterable<NamedTypeDeclarationAst> {\n    yield* filterChildren(this.syntax, NamedTypeDeclarationAst.cast);\n  }\n\n  static cast(node: SyntaxNode): TypesBlockAst | undefined {\n    return node.kind === 'TypesBlock' ? new TypesBlockAst(node) : undefined;\n  }\n}\n\nexport class BlockDeclarationAst implements AstNode {\n  readonly syntax: SyntaxNode;\n\n  constructor(syntax: SyntaxNode) {\n    this.syntax = syntax;\n  }\n\n  keyword(): Token | undefined {\n    return findChildToken(this.syntax, 'Ident');\n  }\n\n  name(): IdentifierAst | undefined {\n    return findFirstChild(this.syntax, IdentifierAst.cast);\n  }\n\n  lbrace(): Token | undefined {\n    return findChildToken(this.syntax, 'LBrace');\n  }\n\n  rbrace(): Token | undefined {\n    return findChildToken(this.syntax, 'RBrace');\n  }\n\n  *entries(): Iterable<KeyValuePairAst> {\n    yield* filterChildren(this.syntax, KeyValuePairAst.cast);\n  }\n\n  static cast(node: SyntaxNode): BlockDeclarationAst | undefined {\n    return node.kind === 'BlockDeclaration' ? new BlockDeclarationAst(node) : undefined;\n  }\n}\n\nexport class KeyValuePairAst implements AstNode {\n  readonly syntax: SyntaxNode;\n\n  constructor(syntax: SyntaxNode) {\n    this.syntax = syntax;\n  }\n\n  key(): IdentifierAst | undefined {\n    return findFirstChild(this.syntax, IdentifierAst.cast);\n  }\n\n  equals(): Token | undefined {\n    return findChildToken(this.syntax, 'Equals');\n  }\n\n  value(): ExpressionAst | undefined {\n    let pastEquals = false;\n    for (const child of this.syntax.children()) {\n      if (!(child instanceof SyntaxNode)) {\n        if (child.kind === 'Equals') pastEquals = true;\n        continue;\n      }\n      if (pastEquals) {\n        const expr = castExpression(child);\n        if (expr) return expr;\n      }\n    }\n    return undefined;\n  }\n\n  static cast(node: SyntaxNode): KeyValuePairAst | undefined {\n    return node.kind === 'KeyValuePair' ? new KeyValuePairAst(node) : undefined;\n  }\n}\n\nexport class FieldDeclarationAst implements AstNode {\n  readonly syntax: SyntaxNode;\n\n  constructor(syntax: SyntaxNode) {\n    this.syntax = syntax;\n  }\n\n  name(): IdentifierAst | undefined {\n    return findFirstChild(this.syntax, IdentifierAst.cast);\n  }\n\n  typeAnnotation(): TypeAnnotationAst | undefined {\n    return findFirstChild(this.syntax, TypeAnnotationAst.cast);\n  }\n\n  *attributes(): Iterable<FieldAttributeAst> {\n    yield* filterChildren(this.syntax, FieldAttributeAst.cast);\n  }\n\n  static cast(node: SyntaxNode): FieldDeclarationAst | undefined {\n    return node.kind === 'FieldDeclaration' ? new FieldDeclarationAst(node) : undefined;\n  }\n}\n\nexport class EnumValueDeclarationAst implements AstNode {\n  readonly syntax: SyntaxNode;\n\n  constructor(syntax: SyntaxNode) {\n    this.syntax = syntax;\n  }\n\n  name(): IdentifierAst | undefined {\n    return findFirstChild(this.syntax, IdentifierAst.cast);\n  }\n\n  *attributes(): Iterable<FieldAttributeAst> {\n    yield* filterChildren(this.syntax, FieldAttributeAst.cast);\n  }\n\n  static cast(node: SyntaxNode): EnumValueDeclarationAst | undefined {\n    return node.kind === 'EnumValueDeclaration' ? new EnumValueDeclarationAst(node) : undefined;\n  }\n}\n\nexport class NamedTypeDeclarationAst implements AstNode {\n  readonly syntax: SyntaxNode;\n\n  constructor(syntax: SyntaxNode) {\n    this.syntax = syntax;\n  }\n\n  name(): IdentifierAst | undefined {\n    return findFirstChild(this.syntax, IdentifierAst.cast);\n  }\n\n  equals(): Token | undefined {\n    return findChildToken(this.syntax, 'Equals');\n  }\n\n  typeAnnotation(): TypeAnnotationAst | undefined {\n    return findFirstChild(this.syntax, TypeAnnotationAst.cast);\n  }\n\n  *attributes(): Iterable<FieldAttributeAst> {\n    yield* filterChildren(this.syntax, FieldAttributeAst.cast);\n  }\n\n  static cast(node: SyntaxNode): NamedTypeDeclarationAst | undefined {\n    return node.kind === 'NamedTypeDeclaration' ? new NamedTypeDeclarationAst(node) : undefined;\n  }\n}\n","import type { TokenKind } from '../tokenizer';\nimport type { SyntaxKind } from './syntax-kind';\n\nexport interface GreenToken {\n  readonly type: 'token';\n  readonly kind: TokenKind;\n  readonly text: string;\n}\n\nexport interface GreenNode {\n  readonly type: 'node';\n  readonly kind: SyntaxKind;\n  readonly children: ReadonlyArray<GreenElement>;\n  readonly textLength: number;\n}\n\nexport type GreenElement = GreenNode | GreenToken;\n\nexport function greenToken(kind: TokenKind, text: string): GreenToken {\n  return { type: 'token', kind, text };\n}\n\nexport function greenNode(kind: SyntaxKind, children: ReadonlyArray<GreenElement>): GreenNode {\n  let textLength = 0;\n  for (const child of children) {\n    textLength += child.type === 'token' ? child.text.length : child.textLength;\n  }\n  return { type: 'node', kind, children, textLength };\n}\n","import type { TokenKind } from '../tokenizer';\nimport type { GreenElement, GreenNode } from './green';\nimport { greenNode, greenToken } from './green';\nimport type { SyntaxKind } from './syntax-kind';\n\nexport class GreenNodeBuilder {\n  readonly #stack: Array<{ kind: SyntaxKind; children: GreenElement[] }> = [];\n\n  startNode(kind: SyntaxKind): void {\n    this.#stack.push({ kind, children: [] });\n  }\n\n  token(kind: TokenKind, text: string): void {\n    const current = this.#stack.at(-1);\n    if (!current) {\n      throw new Error('GreenNodeBuilder: token() called with no open node');\n    }\n    current.children.push(greenToken(kind, text));\n  }\n\n  finishNode(): GreenNode {\n    const completed = this.#stack.pop();\n    if (!completed) {\n      throw new Error('GreenNodeBuilder: finishNode() called with no open node');\n    }\n    const node = greenNode(completed.kind, completed.children);\n    const parent = this.#stack.at(-1);\n    if (parent) {\n      parent.children.push(node);\n    }\n    return node;\n  }\n}\n"],"mappings":";AAeA,IAAa,aAAb,MAAa,WAAW;CACtB;CACA;CACA;CAEA,YAAY,OAAkB,QAAgB,QAAgC;EAC5E,KAAK,QAAQ;EACb,KAAK,SAAS;EACd,KAAK,SAAS;CAChB;CAEA,IAAI,OAAmB;EACrB,OAAO,KAAK,MAAM;CACpB;CAEA,IAAI,aAAqB;EACvB,OAAO,KAAK,MAAM;CACpB;CAEA,IAAI,aAAwC;EAC1C,OAAO,QAAQ,MAAM,CAAC;CACxB;CAEA,IAAI,YAAuC;EACzC,MAAM,MAAM,KAAK,MAAM,SAAS;EAChC,IAAI,QAAQ,GAAG,OAAO,KAAA;EACtB,OAAO,QAAQ,MAAM,MAAM,CAAC;CAC9B;CAEA,IAAI,cAAyC;EAC3C,IAAI,CAAC,KAAK,QAAQ,OAAO,KAAA;EACzB,MAAM,WAAW,KAAK,OAAO,MAAM;EACnC,IAAI,SAAS,KAAK,OAAO;EACzB,IAAI,QAAQ;EACZ,KAAK,MAAM,SAAS,UAAU;GAC5B,IAAI,OACF,OAAO,YAAY,OAAO,QAAQ,KAAK,MAAM;GAE/C,MAAM,WAAW,kBAAkB,KAAK;GACxC,IAAI,MAAM,SAAS,UAAU,WAAW,KAAK,UAAU,UAAU,KAAK,OACpE,QAAQ;GAEV,UAAU;EACZ;CAEF;CAEA,IAAI,cAAyC;EAC3C,IAAI,CAAC,KAAK,QAAQ,OAAO,KAAA;EACzB,MAAM,WAAW,KAAK,OAAO,MAAM;EACnC,IAAI,SAAS,KAAK,OAAO;EACzB,IAAI;EACJ,KAAK,MAAM,SAAS,UAAU;GAC5B,IAAI,MAAM,SAAS,UAAU,WAAW,KAAK,UAAU,UAAU,KAAK,OAAO;IAC3E,IAAI,CAAC,MAAM,OAAO,KAAA;IAClB,OAAO,YAAY,KAAK,OAAO,KAAK,QAAQ,KAAK,MAAM;GACzD;GACA,OAAO;IAAE,OAAO;IAAO;GAAO;GAC9B,UAAU,kBAAkB,KAAK;EACnC;CAEF;CAEA,CAAC,WAAoC;EACnC,IAAI,SAAS,KAAK;EAClB,KAAK,MAAM,SAAS,KAAK,MAAM,UAAU;GACvC,MAAM,YAAY,OAAO,QAAQ,IAAI;GACrC,UAAU,kBAAkB,KAAK;EACnC;CACF;CAEA,CAAC,aAAmC;EAClC,KAAK,MAAM,SAAS,KAAK,SAAS,GAChC,IAAI,iBAAiB,YAAY,MAAM;CAE3C;CAEA,CAAC,YAAkC;EACjC,IAAI,UAAkC,KAAK;EAC3C,OAAO,SAAS;GACd,MAAM;GACN,UAAU,QAAQ;EACpB;CACF;CAEA,CAAC,cAAuC;EACtC,MAAM,QAAyB,CAAC,IAAI;EACpC,KAAK,IAAI,KAAK,MAAM,IAAI,GAAG,OAAO,KAAA,GAAW,KAAK,MAAM,IAAI,GAAG;GAC7D,MAAM;GACN,IAAI,cAAc,YAAY;IAC5B,MAAM,WAAW,MAAM,KAAK,GAAG,SAAS,CAAC;IACzC,KAAK,IAAI,IAAI,SAAS,SAAS,GAAG,KAAK,GAAG,KAAK;KAC7C,MAAM,QAAQ,SAAS;KACvB,IAAI,UAAU,KAAA,GACZ,MAAM,KAAK,KAAK;IAEpB;GACF;EACF;CACF;CAEA,CAAC,SAAgC;EAC/B,KAAK,MAAM,MAAM,KAAK,YAAY,GAChC,IAAI,EAAE,cAAc,aAClB,MAAM;CAGZ;AACF;AAEA,SAAS,kBAAkB,IAA0B;CACnD,OAAO,GAAG,SAAS,UAAU,GAAG,KAAK,SAAS,GAAG;AACnD;AAEA,SAAS,YAAY,OAAqB,QAAgB,QAAmC;CAC3F,IAAI,MAAM,SAAS,SAEjB,OAAO;EADsB,MAAM,MAAM;EAAM,MAAM,MAAM;EAAM;CACtD;CAEb,OAAO,IAAI,WAAW,OAAO,QAAQ,MAAM;AAC7C;AAEA,SAAS,QAAQ,MAAkB,OAA0C;CAC3E,MAAM,WAAW,KAAK,MAAM;CAC5B,MAAM,SAAS,SAAS;CACxB,IAAI,WAAW,KAAA,GAAW,OAAO,KAAA;CACjC,IAAI,SAAS,KAAK;CAClB,KAAK,IAAI,IAAI,GAAG,IAAI,OAAO,KAAK;EAC9B,MAAM,QAAQ,SAAS;EACvB,IAAI,UAAU,KAAA,GACZ,UAAU,kBAAkB,KAAK;CAErC;CACA,OAAO,YAAY,QAAQ,QAAQ,IAAI;AACzC;AAEA,SAAgB,iBAAiB,OAA8B;CAC7D,OAAO,IAAI,WAAW,OAAO,GAAG,KAAA,CAAS;AAC3C;;;AClJA,SAAgB,eAAe,MAAkB,MAAoC;CACnF,KAAK,MAAM,SAAS,KAAK,SAAS,GAChC,IAAI,EAAE,iBAAiB,eAAe,MAAM,SAAS,MACnD,OAAO;AAIb;AAEA,SAAgB,eACd,MACA,MACe;CACf,KAAK,MAAM,SAAS,KAAK,WAAW,GAAG;EACrC,MAAM,SAAS,KAAK,KAAK;EACzB,IAAI,WAAW,KAAA,GAAW,OAAO;CACnC;AAEF;AAEA,UAAiB,eACf,MACA,MACa;CACb,KAAK,MAAM,SAAS,KAAK,WAAW,GAAG;EACrC,MAAM,SAAS,KAAK,KAAK;EACzB,IAAI,WAAW,KAAA,GAAW,MAAM;CAClC;AACF;;;AC9BA,IAAa,gBAAb,MAAa,cAAiC;CAC5C;CAEA,YAAY,QAAoB;EAC9B,KAAK,SAAS;CAChB;CAEA,QAA2B;EACzB,OAAO,eAAe,KAAK,QAAQ,OAAO;CAC5C;CAEA,OAAO,KAAK,MAA6C;EACvD,OAAO,KAAK,SAAS,eAAe,IAAI,cAAc,IAAI,IAAI,KAAA;CAChE;AACF;;;ACbA,IAAa,kBAAb,MAAa,gBAAmC;CAC9C;CAEA,YAAY,QAAoB;EAC9B,KAAK,SAAS;CAChB;CAEA,OAAkC;EAChC,OAAO,eAAe,KAAK,QAAQ,cAAc,IAAI;CACvD;CAEA,SAA4B;EAC1B,OAAO,eAAe,KAAK,QAAQ,QAAQ;CAC7C;CAEA,SAA4B;EAC1B,OAAO,eAAe,KAAK,QAAQ,QAAQ;CAC7C;CAEA,CAAC,OAAkC;EACjC,OAAO,eAAe,KAAK,QAAQ,gBAAgB,IAAI;CACzD;CAEA,OAAO,KAAK,MAA+C;EACzD,OAAO,KAAK,SAAS,iBAAiB,IAAI,gBAAgB,IAAI,IAAI,KAAA;CACpE;AACF;AAEA,IAAa,kBAAb,MAAa,gBAAmC;CAC9C;CAEA,YAAY,QAAoB;EAC9B,KAAK,SAAS;CAChB;CAEA,WAA8B;EAC5B,OAAO,eAAe,KAAK,QAAQ,UAAU;CAC/C;CAEA,WAA8B;EAC5B,OAAO,eAAe,KAAK,QAAQ,UAAU;CAC/C;CAEA,CAAC,WAAoC;EACnC,OAAO,eAAe,KAAK,QAAQ,cAAc;CACnD;CAEA,OAAO,KAAK,MAA+C;EACzD,OAAO,KAAK,SAAS,iBAAiB,IAAI,gBAAgB,IAAI,IAAI,KAAA;CACpE;AACF;AAEA,IAAa,uBAAb,MAAa,qBAAwC;CACnD;CAEA,YAAY,QAAoB;EAC9B,KAAK,SAAS;CAChB;CAEA,QAA2B;EACzB,OAAO,eAAe,KAAK,QAAQ,eAAe;CACpD;CAEA,QAA4B;EAC1B,MAAM,MAAM,KAAK,MAAM;EACvB,IAAI,CAAC,KAAK,OAAO,KAAA;EAEjB,OADY,IAAI,KAAK,MAAM,GAAG,EACrB,CAAC,CAAC,QAAQ,WAAW,QAAQ,SAAiB;GACrD,QAAQ,MAAR;IACE,KAAK,KACH,OAAO;IACT,KAAK,KACH,OAAO;IACT,KAAK,KACH,OAAO;IACT,KAAK,MACH,OAAO;IACT,KAAK,MACH,OAAO;IACT,SACE,OAAO,KAAK;GAChB;EACF,CAAC;CACH;CAEA,OAAO,KAAK,MAAoD;EAC9D,OAAO,KAAK,SAAS,sBAAsB,IAAI,qBAAqB,IAAI,IAAI,KAAA;CAC9E;AACF;AAEA,IAAa,uBAAb,MAAa,qBAAwC;CACnD;CAEA,YAAY,QAAoB;EAC9B,KAAK,SAAS;CAChB;CAEA,QAA2B;EACzB,OAAO,eAAe,KAAK,QAAQ,eAAe;CACpD;CAEA,QAA4B;EAC1B,MAAM,MAAM,KAAK,MAAM;EACvB,IAAI,CAAC,KAAK,OAAO,KAAA;EACjB,OAAO,OAAO,IAAI,IAAI;CACxB;CAEA,OAAO,KAAK,MAAoD;EAC9D,OAAO,KAAK,SAAS,sBAAsB,IAAI,qBAAqB,IAAI,IAAI,KAAA;CAC9E;AACF;AAEA,IAAa,wBAAb,MAAa,sBAAyC;CACpD;CAEA,YAAY,QAAoB;EAC9B,KAAK,SAAS;CAChB;CAEA,QAA2B;EACzB,OAAO,eAAe,KAAK,QAAQ,OAAO;CAC5C;CAEA,QAA6B;EAC3B,MAAM,MAAM,KAAK,MAAM;EACvB,IAAI,CAAC,KAAK,OAAO,KAAA;EACjB,IAAI,IAAI,SAAS,QAAQ,OAAO;EAChC,IAAI,IAAI,SAAS,SAAS,OAAO;CAEnC;CAEA,OAAO,KAAK,MAAqD;EAC/D,OAAO,KAAK,SAAS,uBAAuB,IAAI,sBAAsB,IAAI,IAAI,KAAA;CAChF;AACF;AAUA,SAAgB,eAAe,MAA6C;CAC1E,OACE,gBAAgB,KAAK,IAAI,KACzB,gBAAgB,KAAK,IAAI,KACzB,qBAAqB,KAAK,IAAI,KAC9B,qBAAqB,KAAK,IAAI,KAC9B,sBAAsB,KAAK,IAAI,KAC/B,cAAc,KAAK,IAAI;AAE3B;AAEA,IAAa,kBAAb,MAAa,gBAAmC;CAC9C;CAEA,YAAY,QAAoB;EAC9B,KAAK,SAAS;CAChB;CAEA,OAAkC;EAChC,IAAI,CAAC,KAAK,MAAM,GAAG,OAAO,KAAA;EAC1B,OAAO,eAAe,KAAK,QAAQ,cAAc,IAAI;CACvD;CAEA,QAA2B;EACzB,OAAO,eAAe,KAAK,QAAQ,OAAO;CAC5C;CAEA,QAAmC;EACjC,IAAI,KAAK,MAAM,GAAG;GAChB,IAAI,YAAY;GAChB,KAAK,MAAM,SAAS,KAAK,OAAO,SAAS,GAAG;IAC1C,IAAI,EAAE,iBAAiB,aAAa;KAClC,IAAI,MAAM,SAAS,SAAS,YAAY;KACxC;IACF;IACA,IAAI,WAAW;KACb,MAAM,OAAO,eAAe,KAAK;KACjC,IAAI,MAAM,OAAO;IACnB;GACF;GACA;EACF;EACA,OAAO,eAAe,KAAK,QAAQ,cAAc;CACnD;CAEA,OAAO,KAAK,MAA+C;EACzD,OAAO,KAAK,SAAS,iBAAiB,IAAI,gBAAgB,IAAI,IAAI,KAAA;CACpE;AACF;;;AC/LA,IAAa,sBAAb,MAAa,oBAAuC;CAClD;CAEA,YAAY,QAAoB;EAC9B,KAAK,SAAS;CAChB;CAEA,SAA4B;EAC1B,OAAO,eAAe,KAAK,QAAQ,QAAQ;CAC7C;CAEA,SAA4B;EAC1B,OAAO,eAAe,KAAK,QAAQ,QAAQ;CAC7C;CAEA,CAAC,OAAkC;EACjC,OAAO,eAAe,KAAK,QAAQ,gBAAgB,IAAI;CACzD;CAEA,OAAO,KAAK,MAAmD;EAC7D,OAAO,KAAK,SAAS,qBAAqB,IAAI,oBAAoB,IAAI,IAAI,KAAA;CAC5E;AACF;AAEA,IAAa,oBAAb,MAAa,kBAAqC;CAChD;CAEA,YAAY,QAAoB;EAC9B,KAAK,SAAS;CAChB;CAEA,KAAwB;EACtB,OAAO,eAAe,KAAK,QAAQ,IAAI;CACzC;CAEA,OAAkC;EAChC,IAAI,KAAK,IAAI,GAAG;GACd,IAAI,QAAQ;GACZ,KAAK,MAAM,SAAS,KAAK,OAAO,WAAW,GACzC,IAAI,MAAM,SAAS,cAAc;IAC/B;IACA,IAAI,UAAU,GAAG,OAAO,IAAI,cAAc,KAAK;GACjD;GAEF;EACF;EACA,OAAO,eAAe,KAAK,QAAQ,cAAc,IAAI;CACvD;CAEA,MAAyB;EACvB,OAAO,eAAe,KAAK,QAAQ,KAAK;CAC1C;CAEA,gBAA2C;EACzC,IAAI,CAAC,KAAK,IAAI,GAAG,OAAO,KAAA;EACxB,OAAO,eAAe,KAAK,QAAQ,cAAc,IAAI;CACvD;CAEA,UAA2C;EACzC,OAAO,eAAe,KAAK,QAAQ,oBAAoB,IAAI;CAC7D;CAEA,OAAO,KAAK,MAAiD;EAC3D,OAAO,KAAK,SAAS,mBAAmB,IAAI,kBAAkB,IAAI,IAAI,KAAA;CACxE;AACF;AAEA,IAAa,oBAAb,MAAa,kBAAqC;CAChD;CAEA,YAAY,QAAoB;EAC9B,KAAK,SAAS;CAChB;CAEA,WAA8B;EAC5B,OAAO,eAAe,KAAK,QAAQ,UAAU;CAC/C;CAEA,OAAkC;EAChC,OAAO,eAAe,KAAK,QAAQ,cAAc,IAAI;CACvD;CAEA,UAA2C;EACzC,OAAO,eAAe,KAAK,QAAQ,oBAAoB,IAAI;CAC7D;CAEA,OAAO,KAAK,MAAiD;EAC3D,OAAO,KAAK,SAAS,mBAAmB,IAAI,kBAAkB,IAAI,IAAI,KAAA;CACxE;AACF;;;ACzFA,IAAa,oBAAb,MAAa,kBAAqC;CAChD;CAEA,YAAY,QAAoB;EAC9B,KAAK,SAAS;CAChB;CAEA,eAA0C;EACxC,IAAI;EACJ,KAAK,MAAM,WAAW,eAAe,KAAK,QAAQ,cAAc,IAAI,GAClE,OAAO;EAET,OAAO;CACT;CAEA,sBAAiD;EAC/C,IAAI;EACJ,IAAI;EACJ,KAAK,MAAM,WAAW,eAAe,KAAK,QAAQ,cAAc,IAAI,GAAG;GACrE,cAAc;GACd,OAAO;EACT;EACA,OAAO;CACT;CAEA,OAAkC;EAChC,OAAO,KAAKA,aAAa;CAC3B;CAEA,QAA2B;EACzB,OAAO,eAAe,KAAK,QAAQ,OAAO;CAC5C;CAEA,MAAyB;EACvB,OAAO,eAAe,KAAK,QAAQ,KAAK;CAC1C;CAEA,YAAuC;EACrC,IAAI,CAAC,KAAK,MAAM,GAAG,OAAO,KAAA;EAC1B,OAAO,eAAe,KAAK,QAAQ,cAAc,IAAI;CACvD;CAEA,gBAA2C;EACzC,IAAI,CAAC,KAAK,IAAI,GAAG,OAAO,KAAA;EACxB,OAAO,KAAKC,oBAAoB;CAClC;CAEA,kBAA+C;EAC7C,OAAO,eAAe,KAAK,QAAQ,gBAAgB,IAAI;CACzD;CAEA,WAA8B;EAC5B,OAAO,eAAe,KAAK,QAAQ,UAAU;CAC/C;CAEA,WAA8B;EAC5B,OAAO,eAAe,KAAK,QAAQ,UAAU;CAC/C;CAEA,eAAkC;EAChC,OAAO,eAAe,KAAK,QAAQ,UAAU;CAC/C;CAEA,SAAkB;EAChB,OAAO,KAAK,SAAS,MAAM,KAAA;CAC7B;CAEA,aAAsB;EACpB,OAAO,KAAK,aAAa,MAAM,KAAA;CACjC;CAEA,OAAO,KAAK,MAAiD;EAC3D,OAAO,KAAK,SAAS,mBAAmB,IAAI,kBAAkB,IAAI,IAAI,KAAA;CACxE;AACF;;;AC3DA,SAAS,oBAAoB,MAAkD;CAC7E,OACE,oBAAoB,KAAK,IAAI,KAC7B,mBAAmB,KAAK,IAAI,KAC5B,4BAA4B,KAAK,IAAI,KACrC,oBAAoB,KAAK,IAAI;AAEjC;AAEA,IAAa,cAAb,MAAa,YAA+B;CAC1C;CAEA,YAAY,QAAoB;EAC9B,KAAK,SAAS;CAChB;CAEA,CAAC,eAAuF;EACtF,OAAO,eACL,KAAK,SACJ,SACC,oBAAoB,IAAI,KAAK,cAAc,KAAK,IAAI,KAAK,wBAAwB,KAAK,IAAI,CAC9F;CACF;CAEA,OAAO,KAAK,MAA2C;EACrD,OAAO,KAAK,SAAS,aAAa,IAAI,YAAY,IAAI,IAAI,KAAA;CAC5D;AACF;AAEA,IAAa,sBAAb,MAAa,oBAAuC;CAClD;CAEA,YAAY,QAAoB;EAC9B,KAAK,SAAS;CAChB;CAEA,UAA6B;EAC3B,OAAO,eAAe,KAAK,QAAQ,OAAO;CAC5C;CAEA,OAAkC;EAChC,OAAO,eAAe,KAAK,QAAQ,cAAc,IAAI;CACvD;CAEA,SAA4B;EAC1B,OAAO,eAAe,KAAK,QAAQ,QAAQ;CAC7C;CAEA,SAA4B;EAC1B,OAAO,eAAe,KAAK,QAAQ,QAAQ;CAC7C;CAEA,CAAC,SAAwC;EACvC,OAAO,eAAe,KAAK,QAAQ,oBAAoB,IAAI;CAC7D;CAEA,CAAC,aAA0C;EACzC,OAAO,eAAe,KAAK,QAAQ,kBAAkB,IAAI;CAC3D;CAEA,OAAO,KAAK,MAAmD;EAC7D,OAAO,KAAK,SAAS,qBAAqB,IAAI,oBAAoB,IAAI,IAAI,KAAA;CAC5E;AACF;AAEA,IAAa,qBAAb,MAAa,mBAAsC;CACjD;CAEA,YAAY,QAAoB;EAC9B,KAAK,SAAS;CAChB;CAEA,UAA6B;EAC3B,OAAO,eAAe,KAAK,QAAQ,OAAO;CAC5C;CAEA,OAAkC;EAChC,OAAO,eAAe,KAAK,QAAQ,cAAc,IAAI;CACvD;CAEA,SAA4B;EAC1B,OAAO,eAAe,KAAK,QAAQ,QAAQ;CAC7C;CAEA,SAA4B;EAC1B,OAAO,eAAe,KAAK,QAAQ,QAAQ;CAC7C;CAEA,CAAC,SAA4C;EAC3C,OAAO,eAAe,KAAK,QAAQ,wBAAwB,IAAI;CACjE;CAEA,CAAC,aAA0C;EACzC,OAAO,eAAe,KAAK,QAAQ,kBAAkB,IAAI;CAC3D;CAEA,OAAO,KAAK,MAAkD;EAC5D,OAAO,KAAK,SAAS,oBAAoB,IAAI,mBAAmB,IAAI,IAAI,KAAA;CAC1E;AACF;AAEA,IAAa,8BAAb,MAAa,4BAA+C;CAC1D;CAEA,YAAY,QAAoB;EAC9B,KAAK,SAAS;CAChB;CAEA,UAA6B;EAC3B,OAAO,eAAe,KAAK,QAAQ,OAAO;CAC5C;CAEA,OAAkC;EAChC,OAAO,eAAe,KAAK,QAAQ,cAAc,IAAI;CACvD;CAEA,SAA4B;EAC1B,OAAO,eAAe,KAAK,QAAQ,QAAQ;CAC7C;CAEA,SAA4B;EAC1B,OAAO,eAAe,KAAK,QAAQ,QAAQ;CAC7C;CAEA,CAAC,SAAwC;EACvC,OAAO,eAAe,KAAK,QAAQ,oBAAoB,IAAI;CAC7D;CAEA,CAAC,aAA0C;EACzC,OAAO,eAAe,KAAK,QAAQ,kBAAkB,IAAI;CAC3D;CAEA,OAAO,KAAK,MAA2D;EACrE,OAAO,KAAK,SAAS,6BACjB,IAAI,4BAA4B,IAAI,IACpC,KAAA;CACN;AACF;AAEA,IAAa,0BAAb,MAAa,wBAA2C;CACtD;CAEA,YAAY,QAAoB;EAC9B,KAAK,SAAS;CAChB;CAEA,UAA6B;EAC3B,OAAO,eAAe,KAAK,QAAQ,OAAO;CAC5C;CAEA,OAAkC;EAChC,OAAO,eAAe,KAAK,QAAQ,cAAc,IAAI;CACvD;CAEA,SAA4B;EAC1B,OAAO,eAAe,KAAK,QAAQ,QAAQ;CAC7C;CAEA,SAA4B;EAC1B,OAAO,eAAe,KAAK,QAAQ,QAAQ;CAC7C;CAEA,CAAC,eAA6C;EAC5C,OAAO,eAAe,KAAK,QAAQ,mBAAmB;CACxD;CAEA,OAAO,KAAK,MAAuD;EACjE,OAAO,KAAK,SAAS,cAAc,IAAI,wBAAwB,IAAI,IAAI,KAAA;CACzE;AACF;AAEA,IAAa,gBAAb,MAAa,cAAiC;CAC5C;CAEA,YAAY,QAAoB;EAC9B,KAAK,SAAS;CAChB;CAEA,UAA6B;EAC3B,OAAO,eAAe,KAAK,QAAQ,OAAO;CAC5C;CAEA,SAA4B;EAC1B,OAAO,eAAe,KAAK,QAAQ,QAAQ;CAC7C;CAEA,SAA4B;EAC1B,OAAO,eAAe,KAAK,QAAQ,QAAQ;CAC7C;CAEA,CAAC,eAAkD;EACjD,OAAO,eAAe,KAAK,QAAQ,wBAAwB,IAAI;CACjE;CAEA,OAAO,KAAK,MAA6C;EACvD,OAAO,KAAK,SAAS,eAAe,IAAI,cAAc,IAAI,IAAI,KAAA;CAChE;AACF;AAEA,IAAa,sBAAb,MAAa,oBAAuC;CAClD;CAEA,YAAY,QAAoB;EAC9B,KAAK,SAAS;CAChB;CAEA,UAA6B;EAC3B,OAAO,eAAe,KAAK,QAAQ,OAAO;CAC5C;CAEA,OAAkC;EAChC,OAAO,eAAe,KAAK,QAAQ,cAAc,IAAI;CACvD;CAEA,SAA4B;EAC1B,OAAO,eAAe,KAAK,QAAQ,QAAQ;CAC7C;CAEA,SAA4B;EAC1B,OAAO,eAAe,KAAK,QAAQ,QAAQ;CAC7C;CAEA,CAAC,UAAqC;EACpC,OAAO,eAAe,KAAK,QAAQ,gBAAgB,IAAI;CACzD;CAEA,OAAO,KAAK,MAAmD;EAC7D,OAAO,KAAK,SAAS,qBAAqB,IAAI,oBAAoB,IAAI,IAAI,KAAA;CAC5E;AACF;AAEA,IAAa,kBAAb,MAAa,gBAAmC;CAC9C;CAEA,YAAY,QAAoB;EAC9B,KAAK,SAAS;CAChB;CAEA,MAAiC;EAC/B,OAAO,eAAe,KAAK,QAAQ,cAAc,IAAI;CACvD;CAEA,SAA4B;EAC1B,OAAO,eAAe,KAAK,QAAQ,QAAQ;CAC7C;CAEA,QAAmC;EACjC,IAAI,aAAa;EACjB,KAAK,MAAM,SAAS,KAAK,OAAO,SAAS,GAAG;GAC1C,IAAI,EAAE,iBAAiB,aAAa;IAClC,IAAI,MAAM,SAAS,UAAU,aAAa;IAC1C;GACF;GACA,IAAI,YAAY;IACd,MAAM,OAAO,eAAe,KAAK;IACjC,IAAI,MAAM,OAAO;GACnB;EACF;CAEF;CAEA,OAAO,KAAK,MAA+C;EACzD,OAAO,KAAK,SAAS,iBAAiB,IAAI,gBAAgB,IAAI,IAAI,KAAA;CACpE;AACF;AAEA,IAAa,sBAAb,MAAa,oBAAuC;CAClD;CAEA,YAAY,QAAoB;EAC9B,KAAK,SAAS;CAChB;CAEA,OAAkC;EAChC,OAAO,eAAe,KAAK,QAAQ,cAAc,IAAI;CACvD;CAEA,iBAAgD;EAC9C,OAAO,eAAe,KAAK,QAAQ,kBAAkB,IAAI;CAC3D;CAEA,CAAC,aAA0C;EACzC,OAAO,eAAe,KAAK,QAAQ,kBAAkB,IAAI;CAC3D;CAEA,OAAO,KAAK,MAAmD;EAC7D,OAAO,KAAK,SAAS,qBAAqB,IAAI,oBAAoB,IAAI,IAAI,KAAA;CAC5E;AACF;AAEA,IAAa,0BAAb,MAAa,wBAA2C;CACtD;CAEA,YAAY,QAAoB;EAC9B,KAAK,SAAS;CAChB;CAEA,OAAkC;EAChC,OAAO,eAAe,KAAK,QAAQ,cAAc,IAAI;CACvD;CAEA,CAAC,aAA0C;EACzC,OAAO,eAAe,KAAK,QAAQ,kBAAkB,IAAI;CAC3D;CAEA,OAAO,KAAK,MAAuD;EACjE,OAAO,KAAK,SAAS,yBAAyB,IAAI,wBAAwB,IAAI,IAAI,KAAA;CACpF;AACF;AAEA,IAAa,0BAAb,MAAa,wBAA2C;CACtD;CAEA,YAAY,QAAoB;EAC9B,KAAK,SAAS;CAChB;CAEA,OAAkC;EAChC,OAAO,eAAe,KAAK,QAAQ,cAAc,IAAI;CACvD;CAEA,SAA4B;EAC1B,OAAO,eAAe,KAAK,QAAQ,QAAQ;CAC7C;CAEA,iBAAgD;EAC9C,OAAO,eAAe,KAAK,QAAQ,kBAAkB,IAAI;CAC3D;CAEA,CAAC,aAA0C;EACzC,OAAO,eAAe,KAAK,QAAQ,kBAAkB,IAAI;CAC3D;CAEA,OAAO,KAAK,MAAuD;EACjE,OAAO,KAAK,SAAS,yBAAyB,IAAI,wBAAwB,IAAI,IAAI,KAAA;CACpF;AACF;;;ACpVA,SAAgB,WAAW,MAAiB,MAA0B;CACpE,OAAO;EAAE,MAAM;EAAS;EAAM;CAAK;AACrC;AAEA,SAAgB,UAAU,MAAkB,UAAkD;CAC5F,IAAI,aAAa;CACjB,KAAK,MAAM,SAAS,UAClB,cAAc,MAAM,SAAS,UAAU,MAAM,KAAK,SAAS,MAAM;CAEnE,OAAO;EAAE,MAAM;EAAQ;EAAM;EAAU;CAAW;AACpD;;;ACvBA,IAAa,mBAAb,MAA8B;CAC5B,SAAyE,CAAC;CAE1E,UAAU,MAAwB;EAChC,KAAKC,OAAO,KAAK;GAAE;GAAM,UAAU,CAAC;EAAE,CAAC;CACzC;CAEA,MAAM,MAAiB,MAAoB;EACzC,MAAM,UAAU,KAAKA,OAAO,GAAG,EAAE;EACjC,IAAI,CAAC,SACH,MAAM,IAAI,MAAM,oDAAoD;EAEtE,QAAQ,SAAS,KAAK,WAAW,MAAM,IAAI,CAAC;CAC9C;CAEA,aAAwB;EACtB,MAAM,YAAY,KAAKA,OAAO,IAAI;EAClC,IAAI,CAAC,WACH,MAAM,IAAI,MAAM,yDAAyD;EAE3E,MAAM,OAAO,UAAU,UAAU,MAAM,UAAU,QAAQ;EACzD,MAAM,SAAS,KAAKA,OAAO,GAAG,EAAE;EAChC,IAAI,QACF,OAAO,SAAS,KAAK,IAAI;EAE3B,OAAO;CACT;AACF"}
+{"version":3,"file":"syntax.mjs","names":["#text","#lineStarts","#lineIndexAt","#lineStartAt","#lineEndAt","#lastSegment","#penultimateSegment","#stack","#tokenizer","#sourceFile","#builder","#diagnostics","#offset","#depth","#advance"],"sources":["../src/source-file.ts","../src/syntax/red.ts","../src/syntax/ast-helpers.ts","../src/syntax/ast/identifier.ts","../src/syntax/ast/expressions.ts","../src/syntax/ast/attributes.ts","../src/syntax/ast/type-annotation.ts","../src/syntax/ast/declarations.ts","../src/syntax/green.ts","../src/syntax/green-builder.ts","../src/parse.ts"],"sourcesContent":["const LINE_FEED = 10;\n\nexport interface Position {\n  readonly line: number;\n  readonly character: number;\n}\n\nexport interface Range {\n  readonly start: Position;\n  readonly end: Position;\n}\n\nexport class SourceFile {\n  readonly #text: string;\n  readonly #lineStarts: readonly number[];\n\n  constructor(text: string) {\n    this.#text = text;\n    const lineStarts: number[] = [0];\n    for (let offset = 0; offset < text.length; offset++) {\n      if (text.charCodeAt(offset) === LINE_FEED) {\n        lineStarts.push(offset + 1);\n      }\n    }\n    this.#lineStarts = lineStarts;\n  }\n\n  get text(): string {\n    return this.#text;\n  }\n\n  get length(): number {\n    return this.#text.length;\n  }\n\n  get lineCount(): number {\n    return this.#lineStarts.length;\n  }\n\n  lineStartOffsets(): readonly number[] {\n    return this.#lineStarts;\n  }\n\n  positionAt(offset: number): Position {\n    const clamped = clamp(offset, 0, this.#text.length);\n    const line = this.#lineIndexAt(clamped);\n    return { line, character: clamped - this.#lineStartAt(line) };\n  }\n\n  offsetAt(position: Position): number {\n    const line = clamp(position.line, 0, this.#lineStarts.length - 1);\n    const lineStart = this.#lineStartAt(line);\n    const lineEnd = this.#lineEndAt(line);\n    return clamp(lineStart + position.character, lineStart, lineEnd);\n  }\n\n  #lineStartAt(line: number): number {\n    return this.#lineStarts[line] ?? 0;\n  }\n\n  #lineEndAt(line: number): number {\n    return line + 1 < this.#lineStarts.length ? this.#lineStartAt(line + 1) - 1 : this.#text.length;\n  }\n\n  #lineIndexAt(offset: number): number {\n    const lineStarts = this.#lineStarts;\n    let low = 0;\n    let high = lineStarts.length - 1;\n    while (low < high) {\n      const mid = (low + high + 1) >>> 1;\n      if ((lineStarts[mid] ?? 0) <= offset) {\n        low = mid;\n      } else {\n        high = mid - 1;\n      }\n    }\n    return low;\n  }\n}\n\nfunction clamp(value: number, min: number, max: number): number {\n  if (value < min) {\n    return min;\n  }\n  if (value > max) {\n    return max;\n  }\n  return value;\n}\n","import type { Token } from '../tokenizer';\nimport type { GreenElement, GreenNode } from './green';\nimport type { SyntaxKind } from './syntax-kind';\n\n/**\n * A token in the red tree. Unlike the green-layer {@link Token} (kind + text\n * only), a red token also carries its absolute `offset` within the source,\n * computed lazily as the tree is walked.\n */\nexport interface SyntaxToken extends Token {\n  readonly offset: number;\n}\n\nexport type SyntaxElement = SyntaxNode | SyntaxToken;\n\nexport class SyntaxNode {\n  readonly green: GreenNode;\n  readonly offset: number;\n  readonly parent: SyntaxNode | undefined;\n\n  constructor(green: GreenNode, offset: number, parent: SyntaxNode | undefined) {\n    this.green = green;\n    this.offset = offset;\n    this.parent = parent;\n  }\n\n  get kind(): SyntaxKind {\n    return this.green.kind;\n  }\n\n  get textLength(): number {\n    return this.green.textLength;\n  }\n\n  get firstChild(): SyntaxElement | undefined {\n    return childAt(this, 0);\n  }\n\n  get lastChild(): SyntaxElement | undefined {\n    const len = this.green.children.length;\n    if (len === 0) return undefined;\n    return childAt(this, len - 1);\n  }\n\n  get nextSibling(): SyntaxElement | undefined {\n    if (!this.parent) return undefined;\n    const siblings = this.parent.green.children;\n    let offset = this.parent.offset;\n    let found = false;\n    for (const child of siblings) {\n      if (found) {\n        return wrapElement(child, offset, this.parent);\n      }\n      const childLen = elementTextLength(child);\n      if (child.type === 'node' && offset === this.offset && child === this.green) {\n        found = true;\n      }\n      offset += childLen;\n    }\n    return undefined;\n  }\n\n  get prevSibling(): SyntaxElement | undefined {\n    if (!this.parent) return undefined;\n    const siblings = this.parent.green.children;\n    let offset = this.parent.offset;\n    let prev: { green: GreenElement; offset: number } | undefined;\n    for (const child of siblings) {\n      if (child.type === 'node' && offset === this.offset && child === this.green) {\n        if (!prev) return undefined;\n        return wrapElement(prev.green, prev.offset, this.parent);\n      }\n      prev = { green: child, offset };\n      offset += elementTextLength(child);\n    }\n    return undefined;\n  }\n\n  *children(): Iterable<SyntaxElement> {\n    let offset = this.offset;\n    for (const child of this.green.children) {\n      yield wrapElement(child, offset, this);\n      offset += elementTextLength(child);\n    }\n  }\n\n  *childNodes(): Iterable<SyntaxNode> {\n    for (const child of this.children()) {\n      if (child instanceof SyntaxNode) yield child;\n    }\n  }\n\n  *ancestors(): Iterable<SyntaxNode> {\n    let current: SyntaxNode | undefined = this.parent;\n    while (current) {\n      yield current;\n      current = current.parent;\n    }\n  }\n\n  *descendants(): Iterable<SyntaxElement> {\n    const stack: SyntaxElement[] = [this];\n    for (let el = stack.pop(); el !== undefined; el = stack.pop()) {\n      yield el;\n      if (el instanceof SyntaxNode) {\n        const children = Array.from(el.children());\n        for (let i = children.length - 1; i >= 0; i--) {\n          const child = children[i];\n          if (child !== undefined) {\n            stack.push(child);\n          }\n        }\n      }\n    }\n  }\n\n  *tokens(): Iterable<SyntaxToken> {\n    for (const el of this.descendants()) {\n      if (!(el instanceof SyntaxNode)) {\n        yield el;\n      }\n    }\n  }\n}\n\nfunction elementTextLength(el: GreenElement): number {\n  return el.type === 'token' ? el.text.length : el.textLength;\n}\n\nfunction wrapElement(green: GreenElement, offset: number, parent: SyntaxNode): SyntaxElement {\n  if (green.type === 'token') {\n    const token: SyntaxToken = { kind: green.kind, text: green.text, offset };\n    return token;\n  }\n  return new SyntaxNode(green, offset, parent);\n}\n\nfunction childAt(node: SyntaxNode, index: number): SyntaxElement | undefined {\n  const children = node.green.children;\n  const target = children[index];\n  if (target === undefined) return undefined;\n  let offset = node.offset;\n  for (let i = 0; i < index; i++) {\n    const child = children[i];\n    if (child !== undefined) {\n      offset += elementTextLength(child);\n    }\n  }\n  return wrapElement(target, offset, node);\n}\n\nexport function createSyntaxTree(green: GreenNode): SyntaxNode {\n  return new SyntaxNode(green, 0, undefined);\n}\n","import type { Token, TokenKind } from '../tokenizer';\nimport { SyntaxNode } from './red';\n\nexport interface AstNode {\n  readonly syntax: SyntaxNode;\n}\n\nexport function findChildToken(node: SyntaxNode, kind: TokenKind): Token | undefined {\n  for (const child of node.children()) {\n    if (!(child instanceof SyntaxNode) && child.kind === kind) {\n      return child;\n    }\n  }\n  return undefined;\n}\n\nexport function findFirstChild<T>(\n  node: SyntaxNode,\n  cast: (node: SyntaxNode) => T | undefined,\n): T | undefined {\n  for (const child of node.childNodes()) {\n    const result = cast(child);\n    if (result !== undefined) return result;\n  }\n  return undefined;\n}\n\nexport function* filterChildren<T>(\n  node: SyntaxNode,\n  cast: (node: SyntaxNode) => T | undefined,\n): Iterable<T> {\n  for (const child of node.childNodes()) {\n    const result = cast(child);\n    if (result !== undefined) yield result;\n  }\n}\n","import type { Token } from '../../tokenizer';\nimport type { AstNode } from '../ast-helpers';\nimport { findChildToken } from '../ast-helpers';\nimport type { SyntaxNode } from '../red';\n\nexport class IdentifierAst implements AstNode {\n  readonly syntax: SyntaxNode;\n\n  constructor(syntax: SyntaxNode) {\n    this.syntax = syntax;\n  }\n\n  token(): Token | undefined {\n    return findChildToken(this.syntax, 'Ident');\n  }\n\n  static cast(node: SyntaxNode): IdentifierAst | undefined {\n    return node.kind === 'Identifier' ? new IdentifierAst(node) : undefined;\n  }\n}\n","import type { Token } from '../../tokenizer';\nimport type { AstNode } from '../ast-helpers';\nimport { filterChildren, findChildToken, findFirstChild } from '../ast-helpers';\nimport { SyntaxNode } from '../red';\nimport { IdentifierAst } from './identifier';\n\nexport class FunctionCallAst implements AstNode {\n  readonly syntax: SyntaxNode;\n\n  constructor(syntax: SyntaxNode) {\n    this.syntax = syntax;\n  }\n\n  name(): IdentifierAst | undefined {\n    return findFirstChild(this.syntax, IdentifierAst.cast);\n  }\n\n  lparen(): Token | undefined {\n    return findChildToken(this.syntax, 'LParen');\n  }\n\n  rparen(): Token | undefined {\n    return findChildToken(this.syntax, 'RParen');\n  }\n\n  *args(): Iterable<AttributeArgAst> {\n    yield* filterChildren(this.syntax, AttributeArgAst.cast);\n  }\n\n  static cast(node: SyntaxNode): FunctionCallAst | undefined {\n    return node.kind === 'FunctionCall' ? new FunctionCallAst(node) : undefined;\n  }\n}\n\nexport class ArrayLiteralAst implements AstNode {\n  readonly syntax: SyntaxNode;\n\n  constructor(syntax: SyntaxNode) {\n    this.syntax = syntax;\n  }\n\n  lbracket(): Token | undefined {\n    return findChildToken(this.syntax, 'LBracket');\n  }\n\n  rbracket(): Token | undefined {\n    return findChildToken(this.syntax, 'RBracket');\n  }\n\n  *elements(): Iterable<ExpressionAst> {\n    yield* filterChildren(this.syntax, castExpression);\n  }\n\n  static cast(node: SyntaxNode): ArrayLiteralAst | undefined {\n    return node.kind === 'ArrayLiteral' ? new ArrayLiteralAst(node) : undefined;\n  }\n}\n\nconst HEX = /^[0-9a-fA-F]+$/;\n\nfunction decodeFixedHex(raw: string, start: number, width: number): string | undefined {\n  if (start + width > raw.length) return undefined;\n  const hex = raw.slice(start, start + width);\n  if (!HEX.test(hex)) return undefined;\n  return String.fromCharCode(Number.parseInt(hex, 16));\n}\n\nfunction decodeStringLiteral(raw: string): string {\n  let out = '';\n  let i = 0;\n  while (i < raw.length) {\n    const ch = raw.charAt(i);\n    if (ch !== '\\\\' || i + 1 >= raw.length) {\n      out += ch;\n      i++;\n      continue;\n    }\n    const next = raw.charAt(i + 1);\n    switch (next) {\n      case 'n':\n        out += '\\n';\n        i += 2;\n        continue;\n      case 'r':\n        out += '\\r';\n        i += 2;\n        continue;\n      case 't':\n        out += '\\t';\n        i += 2;\n        continue;\n      case '\"':\n        out += '\"';\n        i += 2;\n        continue;\n      case '\\\\':\n        out += '\\\\';\n        i += 2;\n        continue;\n      case 'x': {\n        const decoded = decodeFixedHex(raw, i + 2, 2);\n        if (decoded === undefined) {\n          out += '\\\\x';\n          i += 2;\n          continue;\n        }\n        out += decoded;\n        i += 4;\n        continue;\n      }\n      case 'u': {\n        const decoded = decodeFixedHex(raw, i + 2, 4);\n        if (decoded === undefined) {\n          out += '\\\\u';\n          i += 2;\n          continue;\n        }\n        out += decoded;\n        i += 6;\n        continue;\n      }\n      default:\n        out += `\\\\${next}`;\n        i += 2;\n        continue;\n    }\n  }\n  return out;\n}\n\nexport class StringLiteralExprAst implements AstNode {\n  readonly syntax: SyntaxNode;\n\n  constructor(syntax: SyntaxNode) {\n    this.syntax = syntax;\n  }\n\n  token(): Token | undefined {\n    return findChildToken(this.syntax, 'StringLiteral');\n  }\n\n  value(): string | undefined {\n    const tok = this.token();\n    if (!tok) return undefined;\n    return decodeStringLiteral(tok.text.slice(1, -1));\n  }\n\n  static cast(node: SyntaxNode): StringLiteralExprAst | undefined {\n    return node.kind === 'StringLiteralExpr' ? new StringLiteralExprAst(node) : undefined;\n  }\n}\n\nexport class NumberLiteralExprAst implements AstNode {\n  readonly syntax: SyntaxNode;\n\n  constructor(syntax: SyntaxNode) {\n    this.syntax = syntax;\n  }\n\n  token(): Token | undefined {\n    return findChildToken(this.syntax, 'NumberLiteral');\n  }\n\n  value(): number | undefined {\n    const tok = this.token();\n    if (!tok) return undefined;\n    return Number(tok.text);\n  }\n\n  static cast(node: SyntaxNode): NumberLiteralExprAst | undefined {\n    return node.kind === 'NumberLiteralExpr' ? new NumberLiteralExprAst(node) : undefined;\n  }\n}\n\nexport class BooleanLiteralExprAst implements AstNode {\n  readonly syntax: SyntaxNode;\n\n  constructor(syntax: SyntaxNode) {\n    this.syntax = syntax;\n  }\n\n  token(): Token | undefined {\n    return findChildToken(this.syntax, 'Ident');\n  }\n\n  value(): boolean | undefined {\n    const tok = this.token();\n    if (!tok) return undefined;\n    if (tok.text === 'true') return true;\n    if (tok.text === 'false') return false;\n    return undefined;\n  }\n\n  static cast(node: SyntaxNode): BooleanLiteralExprAst | undefined {\n    return node.kind === 'BooleanLiteralExpr' ? new BooleanLiteralExprAst(node) : undefined;\n  }\n}\n\nexport class ObjectLiteralExprAst implements AstNode {\n  readonly syntax: SyntaxNode;\n\n  constructor(syntax: SyntaxNode) {\n    this.syntax = syntax;\n  }\n\n  lbrace(): Token | undefined {\n    return findChildToken(this.syntax, 'LBrace');\n  }\n\n  rbrace(): Token | undefined {\n    return findChildToken(this.syntax, 'RBrace');\n  }\n\n  *fields(): Iterable<ObjectFieldAst> {\n    yield* filterChildren(this.syntax, ObjectFieldAst.cast);\n  }\n\n  static cast(node: SyntaxNode): ObjectLiteralExprAst | undefined {\n    return node.kind === 'ObjectLiteralExpr' ? new ObjectLiteralExprAst(node) : undefined;\n  }\n}\n\nexport class ObjectFieldAst implements AstNode {\n  readonly syntax: SyntaxNode;\n\n  constructor(syntax: SyntaxNode) {\n    this.syntax = syntax;\n  }\n\n  key(): IdentifierAst | undefined {\n    for (const child of this.syntax.children()) {\n      if (!(child instanceof SyntaxNode)) {\n        if (child.kind === 'Colon') break;\n        continue;\n      }\n      return IdentifierAst.cast(child);\n    }\n    return undefined;\n  }\n\n  colon(): Token | undefined {\n    return findChildToken(this.syntax, 'Colon');\n  }\n\n  value(): ExpressionAst | undefined {\n    if (this.colon()) {\n      let pastColon = false;\n      for (const child of this.syntax.children()) {\n        if (!(child instanceof SyntaxNode)) {\n          if (child.kind === 'Colon') pastColon = true;\n          continue;\n        }\n        if (pastColon) {\n          const expr = castExpression(child);\n          if (expr) return expr;\n        }\n      }\n      return undefined;\n    }\n    return findFirstChild(this.syntax, castExpression);\n  }\n\n  static cast(node: SyntaxNode): ObjectFieldAst | undefined {\n    return node.kind === 'ObjectField' ? new ObjectFieldAst(node) : undefined;\n  }\n}\n\nexport type ExpressionAst =\n  | FunctionCallAst\n  | ArrayLiteralAst\n  | StringLiteralExprAst\n  | NumberLiteralExprAst\n  | BooleanLiteralExprAst\n  | ObjectLiteralExprAst\n  | IdentifierAst;\n\nexport function castExpression(node: SyntaxNode): ExpressionAst | undefined {\n  return (\n    FunctionCallAst.cast(node) ??\n    ArrayLiteralAst.cast(node) ??\n    StringLiteralExprAst.cast(node) ??\n    NumberLiteralExprAst.cast(node) ??\n    BooleanLiteralExprAst.cast(node) ??\n    ObjectLiteralExprAst.cast(node) ??\n    IdentifierAst.cast(node)\n  );\n}\n\nexport class AttributeArgAst implements AstNode {\n  readonly syntax: SyntaxNode;\n\n  constructor(syntax: SyntaxNode) {\n    this.syntax = syntax;\n  }\n\n  name(): IdentifierAst | undefined {\n    if (!this.colon()) return undefined;\n    return findFirstChild(this.syntax, IdentifierAst.cast);\n  }\n\n  colon(): Token | undefined {\n    return findChildToken(this.syntax, 'Colon');\n  }\n\n  value(): ExpressionAst | undefined {\n    if (this.colon()) {\n      let pastColon = false;\n      for (const child of this.syntax.children()) {\n        if (!(child instanceof SyntaxNode)) {\n          if (child.kind === 'Colon') pastColon = true;\n          continue;\n        }\n        if (pastColon) {\n          const expr = castExpression(child);\n          if (expr) return expr;\n        }\n      }\n      return undefined;\n    }\n    return findFirstChild(this.syntax, castExpression);\n  }\n\n  static cast(node: SyntaxNode): AttributeArgAst | undefined {\n    return node.kind === 'AttributeArg' ? new AttributeArgAst(node) : undefined;\n  }\n}\n","import type { Token } from '../../tokenizer';\nimport type { AstNode } from '../ast-helpers';\nimport { filterChildren, findChildToken, findFirstChild } from '../ast-helpers';\nimport type { SyntaxNode } from '../red';\nimport { AttributeArgAst } from './expressions';\nimport { IdentifierAst } from './identifier';\n\nexport class AttributeArgListAst implements AstNode {\n  readonly syntax: SyntaxNode;\n\n  constructor(syntax: SyntaxNode) {\n    this.syntax = syntax;\n  }\n\n  lparen(): Token | undefined {\n    return findChildToken(this.syntax, 'LParen');\n  }\n\n  rparen(): Token | undefined {\n    return findChildToken(this.syntax, 'RParen');\n  }\n\n  *args(): Iterable<AttributeArgAst> {\n    yield* filterChildren(this.syntax, AttributeArgAst.cast);\n  }\n\n  static cast(node: SyntaxNode): AttributeArgListAst | undefined {\n    return node.kind === 'AttributeArgList' ? new AttributeArgListAst(node) : undefined;\n  }\n}\n\nexport class FieldAttributeAst implements AstNode {\n  readonly syntax: SyntaxNode;\n\n  constructor(syntax: SyntaxNode) {\n    this.syntax = syntax;\n  }\n\n  at(): Token | undefined {\n    return findChildToken(this.syntax, 'At');\n  }\n\n  name(): IdentifierAst | undefined {\n    if (this.dot()) {\n      let count = 0;\n      for (const child of this.syntax.childNodes()) {\n        if (child.kind === 'Identifier') {\n          count++;\n          if (count === 2) return new IdentifierAst(child);\n        }\n      }\n      return undefined;\n    }\n    return findFirstChild(this.syntax, IdentifierAst.cast);\n  }\n\n  dot(): Token | undefined {\n    return findChildToken(this.syntax, 'Dot');\n  }\n\n  namespaceName(): IdentifierAst | undefined {\n    if (!this.dot()) return undefined;\n    return findFirstChild(this.syntax, IdentifierAst.cast);\n  }\n\n  argList(): AttributeArgListAst | undefined {\n    return findFirstChild(this.syntax, AttributeArgListAst.cast);\n  }\n\n  static cast(node: SyntaxNode): FieldAttributeAst | undefined {\n    return node.kind === 'FieldAttribute' ? new FieldAttributeAst(node) : undefined;\n  }\n}\n\nexport class ModelAttributeAst implements AstNode {\n  readonly syntax: SyntaxNode;\n\n  constructor(syntax: SyntaxNode) {\n    this.syntax = syntax;\n  }\n\n  doubleAt(): Token | undefined {\n    return findChildToken(this.syntax, 'DoubleAt');\n  }\n\n  name(): IdentifierAst | undefined {\n    return findFirstChild(this.syntax, IdentifierAst.cast);\n  }\n\n  argList(): AttributeArgListAst | undefined {\n    return findFirstChild(this.syntax, AttributeArgListAst.cast);\n  }\n\n  static cast(node: SyntaxNode): ModelAttributeAst | undefined {\n    return node.kind === 'ModelAttribute' ? new ModelAttributeAst(node) : undefined;\n  }\n}\n","import type { Token } from '../../tokenizer';\nimport type { AstNode } from '../ast-helpers';\nimport { filterChildren, findChildToken, findFirstChild } from '../ast-helpers';\nimport type { SyntaxNode } from '../red';\nimport { FunctionCallAst } from './expressions';\nimport { IdentifierAst } from './identifier';\n\nexport class TypeAnnotationAst implements AstNode {\n  readonly syntax: SyntaxNode;\n\n  constructor(syntax: SyntaxNode) {\n    this.syntax = syntax;\n  }\n\n  #lastSegment(): IdentifierAst | undefined {\n    let last: IdentifierAst | undefined;\n    for (const segment of filterChildren(this.syntax, IdentifierAst.cast)) {\n      last = segment;\n    }\n    return last;\n  }\n\n  #penultimateSegment(): IdentifierAst | undefined {\n    let last: IdentifierAst | undefined;\n    let penultimate: IdentifierAst | undefined;\n    for (const segment of filterChildren(this.syntax, IdentifierAst.cast)) {\n      penultimate = last;\n      last = segment;\n    }\n    return penultimate;\n  }\n\n  name(): IdentifierAst | undefined {\n    return this.#lastSegment();\n  }\n\n  colon(): Token | undefined {\n    return findChildToken(this.syntax, 'Colon');\n  }\n\n  dot(): Token | undefined {\n    return findChildToken(this.syntax, 'Dot');\n  }\n\n  spaceName(): IdentifierAst | undefined {\n    if (!this.colon()) return undefined;\n    return findFirstChild(this.syntax, IdentifierAst.cast);\n  }\n\n  namespaceName(): IdentifierAst | undefined {\n    if (!this.dot()) return undefined;\n    return this.#penultimateSegment();\n  }\n\n  constructorCall(): FunctionCallAst | undefined {\n    return findFirstChild(this.syntax, FunctionCallAst.cast);\n  }\n\n  lbracket(): Token | undefined {\n    return findChildToken(this.syntax, 'LBracket');\n  }\n\n  rbracket(): Token | undefined {\n    return findChildToken(this.syntax, 'RBracket');\n  }\n\n  questionMark(): Token | undefined {\n    return findChildToken(this.syntax, 'Question');\n  }\n\n  isList(): boolean {\n    return this.lbracket() !== undefined;\n  }\n\n  isOptional(): boolean {\n    return this.questionMark() !== undefined;\n  }\n\n  static cast(node: SyntaxNode): TypeAnnotationAst | undefined {\n    return node.kind === 'TypeAnnotation' ? new TypeAnnotationAst(node) : undefined;\n  }\n}\n","import type { Token } from '../../tokenizer';\nimport type { AstNode } from '../ast-helpers';\nimport { filterChildren, findChildToken, findFirstChild } from '../ast-helpers';\nimport { SyntaxNode } from '../red';\nimport { FieldAttributeAst, ModelAttributeAst } from './attributes';\nimport type { ExpressionAst } from './expressions';\nimport { castExpression } from './expressions';\nimport { IdentifierAst } from './identifier';\nimport { TypeAnnotationAst } from './type-annotation';\n\n/**\n * What may appear inside a `namespace` block: models, enums, composite types,\n * and extension (block) declarations. Mirrors what `parsePslDocument` accepts\n * in a namespace body. `types {}` blocks and nested `namespace` blocks are\n * document-only, so they are not namespace members.\n */\nexport type NamespaceMemberAst =\n  | ModelDeclarationAst\n  | EnumDeclarationAst\n  | CompositeTypeDeclarationAst\n  | GenericBlockDeclarationAst;\n\nfunction castNamespaceMember(node: SyntaxNode): NamespaceMemberAst | undefined {\n  return (\n    ModelDeclarationAst.cast(node) ??\n    EnumDeclarationAst.cast(node) ??\n    CompositeTypeDeclarationAst.cast(node) ??\n    GenericBlockDeclarationAst.cast(node)\n  );\n}\n\nexport class DocumentAst implements AstNode {\n  readonly syntax: SyntaxNode;\n\n  constructor(syntax: SyntaxNode) {\n    this.syntax = syntax;\n  }\n\n  *declarations(): Iterable<NamespaceMemberAst | TypesBlockAst | NamespaceDeclarationAst> {\n    yield* filterChildren(\n      this.syntax,\n      (node) =>\n        castNamespaceMember(node) ?? TypesBlockAst.cast(node) ?? NamespaceDeclarationAst.cast(node),\n    );\n  }\n\n  static cast(node: SyntaxNode): DocumentAst | undefined {\n    return node.kind === 'Document' ? new DocumentAst(node) : undefined;\n  }\n}\n\nexport class ModelDeclarationAst implements AstNode {\n  readonly syntax: SyntaxNode;\n\n  constructor(syntax: SyntaxNode) {\n    this.syntax = syntax;\n  }\n\n  keyword(): Token | undefined {\n    return findChildToken(this.syntax, 'Ident');\n  }\n\n  name(): IdentifierAst | undefined {\n    return findFirstChild(this.syntax, IdentifierAst.cast);\n  }\n\n  lbrace(): Token | undefined {\n    return findChildToken(this.syntax, 'LBrace');\n  }\n\n  rbrace(): Token | undefined {\n    return findChildToken(this.syntax, 'RBrace');\n  }\n\n  *fields(): Iterable<FieldDeclarationAst> {\n    yield* filterChildren(this.syntax, FieldDeclarationAst.cast);\n  }\n\n  *attributes(): Iterable<ModelAttributeAst> {\n    yield* filterChildren(this.syntax, ModelAttributeAst.cast);\n  }\n\n  static cast(node: SyntaxNode): ModelDeclarationAst | undefined {\n    return node.kind === 'ModelDeclaration' ? new ModelDeclarationAst(node) : undefined;\n  }\n}\n\nexport class EnumDeclarationAst implements AstNode {\n  readonly syntax: SyntaxNode;\n\n  constructor(syntax: SyntaxNode) {\n    this.syntax = syntax;\n  }\n\n  keyword(): Token | undefined {\n    return findChildToken(this.syntax, 'Ident');\n  }\n\n  name(): IdentifierAst | undefined {\n    return findFirstChild(this.syntax, IdentifierAst.cast);\n  }\n\n  lbrace(): Token | undefined {\n    return findChildToken(this.syntax, 'LBrace');\n  }\n\n  rbrace(): Token | undefined {\n    return findChildToken(this.syntax, 'RBrace');\n  }\n\n  *values(): Iterable<EnumValueDeclarationAst> {\n    yield* filterChildren(this.syntax, EnumValueDeclarationAst.cast);\n  }\n\n  *attributes(): Iterable<ModelAttributeAst> {\n    yield* filterChildren(this.syntax, ModelAttributeAst.cast);\n  }\n\n  static cast(node: SyntaxNode): EnumDeclarationAst | undefined {\n    return node.kind === 'EnumDeclaration' ? new EnumDeclarationAst(node) : undefined;\n  }\n}\n\nexport class CompositeTypeDeclarationAst implements AstNode {\n  readonly syntax: SyntaxNode;\n\n  constructor(syntax: SyntaxNode) {\n    this.syntax = syntax;\n  }\n\n  keyword(): Token | undefined {\n    return findChildToken(this.syntax, 'Ident');\n  }\n\n  name(): IdentifierAst | undefined {\n    return findFirstChild(this.syntax, IdentifierAst.cast);\n  }\n\n  lbrace(): Token | undefined {\n    return findChildToken(this.syntax, 'LBrace');\n  }\n\n  rbrace(): Token | undefined {\n    return findChildToken(this.syntax, 'RBrace');\n  }\n\n  *fields(): Iterable<FieldDeclarationAst> {\n    yield* filterChildren(this.syntax, FieldDeclarationAst.cast);\n  }\n\n  *attributes(): Iterable<ModelAttributeAst> {\n    yield* filterChildren(this.syntax, ModelAttributeAst.cast);\n  }\n\n  static cast(node: SyntaxNode): CompositeTypeDeclarationAst | undefined {\n    return node.kind === 'CompositeTypeDeclaration'\n      ? new CompositeTypeDeclarationAst(node)\n      : undefined;\n  }\n}\n\nexport class NamespaceDeclarationAst implements AstNode {\n  readonly syntax: SyntaxNode;\n\n  constructor(syntax: SyntaxNode) {\n    this.syntax = syntax;\n  }\n\n  keyword(): Token | undefined {\n    return findChildToken(this.syntax, 'Ident');\n  }\n\n  name(): IdentifierAst | undefined {\n    return findFirstChild(this.syntax, IdentifierAst.cast);\n  }\n\n  lbrace(): Token | undefined {\n    return findChildToken(this.syntax, 'LBrace');\n  }\n\n  rbrace(): Token | undefined {\n    return findChildToken(this.syntax, 'RBrace');\n  }\n\n  *declarations(): Iterable<NamespaceMemberAst> {\n    yield* filterChildren(this.syntax, castNamespaceMember);\n  }\n\n  static cast(node: SyntaxNode): NamespaceDeclarationAst | undefined {\n    return node.kind === 'Namespace' ? new NamespaceDeclarationAst(node) : undefined;\n  }\n}\n\nexport class TypesBlockAst implements AstNode {\n  readonly syntax: SyntaxNode;\n\n  constructor(syntax: SyntaxNode) {\n    this.syntax = syntax;\n  }\n\n  keyword(): Token | undefined {\n    return findChildToken(this.syntax, 'Ident');\n  }\n\n  lbrace(): Token | undefined {\n    return findChildToken(this.syntax, 'LBrace');\n  }\n\n  rbrace(): Token | undefined {\n    return findChildToken(this.syntax, 'RBrace');\n  }\n\n  *declarations(): Iterable<NamedTypeDeclarationAst> {\n    yield* filterChildren(this.syntax, NamedTypeDeclarationAst.cast);\n  }\n\n  static cast(node: SyntaxNode): TypesBlockAst | undefined {\n    return node.kind === 'TypesBlock' ? new TypesBlockAst(node) : undefined;\n  }\n}\n\nexport class GenericBlockDeclarationAst implements AstNode {\n  readonly syntax: SyntaxNode;\n\n  constructor(syntax: SyntaxNode) {\n    this.syntax = syntax;\n  }\n\n  keyword(): Token | undefined {\n    return findChildToken(this.syntax, 'Ident');\n  }\n\n  name(): IdentifierAst | undefined {\n    return findFirstChild(this.syntax, IdentifierAst.cast);\n  }\n\n  lbrace(): Token | undefined {\n    return findChildToken(this.syntax, 'LBrace');\n  }\n\n  rbrace(): Token | undefined {\n    return findChildToken(this.syntax, 'RBrace');\n  }\n\n  *entries(): Iterable<KeyValuePairAst> {\n    yield* filterChildren(this.syntax, KeyValuePairAst.cast);\n  }\n\n  static cast(node: SyntaxNode): GenericBlockDeclarationAst | undefined {\n    return node.kind === 'GenericBlockDeclaration'\n      ? new GenericBlockDeclarationAst(node)\n      : undefined;\n  }\n}\n\nexport class KeyValuePairAst implements AstNode {\n  readonly syntax: SyntaxNode;\n\n  constructor(syntax: SyntaxNode) {\n    this.syntax = syntax;\n  }\n\n  key(): IdentifierAst | undefined {\n    return findFirstChild(this.syntax, IdentifierAst.cast);\n  }\n\n  equals(): Token | undefined {\n    return findChildToken(this.syntax, 'Equals');\n  }\n\n  value(): ExpressionAst | undefined {\n    let pastEquals = false;\n    for (const child of this.syntax.children()) {\n      if (!(child instanceof SyntaxNode)) {\n        if (child.kind === 'Equals') pastEquals = true;\n        continue;\n      }\n      if (pastEquals) {\n        const expr = castExpression(child);\n        if (expr) return expr;\n      }\n    }\n    return undefined;\n  }\n\n  static cast(node: SyntaxNode): KeyValuePairAst | undefined {\n    return node.kind === 'KeyValuePair' ? new KeyValuePairAst(node) : undefined;\n  }\n}\n\nexport class FieldDeclarationAst implements AstNode {\n  readonly syntax: SyntaxNode;\n\n  constructor(syntax: SyntaxNode) {\n    this.syntax = syntax;\n  }\n\n  name(): IdentifierAst | undefined {\n    return findFirstChild(this.syntax, IdentifierAst.cast);\n  }\n\n  typeAnnotation(): TypeAnnotationAst | undefined {\n    return findFirstChild(this.syntax, TypeAnnotationAst.cast);\n  }\n\n  *attributes(): Iterable<FieldAttributeAst> {\n    yield* filterChildren(this.syntax, FieldAttributeAst.cast);\n  }\n\n  static cast(node: SyntaxNode): FieldDeclarationAst | undefined {\n    return node.kind === 'FieldDeclaration' ? new FieldDeclarationAst(node) : undefined;\n  }\n}\n\nexport class EnumValueDeclarationAst implements AstNode {\n  readonly syntax: SyntaxNode;\n\n  constructor(syntax: SyntaxNode) {\n    this.syntax = syntax;\n  }\n\n  name(): IdentifierAst | undefined {\n    return findFirstChild(this.syntax, IdentifierAst.cast);\n  }\n\n  *attributes(): Iterable<FieldAttributeAst> {\n    yield* filterChildren(this.syntax, FieldAttributeAst.cast);\n  }\n\n  static cast(node: SyntaxNode): EnumValueDeclarationAst | undefined {\n    return node.kind === 'EnumValueDeclaration' ? new EnumValueDeclarationAst(node) : undefined;\n  }\n}\n\nexport class NamedTypeDeclarationAst implements AstNode {\n  readonly syntax: SyntaxNode;\n\n  constructor(syntax: SyntaxNode) {\n    this.syntax = syntax;\n  }\n\n  name(): IdentifierAst | undefined {\n    return findFirstChild(this.syntax, IdentifierAst.cast);\n  }\n\n  equals(): Token | undefined {\n    return findChildToken(this.syntax, 'Equals');\n  }\n\n  typeAnnotation(): TypeAnnotationAst | undefined {\n    return findFirstChild(this.syntax, TypeAnnotationAst.cast);\n  }\n\n  *attributes(): Iterable<FieldAttributeAst> {\n    yield* filterChildren(this.syntax, FieldAttributeAst.cast);\n  }\n\n  static cast(node: SyntaxNode): NamedTypeDeclarationAst | undefined {\n    return node.kind === 'NamedTypeDeclaration' ? new NamedTypeDeclarationAst(node) : undefined;\n  }\n}\n","import type { TokenKind } from '../tokenizer';\nimport type { SyntaxKind } from './syntax-kind';\n\nexport interface GreenToken {\n  readonly type: 'token';\n  readonly kind: TokenKind;\n  readonly text: string;\n}\n\nexport interface GreenNode {\n  readonly type: 'node';\n  readonly kind: SyntaxKind;\n  readonly children: ReadonlyArray<GreenElement>;\n  readonly textLength: number;\n}\n\nexport type GreenElement = GreenNode | GreenToken;\n\nexport function greenToken(kind: TokenKind, text: string): GreenToken {\n  return { type: 'token', kind, text };\n}\n\nexport function greenNode(kind: SyntaxKind, children: ReadonlyArray<GreenElement>): GreenNode {\n  let textLength = 0;\n  for (const child of children) {\n    textLength += child.type === 'token' ? child.text.length : child.textLength;\n  }\n  return { type: 'node', kind, children, textLength };\n}\n","import type { TokenKind } from '../tokenizer';\nimport type { GreenElement, GreenNode } from './green';\nimport { greenNode, greenToken } from './green';\nimport type { SyntaxKind } from './syntax-kind';\n\nexport class GreenNodeBuilder {\n  readonly #stack: Array<{ kind: SyntaxKind; children: GreenElement[] }> = [];\n\n  startNode(kind: SyntaxKind): void {\n    this.#stack.push({ kind, children: [] });\n  }\n\n  token(kind: TokenKind, text: string): void {\n    const current = this.#stack.at(-1);\n    if (!current) {\n      throw new Error('GreenNodeBuilder: token() called with no open node');\n    }\n    current.children.push(greenToken(kind, text));\n  }\n\n  finishNode(): GreenNode {\n    const completed = this.#stack.pop();\n    if (!completed) {\n      throw new Error('GreenNodeBuilder: finishNode() called with no open node');\n    }\n    const node = greenNode(completed.kind, completed.children);\n    const parent = this.#stack.at(-1);\n    if (parent) {\n      parent.children.push(node);\n    }\n    return node;\n  }\n}\n","import type { PslDiagnosticCode } from '@prisma-next/framework-components/psl-ast';\nimport { UNSPECIFIED_PSL_NAMESPACE_ID } from '@prisma-next/framework-components/psl-ast';\nimport { type Range, SourceFile } from './source-file';\nimport { DocumentAst } from './syntax/ast/declarations';\nimport type { GreenNode } from './syntax/green';\nimport { GreenNodeBuilder } from './syntax/green-builder';\nimport { createSyntaxTree } from './syntax/red';\nimport type { SyntaxKind } from './syntax/syntax-kind';\nimport { isTerminatedStringLiteral, type Token, Tokenizer, type TokenKind } from './tokenizer';\n\nexport interface ParseDiagnostic {\n  readonly code: PslDiagnosticCode;\n  readonly message: string;\n  readonly range: Range;\n}\n\nexport interface ParseResult {\n  readonly document: DocumentAst;\n  readonly diagnostics: readonly ParseDiagnostic[];\n  readonly sourceFile: SourceFile;\n}\n\nconst TRIVIA_KINDS: ReadonlySet<TokenKind> = new Set<TokenKind>([\n  'Whitespace',\n  'Newline',\n  'Comment',\n]);\n\n/**\n * The absolute source span of a single token, captured for a diagnostic: the\n * token's start offset (total source text consumed before it) and its text\n * length. Captured eagerly so a marker stays valid after the cursor advances\n * past the token it points at.\n */\nexport interface DiagnosticMark {\n  readonly offset: number;\n  readonly length: number;\n}\n\n/**\n * The fault-tolerant parser substrate the leaf and (later) declaration grammars\n * drive. It owns the token cursor, the green-tree builder with its\n * trivia-attachment discipline, the diagnostic sink, and the recovery\n * primitive. Trivia is flushed into the enclosing open node, so every child\n * node spans exactly its first through last significant token.\n */\nexport class Cursor {\n  readonly #tokenizer: Tokenizer;\n  readonly #sourceFile: SourceFile;\n  readonly #builder = new GreenNodeBuilder();\n  readonly #diagnostics: ParseDiagnostic[] = [];\n  #offset = 0;\n  #depth = 0;\n\n  constructor(source: string) {\n    this.#tokenizer = new Tokenizer(source);\n    this.#sourceFile = new SourceFile(source);\n  }\n\n  get diagnostics(): readonly ParseDiagnostic[] {\n    return this.#diagnostics;\n  }\n\n  get sourceFile(): SourceFile {\n    return this.#sourceFile;\n  }\n\n  peekKind(ahead = 0): TokenKind {\n    return this.peekToken(ahead).kind;\n  }\n\n  peekToken(ahead = 0): Token {\n    let rawIndex = 0;\n    let remaining = ahead;\n    for (;;) {\n      const token = this.#tokenizer.peek(rawIndex);\n      if (token.kind === 'Eof') return token;\n      if (TRIVIA_KINDS.has(token.kind)) {\n        rawIndex++;\n        continue;\n      }\n      if (remaining === 0) return token;\n      remaining--;\n      rawIndex++;\n    }\n  }\n\n  /**\n   * Span of the significant token `lookahead` positions ahead (`mark(0)` = the next,\n   * `mark(1)` = the one after), captured eagerly so it stays valid after the cursor advances.\n   */\n  mark(lookahead = 0): DiagnosticMark {\n    let rawIndex = 0;\n    let offset = this.#offset;\n    let remaining = lookahead;\n    for (;;) {\n      const token = this.#tokenizer.peek(rawIndex);\n      if (token.kind === 'Eof') {\n        return { offset, length: token.text.length };\n      }\n      if (!TRIVIA_KINDS.has(token.kind) && remaining === 0) {\n        return { offset, length: token.text.length };\n      }\n      if (!TRIVIA_KINDS.has(token.kind)) {\n        remaining--;\n      }\n      offset += token.text.length;\n      rawIndex++;\n    }\n  }\n\n  /**\n   * Zero-width mark just past the last consumed significant token (before any trailing\n   * trivia) — anchors an \"expected here\" diagnostic at the spot, e.g. the `{` missing\n   * after a declaration's name.\n   */\n  markAfterLastToken(): DiagnosticMark {\n    return { offset: this.#offset, length: 0 };\n  }\n\n  startNode(kind: SyntaxKind): void {\n    if (this.#depth > 0) {\n      this.flushTrivia();\n    }\n    this.#builder.startNode(kind);\n    this.#depth++;\n  }\n\n  finishNode(): GreenNode {\n    this.#depth--;\n    return this.#builder.finishNode();\n  }\n\n  bump(): Token {\n    this.flushTrivia();\n    const token = this.#tokenizer.peek();\n    if (token.kind === 'Eof') return token;\n    this.#builder.token(token.kind, token.text);\n    this.#advance();\n    return token;\n  }\n\n  recoverToSyncPoint(): void {\n    for (;;) {\n      const token = this.#tokenizer.peek();\n      if (token.kind === 'Eof' || token.kind === 'Newline' || token.kind === 'RBrace') {\n        return;\n      }\n      this.#builder.token(token.kind, token.text);\n      this.#advance();\n    }\n  }\n\n  flushTrivia(): void {\n    for (;;) {\n      const token = this.#tokenizer.peek();\n      if (!TRIVIA_KINDS.has(token.kind)) return;\n      this.#builder.token(token.kind, token.text);\n      this.#advance();\n    }\n  }\n\n  diagnostic(code: PslDiagnosticCode, message: string, mark: DiagnosticMark): void {\n    const start = mark.offset;\n    const end = start + mark.length;\n    this.#diagnostics.push({\n      code,\n      message,\n      range: {\n        start: this.#sourceFile.positionAt(start),\n        end: this.#sourceFile.positionAt(end),\n      },\n    });\n  }\n\n  #advance(): void {\n    this.#offset += this.#tokenizer.next().text.length;\n  }\n}\n\nfunction parseIdentifier(cursor: Cursor): void {\n  cursor.startNode('Identifier');\n  cursor.bump();\n  cursor.finishNode();\n}\n\n/**\n * Parses a single expression in argument or element position. Returns the\n * produced node, or `undefined` when the next significant token does not start a\n * recognised expression (the caller decides how to recover).\n */\nexport function parseExpression(cursor: Cursor): GreenNode | undefined {\n  return (\n    parseStringLiteralExpr(cursor) ??\n    parseNumberLiteralExpr(cursor) ??\n    parseArrayLiteral(cursor) ??\n    parseObjectLiteralExpr(cursor) ??\n    parseFunctionCall(cursor) ??\n    parseBooleanLiteralExpr(cursor) ??\n    parseIdentifierExpr(cursor)\n  );\n}\n\nexport function parseStringLiteralExpr(cursor: Cursor): GreenNode | undefined {\n  if (cursor.peekKind() !== 'StringLiteral') return undefined;\n  const stringMark = cursor.mark();\n  const text = cursor.peekToken().text;\n  cursor.startNode('StringLiteralExpr');\n  cursor.bump();\n  if (!isTerminatedStringLiteral(text)) {\n    cursor.diagnostic('PSL_UNTERMINATED_STRING', 'Unterminated string literal', stringMark);\n  }\n  return cursor.finishNode();\n}\n\nexport function parseNumberLiteralExpr(cursor: Cursor): GreenNode | undefined {\n  if (cursor.peekKind() !== 'NumberLiteral') return undefined;\n  cursor.startNode('NumberLiteralExpr');\n  cursor.bump();\n  return cursor.finishNode();\n}\n\n// Ordering among the `Ident`-leading alternatives is load-bearing: the\n// `LParen` lookahead of `parseFunctionCall` must win before the boolean check,\n// so `true(` stays a function call named `true` rather than a boolean literal.\nexport function parseBooleanLiteralExpr(cursor: Cursor): GreenNode | undefined {\n  if (cursor.peekKind() !== 'Ident') return undefined;\n  const text = cursor.peekToken().text;\n  if (text !== 'true' && text !== 'false') return undefined;\n  cursor.startNode('BooleanLiteralExpr');\n  cursor.bump();\n  return cursor.finishNode();\n}\n\nexport function parseIdentifierExpr(cursor: Cursor): GreenNode | undefined {\n  if (cursor.peekKind() !== 'Ident') return undefined;\n  cursor.startNode('Identifier');\n  cursor.bump();\n  return cursor.finishNode();\n}\n\nexport function parseArrayLiteral(cursor: Cursor): GreenNode | undefined {\n  if (cursor.peekKind() !== 'LBracket') return undefined;\n  cursor.startNode('ArrayLiteral');\n  cursor.bump(); // LBracket\n  while (cursor.peekKind() !== 'RBracket' && cursor.peekKind() !== 'Eof') {\n    const element = parseExpression(cursor);\n    if (!element) break;\n    if (cursor.peekKind() === 'Comma') {\n      cursor.bump();\n    } else {\n      break;\n    }\n  }\n  if (cursor.peekKind() === 'RBracket') {\n    cursor.bump();\n  }\n  return cursor.finishNode();\n}\n\nexport function parseObjectLiteralExpr(cursor: Cursor): GreenNode | undefined {\n  if (cursor.peekKind() !== 'LBrace') return undefined;\n  const braceMark = cursor.mark();\n  cursor.startNode('ObjectLiteralExpr');\n  cursor.bump(); // LBrace\n  while (cursor.peekKind() !== 'RBrace' && cursor.peekKind() !== 'Eof') {\n    parseObjectField(cursor);\n    if (cursor.peekKind() === 'Comma') {\n      cursor.bump();\n    } else if (cursor.peekKind() === 'Ident') {\n      // A following identifier key with no separating comma re-enters the loop\n      // (the next parseObjectField consumes the key, ≥1 token, guaranteeing\n      // progress). Flag the missing comma at the gap after the previous field.\n      cursor.diagnostic(\n        'PSL_INVALID_OBJECT_LITERAL',\n        'Expected \",\" between object-literal fields',\n        cursor.markAfterLastToken(),\n      );\n    } else {\n      // Anything else terminates the field list.\n      break;\n    }\n  }\n  if (cursor.peekKind() === 'RBrace') {\n    cursor.bump();\n  } else {\n    cursor.diagnostic('PSL_INVALID_OBJECT_LITERAL', 'Unterminated object literal', braceMark);\n  }\n  return cursor.finishNode();\n}\n\nexport function parseObjectField(cursor: Cursor): GreenNode {\n  cursor.startNode('ObjectField');\n  const keyMark = cursor.mark();\n  const keyText = cursor.peekToken().text;\n  if (cursor.peekKind() === 'Ident') {\n    parseIdentifier(cursor); // identifier key — the only valid key\n  } else if (cursor.peekKind() === 'StringLiteral') {\n    // String keys are not valid PSL. Flag the key, then still consume it so the\n    // field stays structured and the object/enclosing block don't desync (F04).\n    cursor.diagnostic(\n      'PSL_INVALID_OBJECT_LITERAL',\n      'Object literal keys must be identifiers',\n      keyMark,\n    );\n    parseStringLiteralExpr(cursor);\n  }\n  if (cursor.peekKind() === 'Colon') {\n    cursor.bump(); // Colon\n    const value = parseExpression(cursor);\n    if (!value) {\n      cursor.diagnostic('PSL_INVALID_OBJECT_LITERAL', 'Expected a value after \":\"', cursor.mark());\n    }\n  } else {\n    cursor.diagnostic('PSL_INVALID_OBJECT_LITERAL', `Expected \":\" after \"${keyText}\"`, keyMark);\n    const followsWithKey = cursor.peekKind() === 'Ident' && cursor.peekKind(1) === 'Colon';\n    if (!followsWithKey) {\n      parseExpression(cursor); // best-effort: consume a value if one follows\n    }\n  }\n  return cursor.finishNode();\n}\n\nexport function parseFunctionCall(cursor: Cursor): GreenNode | undefined {\n  if (cursor.peekKind() !== 'Ident' || cursor.peekKind(1) !== 'LParen') return undefined;\n  cursor.startNode('FunctionCall');\n  parseIdentifier(cursor);\n  parseParenArgs(cursor);\n  return cursor.finishNode();\n}\n\n/**\n * Parses a parenthesised, comma-separated `AttributeArg` list into the\n * currently open node (a `FunctionCall` or an `AttributeArgList`), consuming the\n * surrounding parentheses.\n */\nfunction parseParenArgs(cursor: Cursor): void {\n  cursor.bump(); // LParen\n  while (cursor.peekKind() !== 'RParen' && cursor.peekKind() !== 'Eof') {\n    parseAttributeArg(cursor);\n    if (cursor.peekKind() === 'Comma') {\n      cursor.bump();\n    } else {\n      break;\n    }\n  }\n  if (cursor.peekKind() === 'RParen') {\n    cursor.bump();\n  }\n}\n\nexport function parseAttributeArg(cursor: Cursor): GreenNode {\n  cursor.startNode('AttributeArg');\n  if (cursor.peekKind() === 'Ident' && cursor.peekKind(1) === 'Colon') {\n    parseIdentifier(cursor); // argument name\n    cursor.bump(); // Colon\n  }\n  parseArgValue(cursor);\n  return cursor.finishNode();\n}\n\nfunction parseArgValue(cursor: Cursor): void {\n  parseExpression(cursor);\n}\n\nexport function parseAttributeArgList(cursor: Cursor): GreenNode {\n  cursor.startNode('AttributeArgList');\n  parseParenArgs(cursor);\n  return cursor.finishNode();\n}\n\nexport function parseAttribute(cursor: Cursor): GreenNode {\n  const isBlockAttribute = cursor.peekKind() === 'DoubleAt';\n  const attributeMark = cursor.mark();\n  cursor.startNode(isBlockAttribute ? 'ModelAttribute' : 'FieldAttribute');\n  cursor.bump(); // At or DoubleAt\n  if (cursor.peekKind() === 'Ident') {\n    parseIdentifier(cursor);\n    if (cursor.peekKind() === 'Dot') {\n      cursor.bump(); // Dot\n      if (cursor.peekKind() === 'Ident') {\n        parseIdentifier(cursor);\n      } else {\n        cursor.diagnostic(\n          'PSL_INVALID_ATTRIBUTE_SYNTAX',\n          'Attribute name expected after \".\"',\n          cursor.mark(),\n        );\n      }\n    }\n  } else {\n    cursor.diagnostic('PSL_INVALID_ATTRIBUTE_SYNTAX', 'Attribute name expected', attributeMark);\n  }\n  if (cursor.peekKind() === 'LParen') {\n    parseAttributeArgList(cursor);\n  }\n  return cursor.finishNode();\n}\n\nexport function parseTypeAnnotation(cursor: Cursor): GreenNode {\n  cursor.startNode('TypeAnnotation');\n  if (cursor.peekKind() === 'Ident' && cursor.peekKind(1) === 'LParen') {\n    parseFunctionCall(cursor); // inline constructor, e.g. Vector(1536)\n  } else if (cursor.peekKind() === 'Ident') {\n    parseIdentifier(cursor); // base name or space/namespace segment\n    parseQualifierSegments(cursor, 'Colon');\n    parseQualifierSegments(cursor, 'Dot');\n  }\n  if (cursor.peekKind() === 'LBracket') {\n    cursor.bump();\n    if (cursor.peekKind() === 'RBracket') {\n      cursor.bump();\n    }\n  }\n  if (cursor.peekKind() === 'Question') {\n    cursor.bump();\n  }\n  return cursor.finishNode();\n}\n\n/**\n * Consumes a run of `<separator> Ident` qualifier segments. A well-formed type\n * carries at most one colon-introduced space and one dot-introduced namespace;\n * any second separator of the same kind is over-qualification and emits\n * `PSL_INVALID_QUALIFIED_TYPE` pointed at the offending separator, while still\n * consuming the segment so the subtree (and the round-trip) stays intact.\n */\nfunction parseQualifierSegments(cursor: Cursor, separator: 'Colon' | 'Dot'): void {\n  let seen = 0;\n  while (cursor.peekKind() === separator) {\n    seen++;\n    const separatorMark = cursor.mark();\n    cursor.bump(); // separator\n    if (seen > 1) {\n      cursor.diagnostic(\n        'PSL_INVALID_QUALIFIED_TYPE',\n        'Qualified type reference has too many segments',\n        separatorMark,\n      );\n    }\n    if (cursor.peekKind() === 'Ident') {\n      parseIdentifier(cursor);\n    }\n  }\n}\n\ntype MemberParser = (cursor: Cursor) => void;\n\n/**\n * Drives the recursive descent over a full PSL document. Tokenizes via the\n * substrate cursor, builds a complete green/red tree wrapped as a\n * {@link DocumentAst}, collects every syntactic {@link ParseDiagnostic}, and\n * never throws — malformed input yields diagnostics and a recovered tree, not\n * an exception.\n */\nexport function parse(source: string): ParseResult {\n  const cursor = new Cursor(source);\n  const green = parseDocument(cursor);\n  const root = createSyntaxTree(green);\n  const document = DocumentAst.cast(root) ?? new DocumentAst(root);\n  return { document, diagnostics: cursor.diagnostics, sourceFile: cursor.sourceFile };\n}\n\nfunction parseDocument(cursor: Cursor): GreenNode {\n  cursor.startNode('Document');\n  while (cursor.peekKind() !== 'Eof') {\n    parseDeclaration(cursor, false);\n  }\n  cursor.flushTrivia(); // attach trailing trivia so the round-trip stays lossless\n  return cursor.finishNode();\n}\n\nconst RESERVED_BLOCK_KEYWORDS: ReadonlySet<string> = new Set([\n  'model',\n  'enum',\n  'namespace',\n  'type',\n  'types',\n]);\n\nfunction keywordIs(cursor: Cursor, keyword: string): boolean {\n  return cursor.peekKind() === 'Ident' && cursor.peekToken().text === keyword;\n}\n\n/**\n * Recognises one top-level (or namespace-body) declaration as an ordered list of\n * alternatives composed with `??`. Each alternative owns its discriminating\n * `peekKind`/`peekToken` lookahead and is a no-op on non-match: it returns\n * `undefined` having consumed and mutated nothing, so the forward-only cursor is\n * never left half-consumed by a rejected alternative. The first alternative to\n * commit wins; when none match, the input is recovered as an unsupported\n * declaration. Recovery runs via the `if (!node)` tail rather than as a `??`\n * arm, because it appends raw tokens to the open parent instead of returning a\n * child node.\n */\nfunction parseDeclaration(cursor: Cursor, insideNamespace: boolean): void {\n  const name = cursor.peekKind(1) === 'Ident' ? cursor.peekToken(1).text : '';\n  if (insideNamespace && keywordIs(cursor, 'namespace')) {\n    cursor.diagnostic(\n      'PSL_INVALID_NAMESPACE_BLOCK',\n      `Recursive \"namespace ${name}\" block is not allowed; namespace blocks may not nest`,\n      cursor.mark(),\n    );\n  } else if (insideNamespace && keywordIs(cursor, 'types')) {\n    cursor.diagnostic(\n      'PSL_INVALID_NAMESPACE_BLOCK',\n      '`types` blocks must be declared at the document top level, not inside a namespace block',\n      cursor.mark(),\n    );\n  } else if (keywordIs(cursor, 'namespace') && name === UNSPECIFIED_PSL_NAMESPACE_ID) {\n    cursor.diagnostic(\n      'PSL_INVALID_NAMESPACE_BLOCK',\n      `Namespace name \"${UNSPECIFIED_PSL_NAMESPACE_ID}\" is reserved for the parser-synthesised bucket for top-level declarations`,\n      cursor.mark(1),\n    );\n  }\n\n  const node =\n    parseModel(cursor) ??\n    parseEnum(cursor) ??\n    parseNamespace(cursor) ??\n    parseCompositeType(cursor) ??\n    parseTypesBlock(cursor) ??\n    parseGenericBlock(cursor);\n  if (!node) {\n    parseUnsupportedTopLevel(cursor);\n  }\n}\n\n/**\n * Reports only the first missing piece — a missing name suppresses the missing-brace\n * diagnostic. `nameRequired` is false only for the `types` block, which never has a name.\n */\nfunction parseBlock(\n  cursor: Cursor,\n  kind: SyntaxKind,\n  nameRequired: boolean,\n  parseMember: MemberParser,\n): GreenNode {\n  const keyword = cursor.peekToken().text;\n  const keywordMark = cursor.mark();\n  cursor.startNode(kind);\n  cursor.bump();\n  const hasName = nameRequired && cursor.peekKind() === 'Ident';\n  if (hasName) {\n    parseIdentifier(cursor);\n  }\n  if (nameRequired && !hasName) {\n    cursor.diagnostic('PSL_INVALID_DECLARATION', `Expected a name after \"${keyword}\"`, keywordMark);\n  } else if (cursor.peekKind() !== 'LBrace') {\n    cursor.diagnostic(\n      'PSL_INVALID_DECLARATION',\n      `Expected \"{\" to open the \"${keyword}\" block`,\n      cursor.markAfterLastToken(),\n    );\n  }\n  if (cursor.peekKind() === 'LBrace') {\n    parseBlockBody(cursor, parseMember);\n  } else {\n    cursor.recoverToSyncPoint();\n  }\n  return cursor.finishNode();\n}\n\nexport function parseModel(cursor: Cursor): GreenNode | undefined {\n  if (!keywordIs(cursor, 'model')) return undefined;\n  return parseBlock(cursor, 'ModelDeclaration', true, parseModelMember);\n}\n\nexport function parseEnum(cursor: Cursor): GreenNode | undefined {\n  if (!keywordIs(cursor, 'enum')) return undefined;\n  return parseBlock(cursor, 'EnumDeclaration', true, parseEnumMember);\n}\n\n/**\n * Excluding the reserved keywords keeps a malformed reserved block (e.g. `model {` with\n * no name) routed to its dedicated parser. The generic keyword set is open\n * (extension-contributed), so a bare identifier with no brace (e.g. `oops`) is read as an\n * unfinished custom declaration — a committed `GenericBlockDeclaration` + missing-brace diagnostic\n * — not unsupported content. A non-identifier lead can't be a declaration name, so it falls\n * through to `parseUnsupportedTopLevel`.\n */\nexport function parseGenericBlock(cursor: Cursor): GreenNode | undefined {\n  if (cursor.peekKind() !== 'Ident') return undefined;\n  const keyword = cursor.peekToken().text;\n  if (RESERVED_BLOCK_KEYWORDS.has(keyword)) return undefined;\n  const hasName = cursor.peekKind(1) === 'Ident' && cursor.peekKind(2) === 'LBrace';\n  cursor.startNode('GenericBlockDeclaration');\n  cursor.bump();\n  if (hasName) {\n    parseIdentifier(cursor);\n  }\n  if (cursor.peekKind() === 'LBrace') {\n    parseBlockBody(cursor, parseKeyValueMember);\n  } else {\n    cursor.diagnostic(\n      'PSL_INVALID_DECLARATION',\n      `Expected \"{\" to open the \"${keyword}\" block`,\n      cursor.markAfterLastToken(),\n    );\n    cursor.recoverToSyncPoint();\n  }\n  return cursor.finishNode();\n}\n\nexport function parseNamespace(cursor: Cursor): GreenNode | undefined {\n  if (!keywordIs(cursor, 'namespace')) return undefined;\n  return parseBlock(cursor, 'Namespace', true, (inner) => parseDeclaration(inner, true));\n}\n\nexport function parseCompositeType(cursor: Cursor): GreenNode | undefined {\n  if (!keywordIs(cursor, 'type')) return undefined;\n  return parseBlock(cursor, 'CompositeTypeDeclaration', true, parseModelMember);\n}\n\n/** `types` (plural) is the no-name types block; the singular `type` is the composite type above. */\nexport function parseTypesBlock(cursor: Cursor): GreenNode | undefined {\n  if (!keywordIs(cursor, 'types')) return undefined;\n  return parseBlock(cursor, 'TypesBlock', false, parseNamedTypeMember);\n}\n\n/**\n * Parses a `{ … }` block body: consumes the braces, dispatches each member to\n * `parseMember` until the closing brace or EOF, and flags an unclosed block.\n * Every `parseMember` consumes at least one significant token, so the loop\n * always terminates.\n */\nfunction parseBlockBody(cursor: Cursor, parseMember: MemberParser): void {\n  const braceMark = cursor.mark();\n  cursor.bump(); // LBrace\n  for (;;) {\n    const kind = cursor.peekKind();\n    if (kind === 'RBrace' || kind === 'Eof') break;\n    parseMember(cursor);\n  }\n  if (cursor.peekKind() === 'RBrace') {\n    cursor.bump();\n  } else {\n    cursor.diagnostic('PSL_UNTERMINATED_BLOCK', 'Unterminated block declaration', braceMark);\n  }\n}\n\nfunction parseUnsupportedTopLevel(cursor: Cursor): void {\n  const offending = cursor.peekToken().text;\n  const message =\n    cursor.peekKind(1) === 'LBrace'\n      ? `Unsupported top-level block \"${offending}\"`\n      : `Unsupported top-level declaration \"${offending}\"`;\n  cursor.diagnostic('PSL_UNSUPPORTED_TOP_LEVEL_BLOCK', message, cursor.mark());\n  cursor.bump();\n  cursor.recoverToSyncPoint();\n}\n\n/**\n * Block-attribute alternative shared by model and enum members: matches a\n * leading `@@` (yielding a `ModelAttribute`) and is a no-op on anything else. The\n * `@@`-vs-`@` distinction is preserved exactly — single-`@` attributes belong to\n * fields and enum values and are parsed inside `parseField`/`parseEnumValue`.\n */\nexport function parseBlockAttribute(cursor: Cursor): GreenNode | undefined {\n  if (cursor.peekKind() !== 'DoubleAt') return undefined;\n  return parseAttribute(cursor);\n}\n\nfunction parseModelMember(cursor: Cursor): void {\n  const node = parseBlockAttribute(cursor) ?? parseField(cursor);\n  if (!node) {\n    invalidMember(\n      cursor,\n      'PSL_INVALID_MODEL_MEMBER',\n      `Invalid model member declaration \"${cursor.peekToken().text}\"`,\n    );\n  }\n}\n\nfunction parseEnumMember(cursor: Cursor): void {\n  const node = parseBlockAttribute(cursor) ?? parseEnumValue(cursor);\n  if (!node) {\n    invalidMember(\n      cursor,\n      'PSL_INVALID_ENUM_MEMBER',\n      `Invalid enum value declaration \"${cursor.peekToken().text}\"`,\n    );\n  }\n}\n\nfunction parseNamedTypeMember(cursor: Cursor): void {\n  const node = parseNamedType(cursor);\n  if (!node) {\n    invalidMember(\n      cursor,\n      'PSL_INVALID_TYPES_MEMBER',\n      `Invalid types declaration \"${cursor.peekToken().text}\"`,\n    );\n  }\n}\n\nfunction parseKeyValueMember(cursor: Cursor): void {\n  const node = parseKeyValue(cursor);\n  if (!node) {\n    invalidMember(cursor, 'PSL_INVALID_EXTENSION_BLOCK_MEMBER', 'Invalid block entry');\n  }\n}\n\nfunction invalidMember(cursor: Cursor, code: PslDiagnosticCode, message: string): void {\n  cursor.diagnostic(code, message, cursor.mark());\n  cursor.bump(); // consume the offending token so the member loop makes progress\n  cursor.recoverToSyncPoint();\n}\n\nexport function parseField(cursor: Cursor): GreenNode | undefined {\n  if (cursor.peekKind() !== 'Ident') return undefined;\n  cursor.startNode('FieldDeclaration');\n  parseIdentifier(cursor); // name\n  parseTypeAnnotation(cursor);\n  while (cursor.peekKind() === 'At') {\n    parseAttribute(cursor);\n  }\n  return cursor.finishNode();\n}\n\nexport function parseEnumValue(cursor: Cursor): GreenNode | undefined {\n  if (cursor.peekKind() !== 'Ident') return undefined;\n  cursor.startNode('EnumValueDeclaration');\n  parseIdentifier(cursor); // name\n  while (cursor.peekKind() === 'At') {\n    parseAttribute(cursor);\n  }\n  return cursor.finishNode();\n}\n\nexport function parseNamedType(cursor: Cursor): GreenNode | undefined {\n  if (cursor.peekKind() !== 'Ident') return undefined;\n  cursor.startNode('NamedTypeDeclaration');\n  const nameMark = cursor.mark();\n  const nameText = cursor.peekToken().text;\n  parseIdentifier(cursor); // name\n  if (cursor.peekKind() === 'Equals') {\n    cursor.bump();\n  } else {\n    cursor.diagnostic('PSL_INVALID_TYPES_MEMBER', `Expected \"=\" after \"${nameText}\"`, nameMark);\n  }\n  parseTypeAnnotation(cursor);\n  while (cursor.peekKind() === 'At') {\n    parseAttribute(cursor);\n  }\n  return cursor.finishNode();\n}\n\nexport function parseKeyValue(cursor: Cursor): GreenNode | undefined {\n  if (cursor.peekKind() !== 'Ident') return undefined;\n  cursor.startNode('KeyValuePair');\n  const keyMark = cursor.mark();\n  const keyText = cursor.peekToken().text;\n  parseIdentifier(cursor); // key\n  if (cursor.peekKind() === 'Equals') {\n    cursor.bump();\n  } else {\n    cursor.diagnostic(\n      'PSL_INVALID_EXTENSION_BLOCK_MEMBER',\n      `Expected \"=\" after \"${keyText}\"`,\n      keyMark,\n    );\n  }\n  parseExpression(cursor);\n  return cursor.finishNode();\n}\n"],"mappings":";;;AAAA,MAAM,YAAY;AAYlB,IAAa,aAAb,MAAwB;CACtB;CACA;CAEA,YAAY,MAAc;EACxB,KAAKA,QAAQ;EACb,MAAM,aAAuB,CAAC,CAAC;EAC/B,KAAK,IAAI,SAAS,GAAG,SAAS,KAAK,QAAQ,UACzC,IAAI,KAAK,WAAW,MAAM,MAAM,WAC9B,WAAW,KAAK,SAAS,CAAC;EAG9B,KAAKC,cAAc;CACrB;CAEA,IAAI,OAAe;EACjB,OAAO,KAAKD;CACd;CAEA,IAAI,SAAiB;EACnB,OAAO,KAAKA,MAAM;CACpB;CAEA,IAAI,YAAoB;EACtB,OAAO,KAAKC,YAAY;CAC1B;CAEA,mBAAsC;EACpC,OAAO,KAAKA;CACd;CAEA,WAAW,QAA0B;EACnC,MAAM,UAAU,MAAM,QAAQ,GAAG,KAAKD,MAAM,MAAM;EAClD,MAAM,OAAO,KAAKE,aAAa,OAAO;EACtC,OAAO;GAAE;GAAM,WAAW,UAAU,KAAKC,aAAa,IAAI;EAAE;CAC9D;CAEA,SAAS,UAA4B;EACnC,MAAM,OAAO,MAAM,SAAS,MAAM,GAAG,KAAKF,YAAY,SAAS,CAAC;EAChE,MAAM,YAAY,KAAKE,aAAa,IAAI;EACxC,MAAM,UAAU,KAAKC,WAAW,IAAI;EACpC,OAAO,MAAM,YAAY,SAAS,WAAW,WAAW,OAAO;CACjE;CAEA,aAAa,MAAsB;EACjC,OAAO,KAAKH,YAAY,SAAS;CACnC;CAEA,WAAW,MAAsB;EAC/B,OAAO,OAAO,IAAI,KAAKA,YAAY,SAAS,KAAKE,aAAa,OAAO,CAAC,IAAI,IAAI,KAAKH,MAAM;CAC3F;CAEA,aAAa,QAAwB;EACnC,MAAM,aAAa,KAAKC;EACxB,IAAI,MAAM;EACV,IAAI,OAAO,WAAW,SAAS;EAC/B,OAAO,MAAM,MAAM;GACjB,MAAM,MAAO,MAAM,OAAO,MAAO;GACjC,KAAK,WAAW,QAAQ,MAAM,QAC5B,MAAM;QAEN,OAAO,MAAM;EAEjB;EACA,OAAO;CACT;AACF;AAEA,SAAS,MAAM,OAAe,KAAa,KAAqB;CAC9D,IAAI,QAAQ,KACV,OAAO;CAET,IAAI,QAAQ,KACV,OAAO;CAET,OAAO;AACT;;;ACzEA,IAAa,aAAb,MAAa,WAAW;CACtB;CACA;CACA;CAEA,YAAY,OAAkB,QAAgB,QAAgC;EAC5E,KAAK,QAAQ;EACb,KAAK,SAAS;EACd,KAAK,SAAS;CAChB;CAEA,IAAI,OAAmB;EACrB,OAAO,KAAK,MAAM;CACpB;CAEA,IAAI,aAAqB;EACvB,OAAO,KAAK,MAAM;CACpB;CAEA,IAAI,aAAwC;EAC1C,OAAO,QAAQ,MAAM,CAAC;CACxB;CAEA,IAAI,YAAuC;EACzC,MAAM,MAAM,KAAK,MAAM,SAAS;EAChC,IAAI,QAAQ,GAAG,OAAO,KAAA;EACtB,OAAO,QAAQ,MAAM,MAAM,CAAC;CAC9B;CAEA,IAAI,cAAyC;EAC3C,IAAI,CAAC,KAAK,QAAQ,OAAO,KAAA;EACzB,MAAM,WAAW,KAAK,OAAO,MAAM;EACnC,IAAI,SAAS,KAAK,OAAO;EACzB,IAAI,QAAQ;EACZ,KAAK,MAAM,SAAS,UAAU;GAC5B,IAAI,OACF,OAAO,YAAY,OAAO,QAAQ,KAAK,MAAM;GAE/C,MAAM,WAAW,kBAAkB,KAAK;GACxC,IAAI,MAAM,SAAS,UAAU,WAAW,KAAK,UAAU,UAAU,KAAK,OACpE,QAAQ;GAEV,UAAU;EACZ;CAEF;CAEA,IAAI,cAAyC;EAC3C,IAAI,CAAC,KAAK,QAAQ,OAAO,KAAA;EACzB,MAAM,WAAW,KAAK,OAAO,MAAM;EACnC,IAAI,SAAS,KAAK,OAAO;EACzB,IAAI;EACJ,KAAK,MAAM,SAAS,UAAU;GAC5B,IAAI,MAAM,SAAS,UAAU,WAAW,KAAK,UAAU,UAAU,KAAK,OAAO;IAC3E,IAAI,CAAC,MAAM,OAAO,KAAA;IAClB,OAAO,YAAY,KAAK,OAAO,KAAK,QAAQ,KAAK,MAAM;GACzD;GACA,OAAO;IAAE,OAAO;IAAO;GAAO;GAC9B,UAAU,kBAAkB,KAAK;EACnC;CAEF;CAEA,CAAC,WAAoC;EACnC,IAAI,SAAS,KAAK;EAClB,KAAK,MAAM,SAAS,KAAK,MAAM,UAAU;GACvC,MAAM,YAAY,OAAO,QAAQ,IAAI;GACrC,UAAU,kBAAkB,KAAK;EACnC;CACF;CAEA,CAAC,aAAmC;EAClC,KAAK,MAAM,SAAS,KAAK,SAAS,GAChC,IAAI,iBAAiB,YAAY,MAAM;CAE3C;CAEA,CAAC,YAAkC;EACjC,IAAI,UAAkC,KAAK;EAC3C,OAAO,SAAS;GACd,MAAM;GACN,UAAU,QAAQ;EACpB;CACF;CAEA,CAAC,cAAuC;EACtC,MAAM,QAAyB,CAAC,IAAI;EACpC,KAAK,IAAI,KAAK,MAAM,IAAI,GAAG,OAAO,KAAA,GAAW,KAAK,MAAM,IAAI,GAAG;GAC7D,MAAM;GACN,IAAI,cAAc,YAAY;IAC5B,MAAM,WAAW,MAAM,KAAK,GAAG,SAAS,CAAC;IACzC,KAAK,IAAI,IAAI,SAAS,SAAS,GAAG,KAAK,GAAG,KAAK;KAC7C,MAAM,QAAQ,SAAS;KACvB,IAAI,UAAU,KAAA,GACZ,MAAM,KAAK,KAAK;IAEpB;GACF;EACF;CACF;CAEA,CAAC,SAAgC;EAC/B,KAAK,MAAM,MAAM,KAAK,YAAY,GAChC,IAAI,EAAE,cAAc,aAClB,MAAM;CAGZ;AACF;AAEA,SAAS,kBAAkB,IAA0B;CACnD,OAAO,GAAG,SAAS,UAAU,GAAG,KAAK,SAAS,GAAG;AACnD;AAEA,SAAS,YAAY,OAAqB,QAAgB,QAAmC;CAC3F,IAAI,MAAM,SAAS,SAEjB,OAAO;EADsB,MAAM,MAAM;EAAM,MAAM,MAAM;EAAM;CACtD;CAEb,OAAO,IAAI,WAAW,OAAO,QAAQ,MAAM;AAC7C;AAEA,SAAS,QAAQ,MAAkB,OAA0C;CAC3E,MAAM,WAAW,KAAK,MAAM;CAC5B,MAAM,SAAS,SAAS;CACxB,IAAI,WAAW,KAAA,GAAW,OAAO,KAAA;CACjC,IAAI,SAAS,KAAK;CAClB,KAAK,IAAI,IAAI,GAAG,IAAI,OAAO,KAAK;EAC9B,MAAM,QAAQ,SAAS;EACvB,IAAI,UAAU,KAAA,GACZ,UAAU,kBAAkB,KAAK;CAErC;CACA,OAAO,YAAY,QAAQ,QAAQ,IAAI;AACzC;AAEA,SAAgB,iBAAiB,OAA8B;CAC7D,OAAO,IAAI,WAAW,OAAO,GAAG,KAAA,CAAS;AAC3C;;;AClJA,SAAgB,eAAe,MAAkB,MAAoC;CACnF,KAAK,MAAM,SAAS,KAAK,SAAS,GAChC,IAAI,EAAE,iBAAiB,eAAe,MAAM,SAAS,MACnD,OAAO;AAIb;AAEA,SAAgB,eACd,MACA,MACe;CACf,KAAK,MAAM,SAAS,KAAK,WAAW,GAAG;EACrC,MAAM,SAAS,KAAK,KAAK;EACzB,IAAI,WAAW,KAAA,GAAW,OAAO;CACnC;AAEF;AAEA,UAAiB,eACf,MACA,MACa;CACb,KAAK,MAAM,SAAS,KAAK,WAAW,GAAG;EACrC,MAAM,SAAS,KAAK,KAAK;EACzB,IAAI,WAAW,KAAA,GAAW,MAAM;CAClC;AACF;;;AC9BA,IAAa,gBAAb,MAAa,cAAiC;CAC5C;CAEA,YAAY,QAAoB;EAC9B,KAAK,SAAS;CAChB;CAEA,QAA2B;EACzB,OAAO,eAAe,KAAK,QAAQ,OAAO;CAC5C;CAEA,OAAO,KAAK,MAA6C;EACvD,OAAO,KAAK,SAAS,eAAe,IAAI,cAAc,IAAI,IAAI,KAAA;CAChE;AACF;;;ACbA,IAAa,kBAAb,MAAa,gBAAmC;CAC9C;CAEA,YAAY,QAAoB;EAC9B,KAAK,SAAS;CAChB;CAEA,OAAkC;EAChC,OAAO,eAAe,KAAK,QAAQ,cAAc,IAAI;CACvD;CAEA,SAA4B;EAC1B,OAAO,eAAe,KAAK,QAAQ,QAAQ;CAC7C;CAEA,SAA4B;EAC1B,OAAO,eAAe,KAAK,QAAQ,QAAQ;CAC7C;CAEA,CAAC,OAAkC;EACjC,OAAO,eAAe,KAAK,QAAQ,gBAAgB,IAAI;CACzD;CAEA,OAAO,KAAK,MAA+C;EACzD,OAAO,KAAK,SAAS,iBAAiB,IAAI,gBAAgB,IAAI,IAAI,KAAA;CACpE;AACF;AAEA,IAAa,kBAAb,MAAa,gBAAmC;CAC9C;CAEA,YAAY,QAAoB;EAC9B,KAAK,SAAS;CAChB;CAEA,WAA8B;EAC5B,OAAO,eAAe,KAAK,QAAQ,UAAU;CAC/C;CAEA,WAA8B;EAC5B,OAAO,eAAe,KAAK,QAAQ,UAAU;CAC/C;CAEA,CAAC,WAAoC;EACnC,OAAO,eAAe,KAAK,QAAQ,cAAc;CACnD;CAEA,OAAO,KAAK,MAA+C;EACzD,OAAO,KAAK,SAAS,iBAAiB,IAAI,gBAAgB,IAAI,IAAI,KAAA;CACpE;AACF;AAEA,MAAM,MAAM;AAEZ,SAAS,eAAe,KAAa,OAAe,OAAmC;CACrF,IAAI,QAAQ,QAAQ,IAAI,QAAQ,OAAO,KAAA;CACvC,MAAM,MAAM,IAAI,MAAM,OAAO,QAAQ,KAAK;CAC1C,IAAI,CAAC,IAAI,KAAK,GAAG,GAAG,OAAO,KAAA;CAC3B,OAAO,OAAO,aAAa,OAAO,SAAS,KAAK,EAAE,CAAC;AACrD;AAEA,SAAS,oBAAoB,KAAqB;CAChD,IAAI,MAAM;CACV,IAAI,IAAI;CACR,OAAO,IAAI,IAAI,QAAQ;EACrB,MAAM,KAAK,IAAI,OAAO,CAAC;EACvB,IAAI,OAAO,QAAQ,IAAI,KAAK,IAAI,QAAQ;GACtC,OAAO;GACP;GACA;EACF;EACA,MAAM,OAAO,IAAI,OAAO,IAAI,CAAC;EAC7B,QAAQ,MAAR;GACE,KAAK;IACH,OAAO;IACP,KAAK;IACL;GACF,KAAK;IACH,OAAO;IACP,KAAK;IACL;GACF,KAAK;IACH,OAAO;IACP,KAAK;IACL;GACF,KAAK;IACH,OAAO;IACP,KAAK;IACL;GACF,KAAK;IACH,OAAO;IACP,KAAK;IACL;GACF,KAAK,KAAK;IACR,MAAM,UAAU,eAAe,KAAK,IAAI,GAAG,CAAC;IAC5C,IAAI,YAAY,KAAA,GAAW;KACzB,OAAO;KACP,KAAK;KACL;IACF;IACA,OAAO;IACP,KAAK;IACL;GACF;GACA,KAAK,KAAK;IACR,MAAM,UAAU,eAAe,KAAK,IAAI,GAAG,CAAC;IAC5C,IAAI,YAAY,KAAA,GAAW;KACzB,OAAO;KACP,KAAK;KACL;IACF;IACA,OAAO;IACP,KAAK;IACL;GACF;GACA;IACE,OAAO,KAAK;IACZ,KAAK;IACL;EACJ;CACF;CACA,OAAO;AACT;AAEA,IAAa,uBAAb,MAAa,qBAAwC;CACnD;CAEA,YAAY,QAAoB;EAC9B,KAAK,SAAS;CAChB;CAEA,QAA2B;EACzB,OAAO,eAAe,KAAK,QAAQ,eAAe;CACpD;CAEA,QAA4B;EAC1B,MAAM,MAAM,KAAK,MAAM;EACvB,IAAI,CAAC,KAAK,OAAO,KAAA;EACjB,OAAO,oBAAoB,IAAI,KAAK,MAAM,GAAG,EAAE,CAAC;CAClD;CAEA,OAAO,KAAK,MAAoD;EAC9D,OAAO,KAAK,SAAS,sBAAsB,IAAI,qBAAqB,IAAI,IAAI,KAAA;CAC9E;AACF;AAEA,IAAa,uBAAb,MAAa,qBAAwC;CACnD;CAEA,YAAY,QAAoB;EAC9B,KAAK,SAAS;CAChB;CAEA,QAA2B;EACzB,OAAO,eAAe,KAAK,QAAQ,eAAe;CACpD;CAEA,QAA4B;EAC1B,MAAM,MAAM,KAAK,MAAM;EACvB,IAAI,CAAC,KAAK,OAAO,KAAA;EACjB,OAAO,OAAO,IAAI,IAAI;CACxB;CAEA,OAAO,KAAK,MAAoD;EAC9D,OAAO,KAAK,SAAS,sBAAsB,IAAI,qBAAqB,IAAI,IAAI,KAAA;CAC9E;AACF;AAEA,IAAa,wBAAb,MAAa,sBAAyC;CACpD;CAEA,YAAY,QAAoB;EAC9B,KAAK,SAAS;CAChB;CAEA,QAA2B;EACzB,OAAO,eAAe,KAAK,QAAQ,OAAO;CAC5C;CAEA,QAA6B;EAC3B,MAAM,MAAM,KAAK,MAAM;EACvB,IAAI,CAAC,KAAK,OAAO,KAAA;EACjB,IAAI,IAAI,SAAS,QAAQ,OAAO;EAChC,IAAI,IAAI,SAAS,SAAS,OAAO;CAEnC;CAEA,OAAO,KAAK,MAAqD;EAC/D,OAAO,KAAK,SAAS,uBAAuB,IAAI,sBAAsB,IAAI,IAAI,KAAA;CAChF;AACF;AAEA,IAAa,uBAAb,MAAa,qBAAwC;CACnD;CAEA,YAAY,QAAoB;EAC9B,KAAK,SAAS;CAChB;CAEA,SAA4B;EAC1B,OAAO,eAAe,KAAK,QAAQ,QAAQ;CAC7C;CAEA,SAA4B;EAC1B,OAAO,eAAe,KAAK,QAAQ,QAAQ;CAC7C;CAEA,CAAC,SAAmC;EAClC,OAAO,eAAe,KAAK,QAAQ,eAAe,IAAI;CACxD;CAEA,OAAO,KAAK,MAAoD;EAC9D,OAAO,KAAK,SAAS,sBAAsB,IAAI,qBAAqB,IAAI,IAAI,KAAA;CAC9E;AACF;AAEA,IAAa,iBAAb,MAAa,eAAkC;CAC7C;CAEA,YAAY,QAAoB;EAC9B,KAAK,SAAS;CAChB;CAEA,MAAiC;EAC/B,KAAK,MAAM,SAAS,KAAK,OAAO,SAAS,GAAG;GAC1C,IAAI,EAAE,iBAAiB,aAAa;IAClC,IAAI,MAAM,SAAS,SAAS;IAC5B;GACF;GACA,OAAO,cAAc,KAAK,KAAK;EACjC;CAEF;CAEA,QAA2B;EACzB,OAAO,eAAe,KAAK,QAAQ,OAAO;CAC5C;CAEA,QAAmC;EACjC,IAAI,KAAK,MAAM,GAAG;GAChB,IAAI,YAAY;GAChB,KAAK,MAAM,SAAS,KAAK,OAAO,SAAS,GAAG;IAC1C,IAAI,EAAE,iBAAiB,aAAa;KAClC,IAAI,MAAM,SAAS,SAAS,YAAY;KACxC;IACF;IACA,IAAI,WAAW;KACb,MAAM,OAAO,eAAe,KAAK;KACjC,IAAI,MAAM,OAAO;IACnB;GACF;GACA;EACF;EACA,OAAO,eAAe,KAAK,QAAQ,cAAc;CACnD;CAEA,OAAO,KAAK,MAA8C;EACxD,OAAO,KAAK,SAAS,gBAAgB,IAAI,eAAe,IAAI,IAAI,KAAA;CAClE;AACF;AAWA,SAAgB,eAAe,MAA6C;CAC1E,OACE,gBAAgB,KAAK,IAAI,KACzB,gBAAgB,KAAK,IAAI,KACzB,qBAAqB,KAAK,IAAI,KAC9B,qBAAqB,KAAK,IAAI,KAC9B,sBAAsB,KAAK,IAAI,KAC/B,qBAAqB,KAAK,IAAI,KAC9B,cAAc,KAAK,IAAI;AAE3B;AAEA,IAAa,kBAAb,MAAa,gBAAmC;CAC9C;CAEA,YAAY,QAAoB;EAC9B,KAAK,SAAS;CAChB;CAEA,OAAkC;EAChC,IAAI,CAAC,KAAK,MAAM,GAAG,OAAO,KAAA;EAC1B,OAAO,eAAe,KAAK,QAAQ,cAAc,IAAI;CACvD;CAEA,QAA2B;EACzB,OAAO,eAAe,KAAK,QAAQ,OAAO;CAC5C;CAEA,QAAmC;EACjC,IAAI,KAAK,MAAM,GAAG;GAChB,IAAI,YAAY;GAChB,KAAK,MAAM,SAAS,KAAK,OAAO,SAAS,GAAG;IAC1C,IAAI,EAAE,iBAAiB,aAAa;KAClC,IAAI,MAAM,SAAS,SAAS,YAAY;KACxC;IACF;IACA,IAAI,WAAW;KACb,MAAM,OAAO,eAAe,KAAK;KACjC,IAAI,MAAM,OAAO;IACnB;GACF;GACA;EACF;EACA,OAAO,eAAe,KAAK,QAAQ,cAAc;CACnD;CAEA,OAAO,KAAK,MAA+C;EACzD,OAAO,KAAK,SAAS,iBAAiB,IAAI,gBAAgB,IAAI,IAAI,KAAA;CACpE;AACF;;;AC9TA,IAAa,sBAAb,MAAa,oBAAuC;CAClD;CAEA,YAAY,QAAoB;EAC9B,KAAK,SAAS;CAChB;CAEA,SAA4B;EAC1B,OAAO,eAAe,KAAK,QAAQ,QAAQ;CAC7C;CAEA,SAA4B;EAC1B,OAAO,eAAe,KAAK,QAAQ,QAAQ;CAC7C;CAEA,CAAC,OAAkC;EACjC,OAAO,eAAe,KAAK,QAAQ,gBAAgB,IAAI;CACzD;CAEA,OAAO,KAAK,MAAmD;EAC7D,OAAO,KAAK,SAAS,qBAAqB,IAAI,oBAAoB,IAAI,IAAI,KAAA;CAC5E;AACF;AAEA,IAAa,oBAAb,MAAa,kBAAqC;CAChD;CAEA,YAAY,QAAoB;EAC9B,KAAK,SAAS;CAChB;CAEA,KAAwB;EACtB,OAAO,eAAe,KAAK,QAAQ,IAAI;CACzC;CAEA,OAAkC;EAChC,IAAI,KAAK,IAAI,GAAG;GACd,IAAI,QAAQ;GACZ,KAAK,MAAM,SAAS,KAAK,OAAO,WAAW,GACzC,IAAI,MAAM,SAAS,cAAc;IAC/B;IACA,IAAI,UAAU,GAAG,OAAO,IAAI,cAAc,KAAK;GACjD;GAEF;EACF;EACA,OAAO,eAAe,KAAK,QAAQ,cAAc,IAAI;CACvD;CAEA,MAAyB;EACvB,OAAO,eAAe,KAAK,QAAQ,KAAK;CAC1C;CAEA,gBAA2C;EACzC,IAAI,CAAC,KAAK,IAAI,GAAG,OAAO,KAAA;EACxB,OAAO,eAAe,KAAK,QAAQ,cAAc,IAAI;CACvD;CAEA,UAA2C;EACzC,OAAO,eAAe,KAAK,QAAQ,oBAAoB,IAAI;CAC7D;CAEA,OAAO,KAAK,MAAiD;EAC3D,OAAO,KAAK,SAAS,mBAAmB,IAAI,kBAAkB,IAAI,IAAI,KAAA;CACxE;AACF;AAEA,IAAa,oBAAb,MAAa,kBAAqC;CAChD;CAEA,YAAY,QAAoB;EAC9B,KAAK,SAAS;CAChB;CAEA,WAA8B;EAC5B,OAAO,eAAe,KAAK,QAAQ,UAAU;CAC/C;CAEA,OAAkC;EAChC,OAAO,eAAe,KAAK,QAAQ,cAAc,IAAI;CACvD;CAEA,UAA2C;EACzC,OAAO,eAAe,KAAK,QAAQ,oBAAoB,IAAI;CAC7D;CAEA,OAAO,KAAK,MAAiD;EAC3D,OAAO,KAAK,SAAS,mBAAmB,IAAI,kBAAkB,IAAI,IAAI,KAAA;CACxE;AACF;;;ACzFA,IAAa,oBAAb,MAAa,kBAAqC;CAChD;CAEA,YAAY,QAAoB;EAC9B,KAAK,SAAS;CAChB;CAEA,eAA0C;EACxC,IAAI;EACJ,KAAK,MAAM,WAAW,eAAe,KAAK,QAAQ,cAAc,IAAI,GAClE,OAAO;EAET,OAAO;CACT;CAEA,sBAAiD;EAC/C,IAAI;EACJ,IAAI;EACJ,KAAK,MAAM,WAAW,eAAe,KAAK,QAAQ,cAAc,IAAI,GAAG;GACrE,cAAc;GACd,OAAO;EACT;EACA,OAAO;CACT;CAEA,OAAkC;EAChC,OAAO,KAAKI,aAAa;CAC3B;CAEA,QAA2B;EACzB,OAAO,eAAe,KAAK,QAAQ,OAAO;CAC5C;CAEA,MAAyB;EACvB,OAAO,eAAe,KAAK,QAAQ,KAAK;CAC1C;CAEA,YAAuC;EACrC,IAAI,CAAC,KAAK,MAAM,GAAG,OAAO,KAAA;EAC1B,OAAO,eAAe,KAAK,QAAQ,cAAc,IAAI;CACvD;CAEA,gBAA2C;EACzC,IAAI,CAAC,KAAK,IAAI,GAAG,OAAO,KAAA;EACxB,OAAO,KAAKC,oBAAoB;CAClC;CAEA,kBAA+C;EAC7C,OAAO,eAAe,KAAK,QAAQ,gBAAgB,IAAI;CACzD;CAEA,WAA8B;EAC5B,OAAO,eAAe,KAAK,QAAQ,UAAU;CAC/C;CAEA,WAA8B;EAC5B,OAAO,eAAe,KAAK,QAAQ,UAAU;CAC/C;CAEA,eAAkC;EAChC,OAAO,eAAe,KAAK,QAAQ,UAAU;CAC/C;CAEA,SAAkB;EAChB,OAAO,KAAK,SAAS,MAAM,KAAA;CAC7B;CAEA,aAAsB;EACpB,OAAO,KAAK,aAAa,MAAM,KAAA;CACjC;CAEA,OAAO,KAAK,MAAiD;EAC3D,OAAO,KAAK,SAAS,mBAAmB,IAAI,kBAAkB,IAAI,IAAI,KAAA;CACxE;AACF;;;AC3DA,SAAS,oBAAoB,MAAkD;CAC7E,OACE,oBAAoB,KAAK,IAAI,KAC7B,mBAAmB,KAAK,IAAI,KAC5B,4BAA4B,KAAK,IAAI,KACrC,2BAA2B,KAAK,IAAI;AAExC;AAEA,IAAa,cAAb,MAAa,YAA+B;CAC1C;CAEA,YAAY,QAAoB;EAC9B,KAAK,SAAS;CAChB;CAEA,CAAC,eAAuF;EACtF,OAAO,eACL,KAAK,SACJ,SACC,oBAAoB,IAAI,KAAK,cAAc,KAAK,IAAI,KAAK,wBAAwB,KAAK,IAAI,CAC9F;CACF;CAEA,OAAO,KAAK,MAA2C;EACrD,OAAO,KAAK,SAAS,aAAa,IAAI,YAAY,IAAI,IAAI,KAAA;CAC5D;AACF;AAEA,IAAa,sBAAb,MAAa,oBAAuC;CAClD;CAEA,YAAY,QAAoB;EAC9B,KAAK,SAAS;CAChB;CAEA,UAA6B;EAC3B,OAAO,eAAe,KAAK,QAAQ,OAAO;CAC5C;CAEA,OAAkC;EAChC,OAAO,eAAe,KAAK,QAAQ,cAAc,IAAI;CACvD;CAEA,SAA4B;EAC1B,OAAO,eAAe,KAAK,QAAQ,QAAQ;CAC7C;CAEA,SAA4B;EAC1B,OAAO,eAAe,KAAK,QAAQ,QAAQ;CAC7C;CAEA,CAAC,SAAwC;EACvC,OAAO,eAAe,KAAK,QAAQ,oBAAoB,IAAI;CAC7D;CAEA,CAAC,aAA0C;EACzC,OAAO,eAAe,KAAK,QAAQ,kBAAkB,IAAI;CAC3D;CAEA,OAAO,KAAK,MAAmD;EAC7D,OAAO,KAAK,SAAS,qBAAqB,IAAI,oBAAoB,IAAI,IAAI,KAAA;CAC5E;AACF;AAEA,IAAa,qBAAb,MAAa,mBAAsC;CACjD;CAEA,YAAY,QAAoB;EAC9B,KAAK,SAAS;CAChB;CAEA,UAA6B;EAC3B,OAAO,eAAe,KAAK,QAAQ,OAAO;CAC5C;CAEA,OAAkC;EAChC,OAAO,eAAe,KAAK,QAAQ,cAAc,IAAI;CACvD;CAEA,SAA4B;EAC1B,OAAO,eAAe,KAAK,QAAQ,QAAQ;CAC7C;CAEA,SAA4B;EAC1B,OAAO,eAAe,KAAK,QAAQ,QAAQ;CAC7C;CAEA,CAAC,SAA4C;EAC3C,OAAO,eAAe,KAAK,QAAQ,wBAAwB,IAAI;CACjE;CAEA,CAAC,aAA0C;EACzC,OAAO,eAAe,KAAK,QAAQ,kBAAkB,IAAI;CAC3D;CAEA,OAAO,KAAK,MAAkD;EAC5D,OAAO,KAAK,SAAS,oBAAoB,IAAI,mBAAmB,IAAI,IAAI,KAAA;CAC1E;AACF;AAEA,IAAa,8BAAb,MAAa,4BAA+C;CAC1D;CAEA,YAAY,QAAoB;EAC9B,KAAK,SAAS;CAChB;CAEA,UAA6B;EAC3B,OAAO,eAAe,KAAK,QAAQ,OAAO;CAC5C;CAEA,OAAkC;EAChC,OAAO,eAAe,KAAK,QAAQ,cAAc,IAAI;CACvD;CAEA,SAA4B;EAC1B,OAAO,eAAe,KAAK,QAAQ,QAAQ;CAC7C;CAEA,SAA4B;EAC1B,OAAO,eAAe,KAAK,QAAQ,QAAQ;CAC7C;CAEA,CAAC,SAAwC;EACvC,OAAO,eAAe,KAAK,QAAQ,oBAAoB,IAAI;CAC7D;CAEA,CAAC,aAA0C;EACzC,OAAO,eAAe,KAAK,QAAQ,kBAAkB,IAAI;CAC3D;CAEA,OAAO,KAAK,MAA2D;EACrE,OAAO,KAAK,SAAS,6BACjB,IAAI,4BAA4B,IAAI,IACpC,KAAA;CACN;AACF;AAEA,IAAa,0BAAb,MAAa,wBAA2C;CACtD;CAEA,YAAY,QAAoB;EAC9B,KAAK,SAAS;CAChB;CAEA,UAA6B;EAC3B,OAAO,eAAe,KAAK,QAAQ,OAAO;CAC5C;CAEA,OAAkC;EAChC,OAAO,eAAe,KAAK,QAAQ,cAAc,IAAI;CACvD;CAEA,SAA4B;EAC1B,OAAO,eAAe,KAAK,QAAQ,QAAQ;CAC7C;CAEA,SAA4B;EAC1B,OAAO,eAAe,KAAK,QAAQ,QAAQ;CAC7C;CAEA,CAAC,eAA6C;EAC5C,OAAO,eAAe,KAAK,QAAQ,mBAAmB;CACxD;CAEA,OAAO,KAAK,MAAuD;EACjE,OAAO,KAAK,SAAS,cAAc,IAAI,wBAAwB,IAAI,IAAI,KAAA;CACzE;AACF;AAEA,IAAa,gBAAb,MAAa,cAAiC;CAC5C;CAEA,YAAY,QAAoB;EAC9B,KAAK,SAAS;CAChB;CAEA,UAA6B;EAC3B,OAAO,eAAe,KAAK,QAAQ,OAAO;CAC5C;CAEA,SAA4B;EAC1B,OAAO,eAAe,KAAK,QAAQ,QAAQ;CAC7C;CAEA,SAA4B;EAC1B,OAAO,eAAe,KAAK,QAAQ,QAAQ;CAC7C;CAEA,CAAC,eAAkD;EACjD,OAAO,eAAe,KAAK,QAAQ,wBAAwB,IAAI;CACjE;CAEA,OAAO,KAAK,MAA6C;EACvD,OAAO,KAAK,SAAS,eAAe,IAAI,cAAc,IAAI,IAAI,KAAA;CAChE;AACF;AAEA,IAAa,6BAAb,MAAa,2BAA8C;CACzD;CAEA,YAAY,QAAoB;EAC9B,KAAK,SAAS;CAChB;CAEA,UAA6B;EAC3B,OAAO,eAAe,KAAK,QAAQ,OAAO;CAC5C;CAEA,OAAkC;EAChC,OAAO,eAAe,KAAK,QAAQ,cAAc,IAAI;CACvD;CAEA,SAA4B;EAC1B,OAAO,eAAe,KAAK,QAAQ,QAAQ;CAC7C;CAEA,SAA4B;EAC1B,OAAO,eAAe,KAAK,QAAQ,QAAQ;CAC7C;CAEA,CAAC,UAAqC;EACpC,OAAO,eAAe,KAAK,QAAQ,gBAAgB,IAAI;CACzD;CAEA,OAAO,KAAK,MAA0D;EACpE,OAAO,KAAK,SAAS,4BACjB,IAAI,2BAA2B,IAAI,IACnC,KAAA;CACN;AACF;AAEA,IAAa,kBAAb,MAAa,gBAAmC;CAC9C;CAEA,YAAY,QAAoB;EAC9B,KAAK,SAAS;CAChB;CAEA,MAAiC;EAC/B,OAAO,eAAe,KAAK,QAAQ,cAAc,IAAI;CACvD;CAEA,SAA4B;EAC1B,OAAO,eAAe,KAAK,QAAQ,QAAQ;CAC7C;CAEA,QAAmC;EACjC,IAAI,aAAa;EACjB,KAAK,MAAM,SAAS,KAAK,OAAO,SAAS,GAAG;GAC1C,IAAI,EAAE,iBAAiB,aAAa;IAClC,IAAI,MAAM,SAAS,UAAU,aAAa;IAC1C;GACF;GACA,IAAI,YAAY;IACd,MAAM,OAAO,eAAe,KAAK;IACjC,IAAI,MAAM,OAAO;GACnB;EACF;CAEF;CAEA,OAAO,KAAK,MAA+C;EACzD,OAAO,KAAK,SAAS,iBAAiB,IAAI,gBAAgB,IAAI,IAAI,KAAA;CACpE;AACF;AAEA,IAAa,sBAAb,MAAa,oBAAuC;CAClD;CAEA,YAAY,QAAoB;EAC9B,KAAK,SAAS;CAChB;CAEA,OAAkC;EAChC,OAAO,eAAe,KAAK,QAAQ,cAAc,IAAI;CACvD;CAEA,iBAAgD;EAC9C,OAAO,eAAe,KAAK,QAAQ,kBAAkB,IAAI;CAC3D;CAEA,CAAC,aAA0C;EACzC,OAAO,eAAe,KAAK,QAAQ,kBAAkB,IAAI;CAC3D;CAEA,OAAO,KAAK,MAAmD;EAC7D,OAAO,KAAK,SAAS,qBAAqB,IAAI,oBAAoB,IAAI,IAAI,KAAA;CAC5E;AACF;AAEA,IAAa,0BAAb,MAAa,wBAA2C;CACtD;CAEA,YAAY,QAAoB;EAC9B,KAAK,SAAS;CAChB;CAEA,OAAkC;EAChC,OAAO,eAAe,KAAK,QAAQ,cAAc,IAAI;CACvD;CAEA,CAAC,aAA0C;EACzC,OAAO,eAAe,KAAK,QAAQ,kBAAkB,IAAI;CAC3D;CAEA,OAAO,KAAK,MAAuD;EACjE,OAAO,KAAK,SAAS,yBAAyB,IAAI,wBAAwB,IAAI,IAAI,KAAA;CACpF;AACF;AAEA,IAAa,0BAAb,MAAa,wBAA2C;CACtD;CAEA,YAAY,QAAoB;EAC9B,KAAK,SAAS;CAChB;CAEA,OAAkC;EAChC,OAAO,eAAe,KAAK,QAAQ,cAAc,IAAI;CACvD;CAEA,SAA4B;EAC1B,OAAO,eAAe,KAAK,QAAQ,QAAQ;CAC7C;CAEA,iBAAgD;EAC9C,OAAO,eAAe,KAAK,QAAQ,kBAAkB,IAAI;CAC3D;CAEA,CAAC,aAA0C;EACzC,OAAO,eAAe,KAAK,QAAQ,kBAAkB,IAAI;CAC3D;CAEA,OAAO,KAAK,MAAuD;EACjE,OAAO,KAAK,SAAS,yBAAyB,IAAI,wBAAwB,IAAI,IAAI,KAAA;CACpF;AACF;;;ACtVA,SAAgB,WAAW,MAAiB,MAA0B;CACpE,OAAO;EAAE,MAAM;EAAS;EAAM;CAAK;AACrC;AAEA,SAAgB,UAAU,MAAkB,UAAkD;CAC5F,IAAI,aAAa;CACjB,KAAK,MAAM,SAAS,UAClB,cAAc,MAAM,SAAS,UAAU,MAAM,KAAK,SAAS,MAAM;CAEnE,OAAO;EAAE,MAAM;EAAQ;EAAM;EAAU;CAAW;AACpD;;;ACvBA,IAAa,mBAAb,MAA8B;CAC5B,SAAyE,CAAC;CAE1E,UAAU,MAAwB;EAChC,KAAKC,OAAO,KAAK;GAAE;GAAM,UAAU,CAAC;EAAE,CAAC;CACzC;CAEA,MAAM,MAAiB,MAAoB;EACzC,MAAM,UAAU,KAAKA,OAAO,GAAG,EAAE;EACjC,IAAI,CAAC,SACH,MAAM,IAAI,MAAM,oDAAoD;EAEtE,QAAQ,SAAS,KAAK,WAAW,MAAM,IAAI,CAAC;CAC9C;CAEA,aAAwB;EACtB,MAAM,YAAY,KAAKA,OAAO,IAAI;EAClC,IAAI,CAAC,WACH,MAAM,IAAI,MAAM,yDAAyD;EAE3E,MAAM,OAAO,UAAU,UAAU,MAAM,UAAU,QAAQ;EACzD,MAAM,SAAS,KAAKA,OAAO,GAAG,EAAE;EAChC,IAAI,QACF,OAAO,SAAS,KAAK,IAAI;EAE3B,OAAO;CACT;AACF;;;ACVA,MAAM,eAAuC,IAAI,IAAe;CAC9D;CACA;CACA;AACF,CAAC;;;;;;;;AAoBD,IAAa,SAAb,MAAoB;CAClB;CACA;CACA,WAAoB,IAAI,iBAAiB;CACzC,eAA2C,CAAC;CAC5C,UAAU;CACV,SAAS;CAET,YAAY,QAAgB;EAC1B,KAAKC,aAAa,IAAI,UAAU,MAAM;EACtC,KAAKC,cAAc,IAAI,WAAW,MAAM;CAC1C;CAEA,IAAI,cAA0C;EAC5C,OAAO,KAAKE;CACd;CAEA,IAAI,aAAyB;EAC3B,OAAO,KAAKF;CACd;CAEA,SAAS,QAAQ,GAAc;EAC7B,OAAO,KAAK,UAAU,KAAK,CAAC,CAAC;CAC/B;CAEA,UAAU,QAAQ,GAAU;EAC1B,IAAI,WAAW;EACf,IAAI,YAAY;EAChB,SAAS;GACP,MAAM,QAAQ,KAAKD,WAAW,KAAK,QAAQ;GAC3C,IAAI,MAAM,SAAS,OAAO,OAAO;GACjC,IAAI,aAAa,IAAI,MAAM,IAAI,GAAG;IAChC;IACA;GACF;GACA,IAAI,cAAc,GAAG,OAAO;GAC5B;GACA;EACF;CACF;;;;;CAMA,KAAK,YAAY,GAAmB;EAClC,IAAI,WAAW;EACf,IAAI,SAAS,KAAKI;EAClB,IAAI,YAAY;EAChB,SAAS;GACP,MAAM,QAAQ,KAAKJ,WAAW,KAAK,QAAQ;GAC3C,IAAI,MAAM,SAAS,OACjB,OAAO;IAAE;IAAQ,QAAQ,MAAM,KAAK;GAAO;GAE7C,IAAI,CAAC,aAAa,IAAI,MAAM,IAAI,KAAK,cAAc,GACjD,OAAO;IAAE;IAAQ,QAAQ,MAAM,KAAK;GAAO;GAE7C,IAAI,CAAC,aAAa,IAAI,MAAM,IAAI,GAC9B;GAEF,UAAU,MAAM,KAAK;GACrB;EACF;CACF;;;;;;CAOA,qBAAqC;EACnC,OAAO;GAAE,QAAQ,KAAKI;GAAS,QAAQ;EAAE;CAC3C;CAEA,UAAU,MAAwB;EAChC,IAAI,KAAKC,SAAS,GAChB,KAAK,YAAY;EAEnB,KAAKH,SAAS,UAAU,IAAI;EAC5B,KAAKG;CACP;CAEA,aAAwB;EACtB,KAAKA;EACL,OAAO,KAAKH,SAAS,WAAW;CAClC;CAEA,OAAc;EACZ,KAAK,YAAY;EACjB,MAAM,QAAQ,KAAKF,WAAW,KAAK;EACnC,IAAI,MAAM,SAAS,OAAO,OAAO;EACjC,KAAKE,SAAS,MAAM,MAAM,MAAM,MAAM,IAAI;EAC1C,KAAKI,SAAS;EACd,OAAO;CACT;CAEA,qBAA2B;EACzB,SAAS;GACP,MAAM,QAAQ,KAAKN,WAAW,KAAK;GACnC,IAAI,MAAM,SAAS,SAAS,MAAM,SAAS,aAAa,MAAM,SAAS,UACrE;GAEF,KAAKE,SAAS,MAAM,MAAM,MAAM,MAAM,IAAI;GAC1C,KAAKI,SAAS;EAChB;CACF;CAEA,cAAoB;EAClB,SAAS;GACP,MAAM,QAAQ,KAAKN,WAAW,KAAK;GACnC,IAAI,CAAC,aAAa,IAAI,MAAM,IAAI,GAAG;GACnC,KAAKE,SAAS,MAAM,MAAM,MAAM,MAAM,IAAI;GAC1C,KAAKI,SAAS;EAChB;CACF;CAEA,WAAW,MAAyB,SAAiB,MAA4B;EAC/E,MAAM,QAAQ,KAAK;EACnB,MAAM,MAAM,QAAQ,KAAK;EACzB,KAAKH,aAAa,KAAK;GACrB;GACA;GACA,OAAO;IACL,OAAO,KAAKF,YAAY,WAAW,KAAK;IACxC,KAAK,KAAKA,YAAY,WAAW,GAAG;GACtC;EACF,CAAC;CACH;CAEA,WAAiB;EACf,KAAKG,WAAW,KAAKJ,WAAW,KAAK,CAAC,CAAC,KAAK;CAC9C;AACF;AAEA,SAAS,gBAAgB,QAAsB;CAC7C,OAAO,UAAU,YAAY;CAC7B,OAAO,KAAK;CACZ,OAAO,WAAW;AACpB;;;;;;AAOA,SAAgB,gBAAgB,QAAuC;CACrE,OACE,uBAAuB,MAAM,KAC7B,uBAAuB,MAAM,KAC7B,kBAAkB,MAAM,KACxB,uBAAuB,MAAM,KAC7B,kBAAkB,MAAM,KACxB,wBAAwB,MAAM,KAC9B,oBAAoB,MAAM;AAE9B;AAEA,SAAgB,uBAAuB,QAAuC;CAC5E,IAAI,OAAO,SAAS,MAAM,iBAAiB,OAAO,KAAA;CAClD,MAAM,aAAa,OAAO,KAAK;CAC/B,MAAM,OAAO,OAAO,UAAU,CAAC,CAAC;CAChC,OAAO,UAAU,mBAAmB;CACpC,OAAO,KAAK;CACZ,IAAI,CAAC,0BAA0B,IAAI,GACjC,OAAO,WAAW,2BAA2B,+BAA+B,UAAU;CAExF,OAAO,OAAO,WAAW;AAC3B;AAEA,SAAgB,uBAAuB,QAAuC;CAC5E,IAAI,OAAO,SAAS,MAAM,iBAAiB,OAAO,KAAA;CAClD,OAAO,UAAU,mBAAmB;CACpC,OAAO,KAAK;CACZ,OAAO,OAAO,WAAW;AAC3B;AAKA,SAAgB,wBAAwB,QAAuC;CAC7E,IAAI,OAAO,SAAS,MAAM,SAAS,OAAO,KAAA;CAC1C,MAAM,OAAO,OAAO,UAAU,CAAC,CAAC;CAChC,IAAI,SAAS,UAAU,SAAS,SAAS,OAAO,KAAA;CAChD,OAAO,UAAU,oBAAoB;CACrC,OAAO,KAAK;CACZ,OAAO,OAAO,WAAW;AAC3B;AAEA,SAAgB,oBAAoB,QAAuC;CACzE,IAAI,OAAO,SAAS,MAAM,SAAS,OAAO,KAAA;CAC1C,OAAO,UAAU,YAAY;CAC7B,OAAO,KAAK;CACZ,OAAO,OAAO,WAAW;AAC3B;AAEA,SAAgB,kBAAkB,QAAuC;CACvE,IAAI,OAAO,SAAS,MAAM,YAAY,OAAO,KAAA;CAC7C,OAAO,UAAU,cAAc;CAC/B,OAAO,KAAK;CACZ,OAAO,OAAO,SAAS,MAAM,cAAc,OAAO,SAAS,MAAM,OAAO;EAEtE,IAAI,CADY,gBAAgB,MACrB,GAAG;EACd,IAAI,OAAO,SAAS,MAAM,SACxB,OAAO,KAAK;OAEZ;CAEJ;CACA,IAAI,OAAO,SAAS,MAAM,YACxB,OAAO,KAAK;CAEd,OAAO,OAAO,WAAW;AAC3B;AAEA,SAAgB,uBAAuB,QAAuC;CAC5E,IAAI,OAAO,SAAS,MAAM,UAAU,OAAO,KAAA;CAC3C,MAAM,YAAY,OAAO,KAAK;CAC9B,OAAO,UAAU,mBAAmB;CACpC,OAAO,KAAK;CACZ,OAAO,OAAO,SAAS,MAAM,YAAY,OAAO,SAAS,MAAM,OAAO;EACpE,iBAAiB,MAAM;EACvB,IAAI,OAAO,SAAS,MAAM,SACxB,OAAO,KAAK;OACP,IAAI,OAAO,SAAS,MAAM,SAI/B,OAAO,WACL,8BACA,gDACA,OAAO,mBAAmB,CAC5B;OAGA;CAEJ;CACA,IAAI,OAAO,SAAS,MAAM,UACxB,OAAO,KAAK;MAEZ,OAAO,WAAW,8BAA8B,+BAA+B,SAAS;CAE1F,OAAO,OAAO,WAAW;AAC3B;AAEA,SAAgB,iBAAiB,QAA2B;CAC1D,OAAO,UAAU,aAAa;CAC9B,MAAM,UAAU,OAAO,KAAK;CAC5B,MAAM,UAAU,OAAO,UAAU,CAAC,CAAC;CACnC,IAAI,OAAO,SAAS,MAAM,SACxB,gBAAgB,MAAM;MACjB,IAAI,OAAO,SAAS,MAAM,iBAAiB;EAGhD,OAAO,WACL,8BACA,2CACA,OACF;EACA,uBAAuB,MAAM;CAC/B;CACA,IAAI,OAAO,SAAS,MAAM,SAAS;EACjC,OAAO,KAAK;EAEZ,IAAI,CADU,gBAAgB,MACrB,GACP,OAAO,WAAW,8BAA8B,gCAA8B,OAAO,KAAK,CAAC;CAE/F,OAAO;EACL,OAAO,WAAW,8BAA8B,uBAAuB,QAAQ,IAAI,OAAO;EAE1F,IAAI,EADmB,OAAO,SAAS,MAAM,WAAW,OAAO,SAAS,CAAC,MAAM,UAE7E,gBAAgB,MAAM;CAE1B;CACA,OAAO,OAAO,WAAW;AAC3B;AAEA,SAAgB,kBAAkB,QAAuC;CACvE,IAAI,OAAO,SAAS,MAAM,WAAW,OAAO,SAAS,CAAC,MAAM,UAAU,OAAO,KAAA;CAC7E,OAAO,UAAU,cAAc;CAC/B,gBAAgB,MAAM;CACtB,eAAe,MAAM;CACrB,OAAO,OAAO,WAAW;AAC3B;;;;;;AAOA,SAAS,eAAe,QAAsB;CAC5C,OAAO,KAAK;CACZ,OAAO,OAAO,SAAS,MAAM,YAAY,OAAO,SAAS,MAAM,OAAO;EACpE,kBAAkB,MAAM;EACxB,IAAI,OAAO,SAAS,MAAM,SACxB,OAAO,KAAK;OAEZ;CAEJ;CACA,IAAI,OAAO,SAAS,MAAM,UACxB,OAAO,KAAK;AAEhB;AAEA,SAAgB,kBAAkB,QAA2B;CAC3D,OAAO,UAAU,cAAc;CAC/B,IAAI,OAAO,SAAS,MAAM,WAAW,OAAO,SAAS,CAAC,MAAM,SAAS;EACnE,gBAAgB,MAAM;EACtB,OAAO,KAAK;CACd;CACA,cAAc,MAAM;CACpB,OAAO,OAAO,WAAW;AAC3B;AAEA,SAAS,cAAc,QAAsB;CAC3C,gBAAgB,MAAM;AACxB;AAEA,SAAgB,sBAAsB,QAA2B;CAC/D,OAAO,UAAU,kBAAkB;CACnC,eAAe,MAAM;CACrB,OAAO,OAAO,WAAW;AAC3B;AAEA,SAAgB,eAAe,QAA2B;CACxD,MAAM,mBAAmB,OAAO,SAAS,MAAM;CAC/C,MAAM,gBAAgB,OAAO,KAAK;CAClC,OAAO,UAAU,mBAAmB,mBAAmB,gBAAgB;CACvE,OAAO,KAAK;CACZ,IAAI,OAAO,SAAS,MAAM,SAAS;EACjC,gBAAgB,MAAM;EACtB,IAAI,OAAO,SAAS,MAAM,OAAO;GAC/B,OAAO,KAAK;GACZ,IAAI,OAAO,SAAS,MAAM,SACxB,gBAAgB,MAAM;QAEtB,OAAO,WACL,gCACA,uCACA,OAAO,KAAK,CACd;EAEJ;CACF,OACE,OAAO,WAAW,gCAAgC,2BAA2B,aAAa;CAE5F,IAAI,OAAO,SAAS,MAAM,UACxB,sBAAsB,MAAM;CAE9B,OAAO,OAAO,WAAW;AAC3B;AAEA,SAAgB,oBAAoB,QAA2B;CAC7D,OAAO,UAAU,gBAAgB;CACjC,IAAI,OAAO,SAAS,MAAM,WAAW,OAAO,SAAS,CAAC,MAAM,UAC1D,kBAAkB,MAAM;MACnB,IAAI,OAAO,SAAS,MAAM,SAAS;EACxC,gBAAgB,MAAM;EACtB,uBAAuB,QAAQ,OAAO;EACtC,uBAAuB,QAAQ,KAAK;CACtC;CACA,IAAI,OAAO,SAAS,MAAM,YAAY;EACpC,OAAO,KAAK;EACZ,IAAI,OAAO,SAAS,MAAM,YACxB,OAAO,KAAK;CAEhB;CACA,IAAI,OAAO,SAAS,MAAM,YACxB,OAAO,KAAK;CAEd,OAAO,OAAO,WAAW;AAC3B;;;;;;;;AASA,SAAS,uBAAuB,QAAgB,WAAkC;CAChF,IAAI,OAAO;CACX,OAAO,OAAO,SAAS,MAAM,WAAW;EACtC;EACA,MAAM,gBAAgB,OAAO,KAAK;EAClC,OAAO,KAAK;EACZ,IAAI,OAAO,GACT,OAAO,WACL,8BACA,kDACA,aACF;EAEF,IAAI,OAAO,SAAS,MAAM,SACxB,gBAAgB,MAAM;CAE1B;AACF;;;;;;;;AAWA,SAAgB,MAAM,QAA6B;CACjD,MAAM,SAAS,IAAI,OAAO,MAAM;CAEhC,MAAM,OAAO,iBADC,cAAc,MACM,CAAC;CAEnC,OAAO;EAAE,UADQ,YAAY,KAAK,IAAI,KAAK,IAAI,YAAY,IAAI;EAC5C,aAAa,OAAO;EAAa,YAAY,OAAO;CAAW;AACpF;AAEA,SAAS,cAAc,QAA2B;CAChD,OAAO,UAAU,UAAU;CAC3B,OAAO,OAAO,SAAS,MAAM,OAC3B,iBAAiB,QAAQ,KAAK;CAEhC,OAAO,YAAY;CACnB,OAAO,OAAO,WAAW;AAC3B;AAEA,MAAM,0BAA+C,IAAI,IAAI;CAC3D;CACA;CACA;CACA;CACA;AACF,CAAC;AAED,SAAS,UAAU,QAAgB,SAA0B;CAC3D,OAAO,OAAO,SAAS,MAAM,WAAW,OAAO,UAAU,CAAC,CAAC,SAAS;AACtE;;;;;;;;;;;;AAaA,SAAS,iBAAiB,QAAgB,iBAAgC;CACxE,MAAM,OAAO,OAAO,SAAS,CAAC,MAAM,UAAU,OAAO,UAAU,CAAC,CAAC,CAAC,OAAO;CACzE,IAAI,mBAAmB,UAAU,QAAQ,WAAW,GAClD,OAAO,WACL,+BACA,wBAAwB,KAAK,wDAC7B,OAAO,KAAK,CACd;MACK,IAAI,mBAAmB,UAAU,QAAQ,OAAO,GACrD,OAAO,WACL,+BACA,2FACA,OAAO,KAAK,CACd;MACK,IAAI,UAAU,QAAQ,WAAW,KAAK,SAAS,8BACpD,OAAO,WACL,+BACA,mBAAmB,6BAA6B,6EAChD,OAAO,KAAK,CAAC,CACf;CAUF,IAAI,EANF,WAAW,MAAM,KACjB,UAAU,MAAM,KAChB,eAAe,MAAM,KACrB,mBAAmB,MAAM,KACzB,gBAAgB,MAAM,KACtB,kBAAkB,MAAM,IAExB,yBAAyB,MAAM;AAEnC;;;;;AAMA,SAAS,WACP,QACA,MACA,cACA,aACW;CACX,MAAM,UAAU,OAAO,UAAU,CAAC,CAAC;CACnC,MAAM,cAAc,OAAO,KAAK;CAChC,OAAO,UAAU,IAAI;CACrB,OAAO,KAAK;CACZ,MAAM,UAAU,gBAAgB,OAAO,SAAS,MAAM;CACtD,IAAI,SACF,gBAAgB,MAAM;CAExB,IAAI,gBAAgB,CAAC,SACnB,OAAO,WAAW,2BAA2B,0BAA0B,QAAQ,IAAI,WAAW;MACzF,IAAI,OAAO,SAAS,MAAM,UAC/B,OAAO,WACL,2BACA,6BAA6B,QAAQ,UACrC,OAAO,mBAAmB,CAC5B;CAEF,IAAI,OAAO,SAAS,MAAM,UACxB,eAAe,QAAQ,WAAW;MAElC,OAAO,mBAAmB;CAE5B,OAAO,OAAO,WAAW;AAC3B;AAEA,SAAgB,WAAW,QAAuC;CAChE,IAAI,CAAC,UAAU,QAAQ,OAAO,GAAG,OAAO,KAAA;CACxC,OAAO,WAAW,QAAQ,oBAAoB,MAAM,gBAAgB;AACtE;AAEA,SAAgB,UAAU,QAAuC;CAC/D,IAAI,CAAC,UAAU,QAAQ,MAAM,GAAG,OAAO,KAAA;CACvC,OAAO,WAAW,QAAQ,mBAAmB,MAAM,eAAe;AACpE;;;;;;;;;AAUA,SAAgB,kBAAkB,QAAuC;CACvE,IAAI,OAAO,SAAS,MAAM,SAAS,OAAO,KAAA;CAC1C,MAAM,UAAU,OAAO,UAAU,CAAC,CAAC;CACnC,IAAI,wBAAwB,IAAI,OAAO,GAAG,OAAO,KAAA;CACjD,MAAM,UAAU,OAAO,SAAS,CAAC,MAAM,WAAW,OAAO,SAAS,CAAC,MAAM;CACzE,OAAO,UAAU,yBAAyB;CAC1C,OAAO,KAAK;CACZ,IAAI,SACF,gBAAgB,MAAM;CAExB,IAAI,OAAO,SAAS,MAAM,UACxB,eAAe,QAAQ,mBAAmB;MACrC;EACL,OAAO,WACL,2BACA,6BAA6B,QAAQ,UACrC,OAAO,mBAAmB,CAC5B;EACA,OAAO,mBAAmB;CAC5B;CACA,OAAO,OAAO,WAAW;AAC3B;AAEA,SAAgB,eAAe,QAAuC;CACpE,IAAI,CAAC,UAAU,QAAQ,WAAW,GAAG,OAAO,KAAA;CAC5C,OAAO,WAAW,QAAQ,aAAa,OAAO,UAAU,iBAAiB,OAAO,IAAI,CAAC;AACvF;AAEA,SAAgB,mBAAmB,QAAuC;CACxE,IAAI,CAAC,UAAU,QAAQ,MAAM,GAAG,OAAO,KAAA;CACvC,OAAO,WAAW,QAAQ,4BAA4B,MAAM,gBAAgB;AAC9E;;AAGA,SAAgB,gBAAgB,QAAuC;CACrE,IAAI,CAAC,UAAU,QAAQ,OAAO,GAAG,OAAO,KAAA;CACxC,OAAO,WAAW,QAAQ,cAAc,OAAO,oBAAoB;AACrE;;;;;;;AAQA,SAAS,eAAe,QAAgB,aAAiC;CACvE,MAAM,YAAY,OAAO,KAAK;CAC9B,OAAO,KAAK;CACZ,SAAS;EACP,MAAM,OAAO,OAAO,SAAS;EAC7B,IAAI,SAAS,YAAY,SAAS,OAAO;EACzC,YAAY,MAAM;CACpB;CACA,IAAI,OAAO,SAAS,MAAM,UACxB,OAAO,KAAK;MAEZ,OAAO,WAAW,0BAA0B,kCAAkC,SAAS;AAE3F;AAEA,SAAS,yBAAyB,QAAsB;CACtD,MAAM,YAAY,OAAO,UAAU,CAAC,CAAC;CACrC,MAAM,UACJ,OAAO,SAAS,CAAC,MAAM,WACnB,gCAAgC,UAAU,KAC1C,sCAAsC,UAAU;CACtD,OAAO,WAAW,mCAAmC,SAAS,OAAO,KAAK,CAAC;CAC3E,OAAO,KAAK;CACZ,OAAO,mBAAmB;AAC5B;;;;;;;AAQA,SAAgB,oBAAoB,QAAuC;CACzE,IAAI,OAAO,SAAS,MAAM,YAAY,OAAO,KAAA;CAC7C,OAAO,eAAe,MAAM;AAC9B;AAEA,SAAS,iBAAiB,QAAsB;CAE9C,IAAI,EADS,oBAAoB,MAAM,KAAK,WAAW,MAAM,IAE3D,cACE,QACA,4BACA,qCAAqC,OAAO,UAAU,CAAC,CAAC,KAAK,EAC/D;AAEJ;AAEA,SAAS,gBAAgB,QAAsB;CAE7C,IAAI,EADS,oBAAoB,MAAM,KAAK,eAAe,MAAM,IAE/D,cACE,QACA,2BACA,mCAAmC,OAAO,UAAU,CAAC,CAAC,KAAK,EAC7D;AAEJ;AAEA,SAAS,qBAAqB,QAAsB;CAElD,IAAI,CADS,eAAe,MACpB,GACN,cACE,QACA,4BACA,8BAA8B,OAAO,UAAU,CAAC,CAAC,KAAK,EACxD;AAEJ;AAEA,SAAS,oBAAoB,QAAsB;CAEjD,IAAI,CADS,cAAc,MACnB,GACN,cAAc,QAAQ,sCAAsC,qBAAqB;AAErF;AAEA,SAAS,cAAc,QAAgB,MAAyB,SAAuB;CACrF,OAAO,WAAW,MAAM,SAAS,OAAO,KAAK,CAAC;CAC9C,OAAO,KAAK;CACZ,OAAO,mBAAmB;AAC5B;AAEA,SAAgB,WAAW,QAAuC;CAChE,IAAI,OAAO,SAAS,MAAM,SAAS,OAAO,KAAA;CAC1C,OAAO,UAAU,kBAAkB;CACnC,gBAAgB,MAAM;CACtB,oBAAoB,MAAM;CAC1B,OAAO,OAAO,SAAS,MAAM,MAC3B,eAAe,MAAM;CAEvB,OAAO,OAAO,WAAW;AAC3B;AAEA,SAAgB,eAAe,QAAuC;CACpE,IAAI,OAAO,SAAS,MAAM,SAAS,OAAO,KAAA;CAC1C,OAAO,UAAU,sBAAsB;CACvC,gBAAgB,MAAM;CACtB,OAAO,OAAO,SAAS,MAAM,MAC3B,eAAe,MAAM;CAEvB,OAAO,OAAO,WAAW;AAC3B;AAEA,SAAgB,eAAe,QAAuC;CACpE,IAAI,OAAO,SAAS,MAAM,SAAS,OAAO,KAAA;CAC1C,OAAO,UAAU,sBAAsB;CACvC,MAAM,WAAW,OAAO,KAAK;CAC7B,MAAM,WAAW,OAAO,UAAU,CAAC,CAAC;CACpC,gBAAgB,MAAM;CACtB,IAAI,OAAO,SAAS,MAAM,UACxB,OAAO,KAAK;MAEZ,OAAO,WAAW,4BAA4B,uBAAuB,SAAS,IAAI,QAAQ;CAE5F,oBAAoB,MAAM;CAC1B,OAAO,OAAO,SAAS,MAAM,MAC3B,eAAe,MAAM;CAEvB,OAAO,OAAO,WAAW;AAC3B;AAEA,SAAgB,cAAc,QAAuC;CACnE,IAAI,OAAO,SAAS,MAAM,SAAS,OAAO,KAAA;CAC1C,OAAO,UAAU,cAAc;CAC/B,MAAM,UAAU,OAAO,KAAK;CAC5B,MAAM,UAAU,OAAO,UAAU,CAAC,CAAC;CACnC,gBAAgB,MAAM;CACtB,IAAI,OAAO,SAAS,MAAM,UACxB,OAAO,KAAK;MAEZ,OAAO,WACL,sCACA,uBAAuB,QAAQ,IAC/B,OACF;CAEF,gBAAgB,MAAM;CACtB,OAAO,OAAO,WAAW;AAC3B"}

package/dist/tokenizer-DdaOstnz.mjs

@@ -0,0 +1,233 @@
+//#region src/tokenizer.ts
+var Tokenizer = class {
+	#source;
+	#pos;
+	#buffer;
+	constructor(source) {
+		this.#source = source;
+		this.#pos = 0;
+		this.#buffer = [];
+	}
+	next() {
+		const next = this.#buffer.shift();
+		if (next) return next;
+		return this.#scanNext();
+	}
+	peek(offset = 0) {
+		if (offset > this.#buffer.length) {
+			const last = this.#buffer.at(-1);
+			if (last?.kind === "Eof") return last;
+		}
+		const token = this.#buffer[offset];
+		if (token) return token;
+		while (this.#buffer.length <= offset) {
+			const token = this.#scanNext();
+			if (token.kind === "Eof") return token;
+			this.#buffer.push(token);
+		}
+		return this.#buffer[offset];
+	}
+	#scanNext() {
+		const token = scan(this.#source, this.#pos);
+		this.#pos += token.text.length;
+		return token;
+	}
+};
+function scan(source, pos) {
+	if (pos >= source.length) return {
+		kind: "Eof",
+		text: ""
+	};
+	return scanNewline(source, pos) ?? scanWhitespace(source, pos) ?? scanComment(source, pos) ?? scanAt(source, pos) ?? scanKeywordNumber(source, pos) ?? scanIdent(source, pos) ?? scanNumber(source, pos) ?? scanString(source, pos) ?? scanPunctuation(source, pos) ?? {
+		kind: "Invalid",
+		text: readChar(source, pos)
+	};
+}
+function scanNewline(source, pos) {
+	const ch = source.charAt(pos);
+	if (ch !== "\r" && ch !== "\n") return void 0;
+	if (ch === "\r" && source.charAt(pos + 1) === "\n") return {
+		kind: "Newline",
+		text: "\r\n"
+	};
+	return {
+		kind: "Newline",
+		text: ch
+	};
+}
+function scanWhitespace(source, pos) {
+	const ch = source.charAt(pos);
+	if (ch !== " " && ch !== "	") return void 0;
+	let end = pos + 1;
+	while (end < source.length) {
+		const c = source.charAt(end);
+		if (c !== " " && c !== "	") break;
+		end++;
+	}
+	return {
+		kind: "Whitespace",
+		text: source.slice(pos, end)
+	};
+}
+function scanComment(source, pos) {
+	if (source.charAt(pos) !== "/" || source.charAt(pos + 1) !== "/") return void 0;
+	let end = pos + 2;
+	while (end < source.length) {
+		const c = source.charAt(end);
+		if (c === "\n" || c === "\r") break;
+		end++;
+	}
+	return {
+		kind: "Comment",
+		text: source.slice(pos, end)
+	};
+}
+function scanAt(source, pos) {
+	if (source.charAt(pos) !== "@") return void 0;
+	if (source.charAt(pos + 1) === "@") return {
+		kind: "DoubleAt",
+		text: "@@"
+	};
+	return {
+		kind: "At",
+		text: "@"
+	};
+}
+function scanIdent(source, pos) {
+	const ch = readChar(source, pos);
+	if (!isIdentStart(ch)) return void 0;
+	let end = pos + ch.length;
+	while (end < source.length) {
+		const c = readChar(source, end);
+		if (isIdentPart(c)) end += c.length;
+		else break;
+	}
+	return {
+		kind: "Ident",
+		text: source.slice(pos, end)
+	};
+}
+const KEYWORD_NUMBERS = [
+	"-Infinity",
+	"Infinity",
+	"NaN"
+];
+function scanKeywordNumber(source, pos) {
+	for (const word of KEYWORD_NUMBERS) {
+		if (!source.startsWith(word, pos)) continue;
+		const after = readChar(source, pos + word.length);
+		if (after !== "" && isIdentPart(after)) return void 0;
+		return {
+			kind: "NumberLiteral",
+			text: word
+		};
+	}
+}
+function scanNumber(source, pos) {
+	let end = pos;
+	if (source.charAt(end) === "-") {
+		if (end + 1 >= source.length || !isDigit(source.charAt(end + 1))) return void 0;
+		end++;
+	} else if (!isDigit(source.charAt(end))) return;
+	end++;
+	while (end < source.length && isDigit(source.charAt(end))) end++;
+	if (source.charAt(end) === "." && end + 1 < source.length && isDigit(source.charAt(end + 1))) {
+		end++;
+		while (end < source.length && isDigit(source.charAt(end))) end++;
+	}
+	return {
+		kind: "NumberLiteral",
+		text: source.slice(pos, end)
+	};
+}
+function scanString(source, pos) {
+	if (source.charAt(pos) !== "\"") return void 0;
+	let end = pos + 1;
+	while (end < source.length) {
+		const c = source.charAt(end);
+		if (c === "\\" && end + 1 < source.length) {
+			end += 2;
+			continue;
+		}
+		if (c === "\"") {
+			end++;
+			return {
+				kind: "StringLiteral",
+				text: source.slice(pos, end)
+			};
+		}
+		if (c === "\n" || c === "\r") return {
+			kind: "StringLiteral",
+			text: source.slice(pos, end)
+		};
+		end++;
+	}
+	return {
+		kind: "StringLiteral",
+		text: source.slice(pos, end)
+	};
+}
+/**
+* Whether a `StringLiteral` token's text is properly closed. `scanString` emits
+* the same `StringLiteral` kind for both well-formed and unterminated strings —
+* it stops at a newline or EOF when no closing quote is found — so callers that
+* need to distinguish the two ask here.
+*
+* Because `scanString` stops at the *first* unescaped `"`, the only quote whose
+* escaping can be in question is the **last character**: the text is terminated
+* iff it opens with `"`, ends with `"`, and that closing `"` is not escaped.
+* Under the `\\`-escapes-the-next-character rule, a `"` is unescaped iff an
+* **even** number of backslashes immediately precede it — each `\\` pair cancels,
+* and an odd run leaves the final `\` escaping the quote. So it suffices to
+* count the trailing backslash run; no full re-scan is needed:
+*
+* - `"ok"`  → 0 backslashes (even) → closing quote stands → terminated
+* - `"a\"`  → 1 backslash  (odd)   → the `"` is escaped     → unterminated
+* - `"a\\"` → 2 backslashes (even) → escaped `\`, real `"`  → terminated
+*
+* A lone `"` (length 1) or a text with no closing `"` is unterminated.
+*/
+function isTerminatedStringLiteral(text) {
+	if (text.length < 2 || text.charAt(0) !== "\"" || text.charAt(text.length - 1) !== "\"") return false;
+	let backslashes = 0;
+	for (let i = text.length - 2; i >= 1 && text.charAt(i) === "\\"; i--) backslashes++;
+	return backslashes % 2 === 0;
+}
+function scanPunctuation(source, pos) {
+	const kind = PUNCTUATION[source.charAt(pos)];
+	if (kind === void 0) return void 0;
+	return {
+		kind,
+		text: source.charAt(pos)
+	};
+}
+function readChar(source, pos) {
+	const cp = source.codePointAt(pos);
+	return cp !== void 0 ? String.fromCodePoint(cp) : "";
+}
+function isIdentStart(ch) {
+	return /\p{L}/u.test(ch) || ch === "_";
+}
+function isIdentPart(ch) {
+	return isIdentStart(ch) || isDigit(ch) || ch === "-";
+}
+function isDigit(ch) {
+	return ch >= "0" && ch <= "9";
+}
+const PUNCTUATION = {
+	"{": "LBrace",
+	"}": "RBrace",
+	"(": "LParen",
+	")": "RParen",
+	"[": "LBracket",
+	"]": "RBracket",
+	"=": "Equals",
+	"?": "Question",
+	".": "Dot",
+	",": "Comma",
+	":": "Colon"
+};
+//#endregion
+export { isTerminatedStringLiteral as n, Tokenizer as t };
+
+//# sourceMappingURL=tokenizer-DdaOstnz.mjs.map

package/dist/tokenizer-DdaOstnz.mjs.map

@@ -0,0 +1 @@
+{"version":3,"file":"tokenizer-DdaOstnz.mjs","names":["#source","#buffer","#pos","#scanNext"],"sources":["../src/tokenizer.ts"],"sourcesContent":["export type TokenKind =\n  | 'Ident'\n  | 'StringLiteral'\n  | 'NumberLiteral'\n  | 'At'\n  | 'DoubleAt'\n  | 'LBrace'\n  | 'RBrace'\n  | 'LParen'\n  | 'RParen'\n  | 'LBracket'\n  | 'RBracket'\n  | 'Equals'\n  | 'Question'\n  | 'Dot'\n  | 'Comma'\n  | 'Colon'\n  | 'Whitespace'\n  | 'Newline'\n  | 'Comment'\n  | 'Invalid'\n  | 'Eof';\n\nexport interface Token {\n  readonly kind: TokenKind;\n  readonly text: string;\n}\n\nexport class Tokenizer {\n  readonly #source: string;\n  #pos: number;\n  readonly #buffer: Token[];\n\n  constructor(source: string) {\n    this.#source = source;\n    this.#pos = 0;\n    this.#buffer = [];\n  }\n\n  next(): Token {\n    const next = this.#buffer.shift();\n    if (next) {\n      return next;\n    }\n    return this.#scanNext();\n  }\n\n  peek(offset = 0): Token {\n    if (offset > this.#buffer.length) {\n      const last = this.#buffer.at(-1);\n      if (last?.kind === 'Eof') {\n        return last;\n      }\n    }\n\n    const token = this.#buffer[offset];\n    if (token) {\n      return token;\n    }\n\n    while (this.#buffer.length <= offset) {\n      const token = this.#scanNext();\n      if (token.kind === 'Eof') {\n        return token;\n      }\n      this.#buffer.push(token);\n    }\n\n    return this.#buffer[offset] as Token;\n  }\n\n  #scanNext(): Token {\n    const token = scan(this.#source, this.#pos);\n    this.#pos += token.text.length;\n    return token;\n  }\n}\n\nfunction scan(source: string, pos: number): Token {\n  if (pos >= source.length) {\n    return { kind: 'Eof', text: '' };\n  }\n\n  return (\n    scanNewline(source, pos) ??\n    scanWhitespace(source, pos) ??\n    scanComment(source, pos) ??\n    scanAt(source, pos) ??\n    scanKeywordNumber(source, pos) ??\n    scanIdent(source, pos) ??\n    scanNumber(source, pos) ??\n    scanString(source, pos) ??\n    scanPunctuation(source, pos) ?? {\n      kind: 'Invalid' as const,\n      text: readChar(source, pos),\n    }\n  );\n}\n\nfunction scanNewline(source: string, pos: number): Token | undefined {\n  const ch = source.charAt(pos);\n  if (ch !== '\\r' && ch !== '\\n') return undefined;\n  if (ch === '\\r' && source.charAt(pos + 1) === '\\n') {\n    return { kind: 'Newline', text: '\\r\\n' };\n  }\n  return { kind: 'Newline', text: ch };\n}\n\nfunction scanWhitespace(source: string, pos: number): Token | undefined {\n  const ch = source.charAt(pos);\n  if (ch !== ' ' && ch !== '\\t') return undefined;\n  let end = pos + 1;\n  while (end < source.length) {\n    const c = source.charAt(end);\n    if (c !== ' ' && c !== '\\t') break;\n    end++;\n  }\n  return { kind: 'Whitespace', text: source.slice(pos, end) };\n}\n\nfunction scanComment(source: string, pos: number): Token | undefined {\n  if (source.charAt(pos) !== '/' || source.charAt(pos + 1) !== '/') return undefined;\n  let end = pos + 2;\n  while (end < source.length) {\n    const c = source.charAt(end);\n    if (c === '\\n' || c === '\\r') break;\n    end++;\n  }\n  return { kind: 'Comment', text: source.slice(pos, end) };\n}\n\nfunction scanAt(source: string, pos: number): Token | undefined {\n  if (source.charAt(pos) !== '@') return undefined;\n  if (source.charAt(pos + 1) === '@') {\n    return { kind: 'DoubleAt', text: '@@' };\n  }\n  return { kind: 'At', text: '@' };\n}\n\nfunction scanIdent(source: string, pos: number): Token | undefined {\n  const ch = readChar(source, pos);\n  if (!isIdentStart(ch)) return undefined;\n  let end = pos + ch.length;\n  while (end < source.length) {\n    const c = readChar(source, end);\n    if (isIdentPart(c)) {\n      end += c.length;\n    } else {\n      break;\n    }\n  }\n  return { kind: 'Ident', text: source.slice(pos, end) };\n}\n\nconst KEYWORD_NUMBERS = ['-Infinity', 'Infinity', 'NaN'] as const;\n\n// `NaN`, `Infinity`, and `-Infinity` are numeric literals, not identifiers.\n// They must match before `scanIdent` (which would otherwise claim the\n// identifier-led words) and are word-bounded: a following identifier-part char\n// (so `Infinityx` / `NaNxyz`) keeps the run an `Ident` rather than a number.\nfunction scanKeywordNumber(source: string, pos: number): Token | undefined {\n  for (const word of KEYWORD_NUMBERS) {\n    if (!source.startsWith(word, pos)) continue;\n    const after = readChar(source, pos + word.length);\n    if (after !== '' && isIdentPart(after)) return undefined;\n    return { kind: 'NumberLiteral', text: word };\n  }\n  return undefined;\n}\n\nfunction scanNumber(source: string, pos: number): Token | undefined {\n  let end = pos;\n  if (source.charAt(end) === '-') {\n    if (end + 1 >= source.length || !isDigit(source.charAt(end + 1))) return undefined;\n    end++;\n  } else if (!isDigit(source.charAt(end))) {\n    return undefined;\n  }\n  end++;\n  while (end < source.length && isDigit(source.charAt(end))) {\n    end++;\n  }\n  if (source.charAt(end) === '.' && end + 1 < source.length && isDigit(source.charAt(end + 1))) {\n    end++; // consume the dot\n    while (end < source.length && isDigit(source.charAt(end))) {\n      end++;\n    }\n  }\n  return { kind: 'NumberLiteral', text: source.slice(pos, end) };\n}\n\nfunction scanString(source: string, pos: number): Token | undefined {\n  if (source.charAt(pos) !== '\"') return undefined;\n  let end = pos + 1;\n  while (end < source.length) {\n    const c = source.charAt(end);\n    if (c === '\\\\' && end + 1 < source.length) {\n      end += 2; // skip escape sequence\n      continue;\n    }\n    if (c === '\"') {\n      end++; // include closing quote\n      return { kind: 'StringLiteral', text: source.slice(pos, end) };\n    }\n    if (c === '\\n' || c === '\\r') {\n      // Unterminated: stop before newline\n      return { kind: 'StringLiteral', text: source.slice(pos, end) };\n    }\n    end++;\n  }\n  // Unterminated at EOF\n  return { kind: 'StringLiteral', text: source.slice(pos, end) };\n}\n\n/**\n * Whether a `StringLiteral` token's text is properly closed. `scanString` emits\n * the same `StringLiteral` kind for both well-formed and unterminated strings —\n * it stops at a newline or EOF when no closing quote is found — so callers that\n * need to distinguish the two ask here.\n *\n * Because `scanString` stops at the *first* unescaped `\"`, the only quote whose\n * escaping can be in question is the **last character**: the text is terminated\n * iff it opens with `\"`, ends with `\"`, and that closing `\"` is not escaped.\n * Under the `\\\\`-escapes-the-next-character rule, a `\"` is unescaped iff an\n * **even** number of backslashes immediately precede it — each `\\\\` pair cancels,\n * and an odd run leaves the final `\\` escaping the quote. So it suffices to\n * count the trailing backslash run; no full re-scan is needed:\n *\n * - `\"ok\"`  → 0 backslashes (even) → closing quote stands → terminated\n * - `\"a\\\"`  → 1 backslash  (odd)   → the `\"` is escaped     → unterminated\n * - `\"a\\\\\"` → 2 backslashes (even) → escaped `\\`, real `\"`  → terminated\n *\n * A lone `\"` (length 1) or a text with no closing `\"` is unterminated.\n */\nexport function isTerminatedStringLiteral(text: string): boolean {\n  if (text.length < 2 || text.charAt(0) !== '\"' || text.charAt(text.length - 1) !== '\"') {\n    return false;\n  }\n  let backslashes = 0;\n  for (let i = text.length - 2; i >= 1 && text.charAt(i) === '\\\\'; i--) {\n    backslashes++;\n  }\n  return backslashes % 2 === 0;\n}\n\nfunction scanPunctuation(source: string, pos: number): Token | undefined {\n  const kind = PUNCTUATION[source.charAt(pos)];\n  if (kind === undefined) return undefined;\n  return { kind, text: source.charAt(pos) };\n}\n\nfunction readChar(source: string, pos: number): string {\n  const cp = source.codePointAt(pos);\n  return cp !== undefined ? String.fromCodePoint(cp) : '';\n}\n\nfunction isIdentStart(ch: string): boolean {\n  return /\\p{L}/u.test(ch) || ch === '_';\n}\n\nfunction isIdentPart(ch: string): boolean {\n  return isIdentStart(ch) || isDigit(ch) || ch === '-';\n}\n\nfunction isDigit(ch: string): boolean {\n  return ch >= '0' && ch <= '9';\n}\n\nconst PUNCTUATION: Record<string, TokenKind> = {\n  '{': 'LBrace',\n  '}': 'RBrace',\n  '(': 'LParen',\n  ')': 'RParen',\n  '[': 'LBracket',\n  ']': 'RBracket',\n  '=': 'Equals',\n  '?': 'Question',\n  '.': 'Dot',\n  ',': 'Comma',\n  ':': 'Colon',\n};\n"],"mappings":";AA4BA,IAAa,YAAb,MAAuB;CACrB;CACA;CACA;CAEA,YAAY,QAAgB;EAC1B,KAAKA,UAAU;EACf,KAAKE,OAAO;EACZ,KAAKD,UAAU,CAAC;CAClB;CAEA,OAAc;EACZ,MAAM,OAAO,KAAKA,QAAQ,MAAM;EAChC,IAAI,MACF,OAAO;EAET,OAAO,KAAKE,UAAU;CACxB;CAEA,KAAK,SAAS,GAAU;EACtB,IAAI,SAAS,KAAKF,QAAQ,QAAQ;GAChC,MAAM,OAAO,KAAKA,QAAQ,GAAG,EAAE;GAC/B,IAAI,MAAM,SAAS,OACjB,OAAO;EAEX;EAEA,MAAM,QAAQ,KAAKA,QAAQ;EAC3B,IAAI,OACF,OAAO;EAGT,OAAO,KAAKA,QAAQ,UAAU,QAAQ;GACpC,MAAM,QAAQ,KAAKE,UAAU;GAC7B,IAAI,MAAM,SAAS,OACjB,OAAO;GAET,KAAKF,QAAQ,KAAK,KAAK;EACzB;EAEA,OAAO,KAAKA,QAAQ;CACtB;CAEA,YAAmB;EACjB,MAAM,QAAQ,KAAK,KAAKD,SAAS,KAAKE,IAAI;EAC1C,KAAKA,QAAQ,MAAM,KAAK;EACxB,OAAO;CACT;AACF;AAEA,SAAS,KAAK,QAAgB,KAAoB;CAChD,IAAI,OAAO,OAAO,QAChB,OAAO;EAAE,MAAM;EAAO,MAAM;CAAG;CAGjC,OACE,YAAY,QAAQ,GAAG,KACvB,eAAe,QAAQ,GAAG,KAC1B,YAAY,QAAQ,GAAG,KACvB,OAAO,QAAQ,GAAG,KAClB,kBAAkB,QAAQ,GAAG,KAC7B,UAAU,QAAQ,GAAG,KACrB,WAAW,QAAQ,GAAG,KACtB,WAAW,QAAQ,GAAG,KACtB,gBAAgB,QAAQ,GAAG,KAAK;EAC9B,MAAM;EACN,MAAM,SAAS,QAAQ,GAAG;CAC5B;AAEJ;AAEA,SAAS,YAAY,QAAgB,KAAgC;CACnE,MAAM,KAAK,OAAO,OAAO,GAAG;CAC5B,IAAI,OAAO,QAAQ,OAAO,MAAM,OAAO,KAAA;CACvC,IAAI,OAAO,QAAQ,OAAO,OAAO,MAAM,CAAC,MAAM,MAC5C,OAAO;EAAE,MAAM;EAAW,MAAM;CAAO;CAEzC,OAAO;EAAE,MAAM;EAAW,MAAM;CAAG;AACrC;AAEA,SAAS,eAAe,QAAgB,KAAgC;CACtE,MAAM,KAAK,OAAO,OAAO,GAAG;CAC5B,IAAI,OAAO,OAAO,OAAO,KAAM,OAAO,KAAA;CACtC,IAAI,MAAM,MAAM;CAChB,OAAO,MAAM,OAAO,QAAQ;EAC1B,MAAM,IAAI,OAAO,OAAO,GAAG;EAC3B,IAAI,MAAM,OAAO,MAAM,KAAM;EAC7B;CACF;CACA,OAAO;EAAE,MAAM;EAAc,MAAM,OAAO,MAAM,KAAK,GAAG;CAAE;AAC5D;AAEA,SAAS,YAAY,QAAgB,KAAgC;CACnE,IAAI,OAAO,OAAO,GAAG,MAAM,OAAO,OAAO,OAAO,MAAM,CAAC,MAAM,KAAK,OAAO,KAAA;CACzE,IAAI,MAAM,MAAM;CAChB,OAAO,MAAM,OAAO,QAAQ;EAC1B,MAAM,IAAI,OAAO,OAAO,GAAG;EAC3B,IAAI,MAAM,QAAQ,MAAM,MAAM;EAC9B;CACF;CACA,OAAO;EAAE,MAAM;EAAW,MAAM,OAAO,MAAM,KAAK,GAAG;CAAE;AACzD;AAEA,SAAS,OAAO,QAAgB,KAAgC;CAC9D,IAAI,OAAO,OAAO,GAAG,MAAM,KAAK,OAAO,KAAA;CACvC,IAAI,OAAO,OAAO,MAAM,CAAC,MAAM,KAC7B,OAAO;EAAE,MAAM;EAAY,MAAM;CAAK;CAExC,OAAO;EAAE,MAAM;EAAM,MAAM;CAAI;AACjC;AAEA,SAAS,UAAU,QAAgB,KAAgC;CACjE,MAAM,KAAK,SAAS,QAAQ,GAAG;CAC/B,IAAI,CAAC,aAAa,EAAE,GAAG,OAAO,KAAA;CAC9B,IAAI,MAAM,MAAM,GAAG;CACnB,OAAO,MAAM,OAAO,QAAQ;EAC1B,MAAM,IAAI,SAAS,QAAQ,GAAG;EAC9B,IAAI,YAAY,CAAC,GACf,OAAO,EAAE;OAET;CAEJ;CACA,OAAO;EAAE,MAAM;EAAS,MAAM,OAAO,MAAM,KAAK,GAAG;CAAE;AACvD;AAEA,MAAM,kBAAkB;CAAC;CAAa;CAAY;AAAK;AAMvD,SAAS,kBAAkB,QAAgB,KAAgC;CACzE,KAAK,MAAM,QAAQ,iBAAiB;EAClC,IAAI,CAAC,OAAO,WAAW,MAAM,GAAG,GAAG;EACnC,MAAM,QAAQ,SAAS,QAAQ,MAAM,KAAK,MAAM;EAChD,IAAI,UAAU,MAAM,YAAY,KAAK,GAAG,OAAO,KAAA;EAC/C,OAAO;GAAE,MAAM;GAAiB,MAAM;EAAK;CAC7C;AAEF;AAEA,SAAS,WAAW,QAAgB,KAAgC;CAClE,IAAI,MAAM;CACV,IAAI,OAAO,OAAO,GAAG,MAAM,KAAK;EAC9B,IAAI,MAAM,KAAK,OAAO,UAAU,CAAC,QAAQ,OAAO,OAAO,MAAM,CAAC,CAAC,GAAG,OAAO,KAAA;EACzE;CACF,OAAO,IAAI,CAAC,QAAQ,OAAO,OAAO,GAAG,CAAC,GACpC;CAEF;CACA,OAAO,MAAM,OAAO,UAAU,QAAQ,OAAO,OAAO,GAAG,CAAC,GACtD;CAEF,IAAI,OAAO,OAAO,GAAG,MAAM,OAAO,MAAM,IAAI,OAAO,UAAU,QAAQ,OAAO,OAAO,MAAM,CAAC,CAAC,GAAG;EAC5F;EACA,OAAO,MAAM,OAAO,UAAU,QAAQ,OAAO,OAAO,GAAG,CAAC,GACtD;CAEJ;CACA,OAAO;EAAE,MAAM;EAAiB,MAAM,OAAO,MAAM,KAAK,GAAG;CAAE;AAC/D;AAEA,SAAS,WAAW,QAAgB,KAAgC;CAClE,IAAI,OAAO,OAAO,GAAG,MAAM,MAAK,OAAO,KAAA;CACvC,IAAI,MAAM,MAAM;CAChB,OAAO,MAAM,OAAO,QAAQ;EAC1B,MAAM,IAAI,OAAO,OAAO,GAAG;EAC3B,IAAI,MAAM,QAAQ,MAAM,IAAI,OAAO,QAAQ;GACzC,OAAO;GACP;EACF;EACA,IAAI,MAAM,MAAK;GACb;GACA,OAAO;IAAE,MAAM;IAAiB,MAAM,OAAO,MAAM,KAAK,GAAG;GAAE;EAC/D;EACA,IAAI,MAAM,QAAQ,MAAM,MAEtB,OAAO;GAAE,MAAM;GAAiB,MAAM,OAAO,MAAM,KAAK,GAAG;EAAE;EAE/D;CACF;CAEA,OAAO;EAAE,MAAM;EAAiB,MAAM,OAAO,MAAM,KAAK,GAAG;CAAE;AAC/D;;;;;;;;;;;;;;;;;;;;;AAsBA,SAAgB,0BAA0B,MAAuB;CAC/D,IAAI,KAAK,SAAS,KAAK,KAAK,OAAO,CAAC,MAAM,QAAO,KAAK,OAAO,KAAK,SAAS,CAAC,MAAM,MAChF,OAAO;CAET,IAAI,cAAc;CAClB,KAAK,IAAI,IAAI,KAAK,SAAS,GAAG,KAAK,KAAK,KAAK,OAAO,CAAC,MAAM,MAAM,KAC/D;CAEF,OAAO,cAAc,MAAM;AAC7B;AAEA,SAAS,gBAAgB,QAAgB,KAAgC;CACvE,MAAM,OAAO,YAAY,OAAO,OAAO,GAAG;CAC1C,IAAI,SAAS,KAAA,GAAW,OAAO,KAAA;CAC/B,OAAO;EAAE;EAAM,MAAM,OAAO,OAAO,GAAG;CAAE;AAC1C;AAEA,SAAS,SAAS,QAAgB,KAAqB;CACrD,MAAM,KAAK,OAAO,YAAY,GAAG;CACjC,OAAO,OAAO,KAAA,IAAY,OAAO,cAAc,EAAE,IAAI;AACvD;AAEA,SAAS,aAAa,IAAqB;CACzC,OAAO,SAAS,KAAK,EAAE,KAAK,OAAO;AACrC;AAEA,SAAS,YAAY,IAAqB;CACxC,OAAO,aAAa,EAAE,KAAK,QAAQ,EAAE,KAAK,OAAO;AACnD;AAEA,SAAS,QAAQ,IAAqB;CACpC,OAAO,MAAM,OAAO,MAAM;AAC5B;AAEA,MAAM,cAAyC;CAC7C,KAAK;CACL,KAAK;CACL,KAAK;CACL,KAAK;CACL,KAAK;CACL,KAAK;CACL,KAAK;CACL,KAAK;CACL,KAAK;CACL,KAAK;CACL,KAAK;AACP"}