@step-forge/step-forge 0.0.14 → 0.0.16

package/dist/analyzer-QH03uejK.js.map

@@ -1 +1 @@
-{"version":3,"file":"analyzer-QH03uejK.js","names":[],"sources":["../../src/analyzer/stepExtractor.ts","../../src/analyzer/gherkinParser.ts","../../src/analyzer/stepMatcher.ts","../../src/analyzer/rules/ambiguousStepRule.ts","../../src/analyzer/rules/dependencyRule.ts","../../src/analyzer/rules/undefinedStepRule.ts","../../src/analyzer/rules/index.ts","../../src/analyzer/index.ts"],"sourcesContent":["import ts from \"typescript\";\nimport { StepDefinitionMeta } from \"./types.js\";\n\ntype StepType = \"given\" | \"when\" | \"then\";\n\nconst BUILDER_NAMES: Record<string, StepType> = {\n  givenBuilder: \"given\",\n  whenBuilder: \"when\",\n  thenBuilder: \"then\",\n};\n\nexport function extractStepDefinitions(\n  filePaths: string[],\n  tsConfigPath?: string\n): StepDefinitionMeta[] {\n  const configPath =\n    tsConfigPath ?? ts.findConfigFile(process.cwd(), ts.sys.fileExists);\n  let compilerOptions: ts.CompilerOptions = {\n    target: ts.ScriptTarget.ESNext,\n    module: ts.ModuleKind.ESNext,\n    moduleResolution: ts.ModuleResolutionKind.Node10,\n    strict: true,\n    esModuleInterop: true,\n  };\n\n  if (configPath) {\n    const configFile = ts.readConfigFile(configPath, ts.sys.readFile);\n    if (!configFile.error) {\n      const parsed = ts.parseJsonConfigFileContent(\n        configFile.config,\n        ts.sys,\n        configPath.replace(/[/\\\\][^/\\\\]+$/, \"\")\n      );\n      compilerOptions = parsed.options;\n    }\n  }\n\n  // Ensure noEmit so we don't write files\n  compilerOptions.noEmit = true;\n\n  const program = ts.createProgram(filePaths, compilerOptions);\n  const checker = program.getTypeChecker();\n  const results: StepDefinitionMeta[] = [];\n\n  for (const filePath of filePaths) {\n    const sourceFile = program.getSourceFile(filePath);\n    if (!sourceFile) continue;\n    const fileResults = extractFromSourceFile(sourceFile, checker);\n    results.push(...fileResults);\n  }\n\n  return results;\n}\n\nfunction extractFromSourceFile(\n  sourceFile: ts.SourceFile,\n  checker: ts.TypeChecker\n): StepDefinitionMeta[] {\n  const results: StepDefinitionMeta[] = [];\n\n  function visit(node: ts.Node) {\n    // Look for .register() call expressions\n    if (\n      ts.isCallExpression(node) &&\n      ts.isPropertyAccessExpression(node.expression) &&\n      node.expression.name.text === \"register\"\n    ) {\n      const meta = extractFromRegisterCall(node, sourceFile, checker);\n      if (meta) {\n        results.push(meta);\n      }\n    }\n    ts.forEachChild(node, visit);\n  }\n\n  visit(sourceFile);\n  return results;\n}\n\nfunction extractFromRegisterCall(\n  registerCall: ts.CallExpression,\n  sourceFile: ts.SourceFile,\n  checker: ts.TypeChecker\n): StepDefinitionMeta | null {\n  // Walk backwards through the method chain to find all parts\n  // Pattern: builder().statement(...).dependencies?(...).step(...).register()\n  // Or: Variable(\"...\").dependencies?(...).step(...).register()\n\n  const chain = collectCallChain(registerCall);\n\n  let stepType: StepType | null = null;\n  let expression: string | null = null;\n  let dependencies: StepDefinitionMeta[\"dependencies\"] = {\n    given: {},\n    when: {},\n    then: {},\n  };\n  let produces: string[] = [];\n\n  for (const link of chain) {\n    const name = getCallName(link);\n    if (!name) continue;\n\n    if (name === \"register\") {\n      // Already at register, continue\n      continue;\n    }\n\n    if (name === \"step\") {\n      produces = extractProducedKeys(link, checker);\n      continue;\n    }\n\n    if (name === \"dependencies\") {\n      dependencies = extractDependencies(link);\n      continue;\n    }\n\n    if (name === \"statement\") {\n      expression = extractExpression(link);\n      // Try to find the builder type by continuing up the chain\n      continue;\n    }\n\n    // Check if this is a builder call like givenBuilder()\n    if (BUILDER_NAMES[name]) {\n      stepType = BUILDER_NAMES[name];\n      continue;\n    }\n  }\n\n  // If we didn't find the builder or expression in the chain, try the \"re-exported\" pattern:\n  // const Given = givenBuilder<T>().statement;\n  // Given(\"foo\").step(...).register()\n  if (!stepType || !expression) {\n    const reExport = resolveReExportedCall(chain, checker);\n    if (reExport) {\n      if (!stepType) stepType = reExport.stepType;\n      if (!expression) expression = reExport.expression;\n    }\n  }\n\n  if (!stepType || !expression) {\n    return null;\n  }\n\n  const line =\n    sourceFile.getLineAndCharacterOfPosition(registerCall.getStart()).line + 1;\n\n  return {\n    stepType,\n    expression,\n    dependencies,\n    produces,\n    sourceFile: sourceFile.fileName,\n    line,\n  };\n}\n\n/**\n * Collect all call expressions in the method chain, from register() back to the origin.\n */\nfunction collectCallChain(call: ts.CallExpression): ts.CallExpression[] {\n  const chain: ts.CallExpression[] = [call];\n  let current: ts.Expression = call.expression;\n\n  while (true) {\n    // Walk through PropertyAccessExpression to find the next call\n    if (ts.isPropertyAccessExpression(current)) {\n      current = current.expression;\n    }\n\n    if (ts.isCallExpression(current)) {\n      chain.push(current);\n      current = current.expression;\n    } else {\n      break;\n    }\n  }\n\n  return chain;\n}\n\nfunction getCallName(call: ts.CallExpression): string | null {\n  const expr = call.expression;\n\n  // .method() pattern\n  if (ts.isPropertyAccessExpression(expr)) {\n    return expr.name.text;\n  }\n\n  // direct call: functionName()\n  if (ts.isIdentifier(expr)) {\n    return expr.text;\n  }\n\n  return null;\n}\n\nfunction extractExpression(statementCall: ts.CallExpression): string | null {\n  const arg = statementCall.arguments[0];\n  if (!arg) return null;\n\n  // String literal: .statement(\"a user\")\n  if (ts.isStringLiteral(arg)) {\n    return arg.text;\n  }\n\n  // Arrow function with template literal: .statement((name: string) => `a user named ${name}`)\n  if (ts.isArrowFunction(arg)) {\n    return extractExpressionFromArrowFunction(arg);\n  }\n\n  return null;\n}\n\nfunction extractExpressionFromArrowFunction(\n  fn: ts.ArrowFunction\n): string | null {\n  const params = fn.parameters.map((p) => p.name.getText());\n\n  // The body should be a template expression or string literal\n  let body = fn.body;\n\n  // If wrapped in a block with a return, unwrap\n  if (ts.isBlock(body)) {\n    const returnStmt = body.statements.find(ts.isReturnStatement);\n    if (returnStmt?.expression) {\n      body = returnStmt.expression;\n    } else {\n      return null;\n    }\n  }\n\n  if (ts.isTemplateExpression(body)) {\n    return reconstructExpressionFromTemplate(body, params);\n  }\n\n  if (ts.isNoSubstitutionTemplateLiteral(body)) {\n    return body.text;\n  }\n\n  return null;\n}\n\nfunction reconstructExpressionFromTemplate(\n  template: ts.TemplateExpression,\n  paramNames: string[]\n): string {\n  let result = template.head.text;\n\n  for (const span of template.templateSpans) {\n    if (ts.isIdentifier(span.expression) && paramNames.includes(span.expression.text)) {\n      result += \"{string}\";\n    } else {\n      // Non-parameter expression, use {string} as fallback\n      result += \"{string}\";\n    }\n    result += span.literal.text;\n  }\n\n  return result;\n}\n\nfunction extractDependencies(\n  depsCall: ts.CallExpression\n): StepDefinitionMeta[\"dependencies\"] {\n  const deps: StepDefinitionMeta[\"dependencies\"] = {\n    given: {},\n    when: {},\n    then: {},\n  };\n\n  const arg = depsCall.arguments[0];\n  if (!arg || !ts.isObjectLiteralExpression(arg)) return deps;\n\n  for (const prop of arg.properties) {\n    if (!ts.isPropertyAssignment(prop) || !ts.isIdentifier(prop.name))\n      continue;\n\n    const phase = prop.name.text as \"given\" | \"when\" | \"then\";\n    if (!deps[phase]) continue;\n\n    if (ts.isObjectLiteralExpression(prop.initializer)) {\n      for (const innerProp of prop.initializer.properties) {\n        if (\n          ts.isPropertyAssignment(innerProp) &&\n          ts.isIdentifier(innerProp.name) &&\n          ts.isStringLiteral(innerProp.initializer)\n        ) {\n          const val = innerProp.initializer.text;\n          if (val === \"required\" || val === \"optional\") {\n            deps[phase][innerProp.name.text] = val;\n          }\n        }\n      }\n    }\n  }\n\n  return deps;\n}\n\nfunction extractProducedKeys(\n  stepCall: ts.CallExpression,\n  checker: ts.TypeChecker\n): string[] {\n  const callback = stepCall.arguments[0];\n  if (!callback) return [];\n\n  // Try to get the return type of the callback by analyzing its body\n  if (ts.isArrowFunction(callback) || ts.isFunctionExpression(callback)) {\n    return extractProducedKeysFromCallback(callback, checker);\n  }\n\n  return [];\n}\n\nfunction extractProducedKeysFromCallback(\n  callback: ts.ArrowFunction | ts.FunctionExpression,\n  checker: ts.TypeChecker\n): string[] {\n  const body = callback.body;\n\n  // Concise arrow: () => ({ key: value })\n  if (!ts.isBlock(body)) {\n    return extractKeysFromExpression(body, checker);\n  }\n\n  // Block body: look at return statements\n  const keys = new Set<string>();\n  function visitReturn(node: ts.Node) {\n    if (ts.isReturnStatement(node) && node.expression) {\n      for (const key of extractKeysFromExpression(node.expression, checker)) {\n        keys.add(key);\n      }\n    }\n    ts.forEachChild(node, visitReturn);\n  }\n  visitReturn(body);\n  return [...keys];\n}\n\nfunction extractKeysFromExpression(\n  expr: ts.Expression,\n  checker: ts.TypeChecker\n): string[] {\n  // Unwrap parenthesized expressions\n  while (ts.isParenthesizedExpression(expr)) {\n    expr = expr.expression;\n  }\n\n  // Object literal: { user: ..., token: ... }\n  if (ts.isObjectLiteralExpression(expr)) {\n    return expr.properties\n      .filter(\n        (p): p is ts.PropertyAssignment | ts.ShorthandPropertyAssignment =>\n          ts.isPropertyAssignment(p) || ts.isShorthandPropertyAssignment(p)\n      )\n      .map((p) => p.name.getText())\n      .filter(Boolean);\n  }\n\n  // Try type checker as fallback\n  try {\n    const type = checker.getTypeAtLocation(expr);\n    return type\n      .getProperties()\n      .map((p) => p.name)\n      .filter((n) => n !== \"merge\");\n  } catch {\n    return [];\n  }\n}\n\ninterface ReExportResult {\n  stepType: StepType;\n  expression: string | null;\n}\n\nfunction resolveReExportedCall(\n  chain: ts.CallExpression[],\n  checker: ts.TypeChecker\n): ReExportResult | null {\n  // Look for the pattern: Variable(\"...\")... where Variable was assigned from builderType().statement\n  // The last call in the chain (furthest from register) should be the variable call\n\n  const lastCall = chain[chain.length - 1];\n  if (!lastCall) return null;\n\n  const expr = lastCall.expression;\n\n  // If it's an identifier (like \"Given\", \"When\", \"Then\"), trace its declaration\n  let identifier: ts.Identifier | null = null;\n  if (ts.isIdentifier(expr)) {\n    identifier = expr;\n  } else if (\n    ts.isPropertyAccessExpression(expr) &&\n    ts.isIdentifier(expr.expression)\n  ) {\n    identifier = expr.expression;\n  }\n\n  if (!identifier) return null;\n\n  const symbol = checker.getSymbolAtLocation(identifier);\n  if (!symbol) return null;\n\n  const decl = symbol.valueDeclaration;\n  if (!decl || !ts.isVariableDeclaration(decl) || !decl.initializer)\n    return null;\n\n  // Check if initializer is builderType<T>().statement\n  const init = decl.initializer;\n\n  // Pattern: givenBuilder<T>().statement  (PropertyAccessExpression)\n  if (ts.isPropertyAccessExpression(init) && init.name.text === \"statement\") {\n    const callExpr = init.expression;\n    if (ts.isCallExpression(callExpr)) {\n      const callee = callExpr.expression;\n      if (ts.isIdentifier(callee) && BUILDER_NAMES[callee.text]) {\n        // The lastCall IS the statement call — extract expression from it\n        const expression = extractExpression(lastCall);\n        return {\n          stepType: BUILDER_NAMES[callee.text],\n          expression,\n        };\n      }\n    }\n  }\n\n  return null;\n}\n","import * as fs from \"node:fs\";\nimport { GherkinClassicTokenMatcher, Parser, AstBuilder } from \"@cucumber/gherkin\";\nimport * as messages from \"@cucumber/messages\";\nimport { ParsedScenario, ParsedStep } from \"./types.js\";\n\ntype GherkinKeyword = \"Given\" | \"When\" | \"Then\" | \"And\" | \"But\";\n\nexport function parseFeatureFiles(filePaths: string[]): ParsedScenario[] {\n  const scenarios: ParsedScenario[] = [];\n\n  for (const filePath of filePaths) {\n    const content = fs.readFileSync(filePath, \"utf-8\");\n    const parsed = parseFeatureContent(content, filePath);\n    scenarios.push(...parsed);\n  }\n\n  return scenarios;\n}\n\nexport function parseFeatureContent(\n  content: string,\n  filePath: string\n): ParsedScenario[] {\n  const newId = messages.IdGenerator.uuid();\n  const builder = new AstBuilder(newId);\n  const matcher = new GherkinClassicTokenMatcher();\n  const parser = new Parser(builder, matcher);\n\n  const gherkinDocument: messages.GherkinDocument = parser.parse(content);\n  const feature = gherkinDocument.feature;\n  if (!feature) return [];\n\n  // Collect background steps at the feature level\n  const featureBackground: messages.Step[] = [];\n  const scenarios: ParsedScenario[] = [];\n\n  for (const child of feature.children) {\n    if (child.background) {\n      featureBackground.push(...child.background.steps);\n    }\n\n    if (child.scenario) {\n      scenarios.push(\n        ...expandScenario(child.scenario, featureBackground, filePath)\n      );\n    }\n\n    if (child.rule) {\n      // Rules can have their own backgrounds\n      const ruleBackground: messages.Step[] = [...featureBackground];\n      for (const ruleChild of child.rule.children) {\n        if (ruleChild.background) {\n          ruleBackground.push(...ruleChild.background.steps);\n        }\n        if (ruleChild.scenario) {\n          scenarios.push(\n            ...expandScenario(ruleChild.scenario, ruleBackground, filePath)\n          );\n        }\n      }\n    }\n  }\n\n  return scenarios;\n}\n\nfunction expandScenario(\n  scenario: messages.Scenario,\n  backgroundSteps: messages.Step[],\n  filePath: string\n): ParsedScenario[] {\n  const hasExamples =\n    scenario.examples.length > 0 &&\n    scenario.examples.some((e) => e.tableBody.length > 0);\n\n  if (!hasExamples) {\n    // Regular scenario\n    const bgParsed = convertSteps(backgroundSteps);\n    const scenarioParsed = convertSteps(scenario.steps);\n    const allSteps = resolveEffectiveKeywords([...bgParsed, ...scenarioParsed]);\n\n    return [\n      {\n        name: scenario.name,\n        file: filePath,\n        steps: allSteps,\n      },\n    ];\n  }\n\n  // Scenario Outline — expand with each example row\n  const results: ParsedScenario[] = [];\n  for (const example of scenario.examples) {\n    if (!example.tableHeader || example.tableBody.length === 0) continue;\n    const headers = example.tableHeader.cells.map((c) => c.value);\n\n    for (const row of example.tableBody) {\n      const values = row.cells.map((c) => c.value);\n      const substitution: Record<string, string> = {};\n      headers.forEach((h, i) => {\n        substitution[h] = values[i];\n      });\n\n      const bgParsed = convertSteps(backgroundSteps);\n      const scenarioSteps = convertSteps(scenario.steps).map((step) => ({\n        ...step,\n        text: substituteExampleValues(step.text, substitution),\n      }));\n      const allSteps = resolveEffectiveKeywords([...bgParsed, ...scenarioSteps]);\n\n      results.push({\n        name: `${scenario.name} (${values.join(\", \")})`,\n        file: filePath,\n        steps: allSteps,\n      });\n    }\n  }\n\n  return results;\n}\n\nfunction convertSteps(\n  steps: readonly messages.Step[]\n): Omit<ParsedStep, \"effectiveKeyword\">[] {\n  return steps.map((step) => ({\n    keyword: normalizeKeyword(step.keyword),\n    text: step.text,\n    line: step.location.line,\n    // step.location.column points to the keyword start; shift past the\n    // keyword (which includes a trailing space) so column points to the\n    // start of the step text. This makes `column + text.length` produce\n    // the correct end position for diagnostic ranges.\n    column: (step.location.column ?? 1) + step.keyword.length,\n  }));\n}\n\nfunction normalizeKeyword(keyword: string): GherkinKeyword {\n  const trimmed = keyword.trim();\n  // Gherkin keywords may include trailing space, e.g. \"Given \"\n  if (trimmed === \"Given\") return \"Given\";\n  if (trimmed === \"When\") return \"When\";\n  if (trimmed === \"Then\") return \"Then\";\n  if (trimmed === \"And\") return \"And\";\n  if (trimmed === \"But\") return \"But\";\n  // Fallback: treat as Given (shouldn't happen with valid Gherkin)\n  return \"Given\";\n}\n\nfunction resolveEffectiveKeywords(\n  steps: Omit<ParsedStep, \"effectiveKeyword\">[]\n): ParsedStep[] {\n  let lastEffective: \"Given\" | \"When\" | \"Then\" = \"Given\";\n\n  return steps.map((step) => {\n    let effectiveKeyword: \"Given\" | \"When\" | \"Then\";\n    if (step.keyword === \"And\" || step.keyword === \"But\") {\n      effectiveKeyword = lastEffective;\n    } else {\n      effectiveKeyword = step.keyword as \"Given\" | \"When\" | \"Then\";\n    }\n    lastEffective = effectiveKeyword;\n\n    return {\n      ...step,\n      effectiveKeyword,\n    };\n  });\n}\n\nfunction substituteExampleValues(\n  text: string,\n  substitution: Record<string, string>\n): string {\n  let result = text;\n  for (const [key, value] of Object.entries(substitution)) {\n    result = result.replace(new RegExp(`<${key}>`, \"g\"), value);\n  }\n  return result;\n}\n","import { MatchedStep, ParsedScenario, StepDefinitionMeta } from \"./types.js\";\n\ninterface CompiledPattern {\n  regex: RegExp;\n  definition: StepDefinitionMeta;\n}\n\nfunction compileDefinitions(\n  definitions: StepDefinitionMeta[]\n): CompiledPattern[] {\n  const compiled: CompiledPattern[] = [];\n  for (const def of definitions) {\n    try {\n      // Replace {paramType} placeholders with (.+) to match any value,\n      // matching the Step Forge runtime behavior where all params use {string}\n      // and values are coerced at runtime via typeCoercer.\n      const placeholder = \"###PLACEHOLDER###\";\n      const regexStr = def.expression\n        .replace(/\\{[^}]+\\}/g, placeholder)\n        .replace(/[.*+?^$()|[\\]\\\\]/g, \"\\\\$&\")\n        .replace(new RegExp(placeholder, \"g\"), \"(.+)\");\n      compiled.push({\n        regex: new RegExp(`^${regexStr}$`, \"i\"),\n        definition: def,\n      });\n    } catch {\n      // Skip definitions with invalid expressions\n    }\n  }\n  return compiled;\n}\n\nexport function matchScenarioSteps(\n  scenario: ParsedScenario,\n  definitions: StepDefinitionMeta[]\n): MatchedStep[] {\n  const compiled = compileDefinitions(definitions);\n\n  return scenario.steps.map((step) => {\n    const matches = findMatches(step.text, step.effectiveKeyword, compiled);\n    return {\n      ...step,\n      definitions: matches,\n    };\n  });\n}\n\nexport function findMatchingDefinitions(\n  text: string,\n  effectiveKeyword: \"Given\" | \"When\" | \"Then\",\n  definitions: StepDefinitionMeta[]\n): StepDefinitionMeta[] {\n  const compiled = compileDefinitions(definitions);\n  return findMatches(text, effectiveKeyword, compiled);\n}\n\nfunction findMatches(\n  text: string,\n  effectiveKeyword: \"Given\" | \"When\" | \"Then\",\n  compiled: CompiledPattern[]\n): StepDefinitionMeta[] {\n  const keywordToStepType: Record<string, string> = {\n    Given: \"given\",\n    When: \"when\",\n    Then: \"then\",\n  };\n  const expectedStepType = keywordToStepType[effectiveKeyword];\n\n  // First try to match with the correct step type\n  const typedMatches: StepDefinitionMeta[] = [];\n  for (const { regex, definition } of compiled) {\n    if (definition.stepType !== expectedStepType) continue;\n    if (regex.test(text)) typedMatches.push(definition);\n  }\n\n  if (typedMatches.length > 0) return typedMatches;\n\n  // Fallback: match any step type\n  const fallbackMatches: StepDefinitionMeta[] = [];\n  for (const { regex, definition } of compiled) {\n    if (regex.test(text)) fallbackMatches.push(definition);\n  }\n\n  return fallbackMatches;\n}\n","import {\n  AnalysisRule,\n  Diagnostic,\n  MatchedStep,\n  ParsedScenario,\n} from \"../types.js\";\n\nexport const ambiguousStepRule: AnalysisRule = {\n  name: \"ambiguous-step\",\n\n  check(\n    scenario: ParsedScenario,\n    matchedSteps: MatchedStep[]\n  ): Diagnostic[] {\n    return matchedSteps\n      .filter((step) => step.definitions.length > 1)\n      .map((step) => {\n        const locations = step.definitions\n          .map((d) => `${d.sourceFile}:${d.line}`)\n          .join(\", \");\n        return {\n          file: scenario.file,\n          range: {\n            startLine: step.line,\n            startColumn: step.column,\n            endLine: step.line,\n            endColumn: step.column + step.text.length,\n          },\n          severity: \"error\" as const,\n          message: `Step \"${step.text}\" matches multiple step definitions: ${locations}`,\n          rule: \"ambiguous-step\",\n          source: \"step-forge\" as const,\n        };\n      });\n  },\n};\n","import {\n  AnalysisRule,\n  Diagnostic,\n  MatchedStep,\n  ParsedScenario,\n} from \"../types.js\";\n\nexport const dependencyRule: AnalysisRule = {\n  name: \"dependency-check\",\n\n  check(\n    scenario: ParsedScenario,\n    matchedSteps: MatchedStep[]\n  ): Diagnostic[] {\n    const diagnostics: Diagnostic[] = [];\n    const produced = {\n      given: new Set<string>(),\n      when: new Set<string>(),\n      then: new Set<string>(),\n    };\n\n    for (const step of matchedSteps) {\n      if (step.definitions.length !== 1) continue;\n\n      const { dependencies, produces, stepType } = step.definitions[0];\n\n      // Collect all missing required dependencies for this step\n      const missing: Record<string, string[]> = {};\n      for (const phase of [\"given\", \"when\", \"then\"] as const) {\n        for (const [key, requirement] of Object.entries(dependencies[phase])) {\n          if (requirement === \"required\" && !produced[phase].has(key)) {\n            if (!missing[phase]) {\n              missing[phase] = [];\n            }\n            missing[phase].push(key);\n          }\n        }\n      }\n\n      if (Object.keys(missing).length > 0) {\n        const lines = Object.entries(missing).map(\n          ([phase, keys]) =>\n            `${phase.charAt(0).toUpperCase() + phase.slice(1)}: ${keys.map((k) => `${phase}.${k}`).join(\", \")}`\n        );\n        const message =\n          \"Missing required dependencies:\\n\" + lines.join(\"\\n\");\n\n        diagnostics.push({\n          file: scenario.file,\n          range: {\n            startLine: step.line,\n            startColumn: step.column,\n            endLine: step.line,\n            endColumn: step.column + step.text.length,\n          },\n          severity: \"error\",\n          message,\n          rule: \"dependency-check\",\n          source: \"step-forge\",\n        });\n      }\n\n      // Add produced keys for this step\n      for (const key of produces) {\n        produced[stepType].add(key);\n      }\n    }\n\n    return diagnostics;\n  },\n};\n","import {\n  AnalysisRule,\n  Diagnostic,\n  MatchedStep,\n  ParsedScenario,\n} from \"../types.js\";\n\nexport const undefinedStepRule: AnalysisRule = {\n  name: \"undefined-step\",\n\n  check(\n    scenario: ParsedScenario,\n    matchedSteps: MatchedStep[]\n  ): Diagnostic[] {\n    return matchedSteps\n      .filter((step) => step.definitions.length === 0)\n      .map((step) => ({\n        file: scenario.file,\n        range: {\n          startLine: step.line,\n          startColumn: step.column,\n          endLine: step.line,\n          endColumn: step.column + step.text.length,\n        },\n        severity: \"error\" as const,\n        message: `Step \"${step.text}\" does not match any step definition`,\n        rule: \"undefined-step\",\n        source: \"step-forge\" as const,\n      }));\n  },\n};\n","import {\n  AnalysisRule,\n  Diagnostic,\n  MatchedStep,\n  ParsedScenario,\n} from \"../types.js\";\nimport { ambiguousStepRule } from \"./ambiguousStepRule.js\";\nimport { dependencyRule } from \"./dependencyRule.js\";\nimport { undefinedStepRule } from \"./undefinedStepRule.js\";\n\nexport const defaultRules: AnalysisRule[] = [\n  undefinedStepRule,\n  ambiguousStepRule,\n  dependencyRule,\n];\n\nexport function runRules(\n  rules: AnalysisRule[],\n  scenario: ParsedScenario,\n  matchedSteps: MatchedStep[]\n): Diagnostic[] {\n  return rules.flatMap((rule) => rule.check(scenario, matchedSteps));\n}\n","import { glob } from \"node:fs/promises\";\nimport * as path from \"node:path\";\nimport { extractStepDefinitions } from \"./stepExtractor.js\";\nimport { parseFeatureFiles, parseFeatureContent } from \"./gherkinParser.js\";\nimport {\n  matchScenarioSteps,\n  findMatchingDefinitions,\n} from \"./stepMatcher.js\";\nimport { defaultRules, runRules } from \"./rules/index.js\";\nimport type {\n  AnalyzerConfig,\n  AnalysisRule,\n  Diagnostic,\n  StepDefinitionMeta,\n  ParsedScenario,\n  MatchedStep,\n  ParsedStep,\n} from \"./types.js\";\n\nexport type {\n  AnalyzerConfig,\n  AnalysisRule,\n  Diagnostic,\n  StepDefinitionMeta,\n  ParsedScenario,\n  MatchedStep,\n  ParsedStep,\n};\n\nexport {\n  extractStepDefinitions,\n  parseFeatureFiles,\n  parseFeatureContent,\n  matchScenarioSteps,\n  findMatchingDefinitions,\n  defaultRules,\n};\n\nexport interface AnalyzeOptions {\n  rules?: AnalysisRule[];\n}\n\nexport async function analyze(\n  config: AnalyzerConfig,\n  options?: AnalyzeOptions\n): Promise<Diagnostic[]> {\n  const rules = options?.rules ?? defaultRules;\n\n  // 1. Resolve file globs to paths\n  const stepFilePaths = await resolveGlobs(config.stepFiles);\n  const featureFilePaths = await resolveGlobs(config.featureFiles);\n\n  if (stepFilePaths.length === 0) {\n    return [];\n  }\n  if (featureFilePaths.length === 0) {\n    return [];\n  }\n\n  // 2. Extract step metadata from step files\n  const stepDefinitions = extractStepDefinitions(\n    stepFilePaths,\n    config.tsConfigPath\n  );\n\n  // 3. Parse feature files\n  const scenarios = parseFeatureFiles(featureFilePaths);\n\n  // 4. For each scenario, match steps and run rules\n  const diagnostics: Diagnostic[] = [];\n  for (const scenario of scenarios) {\n    const matchedSteps = matchScenarioSteps(scenario, stepDefinitions);\n    const scenarioDiags = runRules(rules, scenario, matchedSteps);\n    diagnostics.push(...scenarioDiags);\n  }\n\n  return diagnostics;\n}\n\nasync function resolveGlobs(patterns: string[]): Promise<string[]> {\n  const files: string[] = [];\n  for (const pattern of patterns) {\n    for await (const file of glob(pattern)) {\n      files.push(path.resolve(file));\n    }\n  }\n  // Deduplicate\n  return [...new Set(files)];\n}\n"],"mappings":";;;;;;;AAKA,MAAM,gBAA0C;CAC9C,cAAc;CACd,aAAa;CACb,aAAa;AACf;AAEA,SAAgB,uBACd,WACA,cACsB;CACtB,MAAM,aACJ,gBAAgB,GAAG,eAAe,QAAQ,IAAI,GAAG,GAAG,IAAI,UAAU;CACpE,IAAI,kBAAsC;EACxC,QAAQ,GAAG,aAAa;EACxB,QAAQ,GAAG,WAAW;EACtB,kBAAkB,GAAG,qBAAqB;EAC1C,QAAQ;EACR,iBAAiB;CACnB;CAEA,IAAI,YAAY;EACd,MAAM,aAAa,GAAG,eAAe,YAAY,GAAG,IAAI,QAAQ;EAChE,IAAI,CAAC,WAAW,OAMd,kBALe,GAAG,2BAChB,WAAW,QACX,GAAG,KACH,WAAW,QAAQ,iBAAiB,EAAE,CAEjB,EAAE;CAE7B;CAGA,gBAAgB,SAAS;CAEzB,MAAM,UAAU,GAAG,cAAc,WAAW,eAAe;CAC3D,MAAM,UAAU,QAAQ,eAAe;CACvC,MAAM,UAAgC,CAAC;CAEvC,KAAK,MAAM,YAAY,WAAW;EAChC,MAAM,aAAa,QAAQ,cAAc,QAAQ;EACjD,IAAI,CAAC,YAAY;EACjB,MAAM,cAAc,sBAAsB,YAAY,OAAO;EAC7D,QAAQ,KAAK,GAAG,WAAW;CAC7B;CAEA,OAAO;AACT;AAEA,SAAS,sBACP,YACA,SACsB;CACtB,MAAM,UAAgC,CAAC;CAEvC,SAAS,MAAM,MAAe;EAE5B,IACE,GAAG,iBAAiB,IAAI,KACxB,GAAG,2BAA2B,KAAK,UAAU,KAC7C,KAAK,WAAW,KAAK,SAAS,YAC9B;GACA,MAAM,OAAO,wBAAwB,MAAM,YAAY,OAAO;GAC9D,IAAI,MACF,QAAQ,KAAK,IAAI;EAErB;EACA,GAAG,aAAa,MAAM,KAAK;CAC7B;CAEA,MAAM,UAAU;CAChB,OAAO;AACT;AAEA,SAAS,wBACP,cACA,YACA,SAC2B;CAK3B,MAAM,QAAQ,iBAAiB,YAAY;CAE3C,IAAI,WAA4B;CAChC,IAAI,aAA4B;CAChC,IAAI,eAAmD;EACrD,OAAO,CAAC;EACR,MAAM,CAAC;EACP,MAAM,CAAC;CACT;CACA,IAAI,WAAqB,CAAC;CAE1B,KAAK,MAAM,QAAQ,OAAO;EACxB,MAAM,OAAO,YAAY,IAAI;EAC7B,IAAI,CAAC,MAAM;EAEX,IAAI,SAAS,YAEX;EAGF,IAAI,SAAS,QAAQ;GACnB,WAAW,oBAAoB,MAAM,OAAO;GAC5C;EACF;EAEA,IAAI,SAAS,gBAAgB;GAC3B,eAAe,oBAAoB,IAAI;GACvC;EACF;EAEA,IAAI,SAAS,aAAa;GACxB,aAAa,kBAAkB,IAAI;GAEnC;EACF;EAGA,IAAI,cAAc,OAAO;GACvB,WAAW,cAAc;GACzB;EACF;CACF;CAKA,IAAI,CAAC,YAAY,CAAC,YAAY;EAC5B,MAAM,WAAW,sBAAsB,OAAO,OAAO;EACrD,IAAI,UAAU;GACZ,IAAI,CAAC,UAAU,WAAW,SAAS;GACnC,IAAI,CAAC,YAAY,aAAa,SAAS;EACzC;CACF;CAEA,IAAI,CAAC,YAAY,CAAC,YAChB,OAAO;CAGT,MAAM,OACJ,WAAW,8BAA8B,aAAa,SAAS,CAAC,EAAE,OAAO;CAE3E,OAAO;EACL;EACA;EACA;EACA;EACA,YAAY,WAAW;EACvB;CACF;AACF;;;;AAKA,SAAS,iBAAiB,MAA8C;CACtE,MAAM,QAA6B,CAAC,IAAI;CACxC,IAAI,UAAyB,KAAK;CAElC,OAAO,MAAM;EAEX,IAAI,GAAG,2BAA2B,OAAO,GACvC,UAAU,QAAQ;EAGpB,IAAI,GAAG,iBAAiB,OAAO,GAAG;GAChC,MAAM,KAAK,OAAO;GAClB,UAAU,QAAQ;EACpB,OACE;CAEJ;CAEA,OAAO;AACT;AAEA,SAAS,YAAY,MAAwC;CAC3D,MAAM,OAAO,KAAK;CAGlB,IAAI,GAAG,2BAA2B,IAAI,GACpC,OAAO,KAAK,KAAK;CAInB,IAAI,GAAG,aAAa,IAAI,GACtB,OAAO,KAAK;CAGd,OAAO;AACT;AAEA,SAAS,kBAAkB,eAAiD;CAC1E,MAAM,MAAM,cAAc,UAAU;CACpC,IAAI,CAAC,KAAK,OAAO;CAGjB,IAAI,GAAG,gBAAgB,GAAG,GACxB,OAAO,IAAI;CAIb,IAAI,GAAG,gBAAgB,GAAG,GACxB,OAAO,mCAAmC,GAAG;CAG/C,OAAO;AACT;AAEA,SAAS,mCACP,IACe;CACf,MAAM,SAAS,GAAG,WAAW,KAAK,MAAM,EAAE,KAAK,QAAQ,CAAC;CAGxD,IAAI,OAAO,GAAG;CAGd,IAAI,GAAG,QAAQ,IAAI,GAAG;EACpB,MAAM,aAAa,KAAK,WAAW,KAAK,GAAG,iBAAiB;EAC5D,IAAI,YAAY,YACd,OAAO,WAAW;OAElB,OAAO;CAEX;CAEA,IAAI,GAAG,qBAAqB,IAAI,GAC9B,OAAO,kCAAkC,MAAM,MAAM;CAGvD,IAAI,GAAG,gCAAgC,IAAI,GACzC,OAAO,KAAK;CAGd,OAAO;AACT;AAEA,SAAS,kCACP,UACA,YACQ;CACR,IAAI,SAAS,SAAS,KAAK;CAE3B,KAAK,MAAM,QAAQ,SAAS,eAAe;EACzC,IAAI,GAAG,aAAa,KAAK,UAAU,KAAK,WAAW,SAAS,KAAK,WAAW,IAAI,GAC9E,UAAU;OAGV,UAAU;EAEZ,UAAU,KAAK,QAAQ;CACzB;CAEA,OAAO;AACT;AAEA,SAAS,oBACP,UACoC;CACpC,MAAM,OAA2C;EAC/C,OAAO,CAAC;EACR,MAAM,CAAC;EACP,MAAM,CAAC;CACT;CAEA,MAAM,MAAM,SAAS,UAAU;CAC/B,IAAI,CAAC,OAAO,CAAC,GAAG,0BAA0B,GAAG,GAAG,OAAO;CAEvD,KAAK,MAAM,QAAQ,IAAI,YAAY;EACjC,IAAI,CAAC,GAAG,qBAAqB,IAAI,KAAK,CAAC,GAAG,aAAa,KAAK,IAAI,GAC9D;EAEF,MAAM,QAAQ,KAAK,KAAK;EACxB,IAAI,CAAC,KAAK,QAAQ;EAElB,IAAI,GAAG,0BAA0B,KAAK,WAAW;QAC1C,MAAM,aAAa,KAAK,YAAY,YACvC,IACE,GAAG,qBAAqB,SAAS,KACjC,GAAG,aAAa,UAAU,IAAI,KAC9B,GAAG,gBAAgB,UAAU,WAAW,GACxC;IACA,MAAM,MAAM,UAAU,YAAY;IAClC,IAAI,QAAQ,cAAc,QAAQ,YAChC,KAAK,OAAO,UAAU,KAAK,QAAQ;GAEvC;;CAGN;CAEA,OAAO;AACT;AAEA,SAAS,oBACP,UACA,SACU;CACV,MAAM,WAAW,SAAS,UAAU;CACpC,IAAI,CAAC,UAAU,OAAO,CAAC;CAGvB,IAAI,GAAG,gBAAgB,QAAQ,KAAK,GAAG,qBAAqB,QAAQ,GAClE,OAAO,gCAAgC,UAAU,OAAO;CAG1D,OAAO,CAAC;AACV;AAEA,SAAS,gCACP,UACA,SACU;CACV,MAAM,OAAO,SAAS;CAGtB,IAAI,CAAC,GAAG,QAAQ,IAAI,GAClB,OAAO,0BAA0B,MAAM,OAAO;CAIhD,MAAM,uBAAO,IAAI,IAAY;CAC7B,SAAS,YAAY,MAAe;EAClC,IAAI,GAAG,kBAAkB,IAAI,KAAK,KAAK,YACrC,KAAK,MAAM,OAAO,0BAA0B,KAAK,YAAY,OAAO,GAClE,KAAK,IAAI,GAAG;EAGhB,GAAG,aAAa,MAAM,WAAW;CACnC;CACA,YAAY,IAAI;CAChB,OAAO,CAAC,GAAG,IAAI;AACjB;AAEA,SAAS,0BACP,MACA,SACU;CAEV,OAAO,GAAG,0BAA0B,IAAI,GACtC,OAAO,KAAK;CAId,IAAI,GAAG,0BAA0B,IAAI,GACnC,OAAO,KAAK,WACT,QACE,MACC,GAAG,qBAAqB,CAAC,KAAK,GAAG,8BAA8B,CAAC,CACpE,EACC,KAAK,MAAM,EAAE,KAAK,QAAQ,CAAC,EAC3B,OAAO,OAAO;CAInB,IAAI;EAEF,OADa,QAAQ,kBAAkB,IAC7B,EACP,cAAc,EACd,KAAK,MAAM,EAAE,IAAI,EACjB,QAAQ,MAAM,MAAM,OAAO;CAChC,QAAQ;EACN,OAAO,CAAC;CACV;AACF;AAOA,SAAS,sBACP,OACA,SACuB;CAIvB,MAAM,WAAW,MAAM,MAAM,SAAS;CACtC,IAAI,CAAC,UAAU,OAAO;CAEtB,MAAM,OAAO,SAAS;CAGtB,IAAI,aAAmC;CACvC,IAAI,GAAG,aAAa,IAAI,GACtB,aAAa;MACR,IACL,GAAG,2BAA2B,IAAI,KAClC,GAAG,aAAa,KAAK,UAAU,GAE/B,aAAa,KAAK;CAGpB,IAAI,CAAC,YAAY,OAAO;CAExB,MAAM,SAAS,QAAQ,oBAAoB,UAAU;CACrD,IAAI,CAAC,QAAQ,OAAO;CAEpB,MAAM,OAAO,OAAO;CACpB,IAAI,CAAC,QAAQ,CAAC,GAAG,sBAAsB,IAAI,KAAK,CAAC,KAAK,aACpD,OAAO;CAGT,MAAM,OAAO,KAAK;CAGlB,IAAI,GAAG,2BAA2B,IAAI,KAAK,KAAK,KAAK,SAAS,aAAa;EACzE,MAAM,WAAW,KAAK;EACtB,IAAI,GAAG,iBAAiB,QAAQ,GAAG;GACjC,MAAM,SAAS,SAAS;GACxB,IAAI,GAAG,aAAa,MAAM,KAAK,cAAc,OAAO,OAAO;IAEzD,MAAM,aAAa,kBAAkB,QAAQ;IAC7C,OAAO;KACL,UAAU,cAAc,OAAO;KAC/B;IACF;GACF;EACF;CACF;CAEA,OAAO;AACT;;;ACxaA,SAAgB,kBAAkB,WAAuC;CACvE,MAAM,YAA8B,CAAC;CAErC,KAAK,MAAM,YAAY,WAAW;EAEhC,MAAM,SAAS,oBADC,GAAG,aAAa,UAAU,OACD,GAAG,QAAQ;EACpD,UAAU,KAAK,GAAG,MAAM;CAC1B;CAEA,OAAO;AACT;AAEA,SAAgB,oBACd,SACA,UACkB;CAOlB,MAAM,UAD4C,IAF/B,OAAO,IAFN,WADN,SAAS,YAAY,KACA,CAEH,GAAG,IADf,2BACqB,CAEc,EAAE,MAAM,OACjC,EAAE;CAChC,IAAI,CAAC,SAAS,OAAO,CAAC;CAGtB,MAAM,oBAAqC,CAAC;CAC5C,MAAM,YAA8B,CAAC;CAErC,KAAK,MAAM,SAAS,QAAQ,UAAU;EACpC,IAAI,MAAM,YACR,kBAAkB,KAAK,GAAG,MAAM,WAAW,KAAK;EAGlD,IAAI,MAAM,UACR,UAAU,KACR,GAAG,eAAe,MAAM,UAAU,mBAAmB,QAAQ,CAC/D;EAGF,IAAI,MAAM,MAAM;GAEd,MAAM,iBAAkC,CAAC,GAAG,iBAAiB;GAC7D,KAAK,MAAM,aAAa,MAAM,KAAK,UAAU;IAC3C,IAAI,UAAU,YACZ,eAAe,KAAK,GAAG,UAAU,WAAW,KAAK;IAEnD,IAAI,UAAU,UACZ,UAAU,KACR,GAAG,eAAe,UAAU,UAAU,gBAAgB,QAAQ,CAChE;GAEJ;EACF;CACF;CAEA,OAAO;AACT;AAEA,SAAS,eACP,UACA,iBACA,UACkB;CAKlB,IAAI,EAHF,SAAS,SAAS,SAAS,KAC3B,SAAS,SAAS,MAAM,MAAM,EAAE,UAAU,SAAS,CAAC,IAEpC;EAEhB,MAAM,WAAW,aAAa,eAAe;EAC7C,MAAM,iBAAiB,aAAa,SAAS,KAAK;EAClD,MAAM,WAAW,yBAAyB,CAAC,GAAG,UAAU,GAAG,cAAc,CAAC;EAE1E,OAAO,CACL;GACE,MAAM,SAAS;GACf,MAAM;GACN,OAAO;EACT,CACF;CACF;CAGA,MAAM,UAA4B,CAAC;CACnC,KAAK,MAAM,WAAW,SAAS,UAAU;EACvC,IAAI,CAAC,QAAQ,eAAe,QAAQ,UAAU,WAAW,GAAG;EAC5D,MAAM,UAAU,QAAQ,YAAY,MAAM,KAAK,MAAM,EAAE,KAAK;EAE5D,KAAK,MAAM,OAAO,QAAQ,WAAW;GACnC,MAAM,SAAS,IAAI,MAAM,KAAK,MAAM,EAAE,KAAK;GAC3C,MAAM,eAAuC,CAAC;GAC9C,QAAQ,SAAS,GAAG,MAAM;IACxB,aAAa,KAAK,OAAO;GAC3B,CAAC;GAED,MAAM,WAAW,aAAa,eAAe;GAC7C,MAAM,gBAAgB,aAAa,SAAS,KAAK,EAAE,KAAK,UAAU;IAChE,GAAG;IACH,MAAM,wBAAwB,KAAK,MAAM,YAAY;GACvD,EAAE;GACF,MAAM,WAAW,yBAAyB,CAAC,GAAG,UAAU,GAAG,aAAa,CAAC;GAEzE,QAAQ,KAAK;IACX,MAAM,GAAG,SAAS,KAAK,IAAI,OAAO,KAAK,IAAI,EAAE;IAC7C,MAAM;IACN,OAAO;GACT,CAAC;EACH;CACF;CAEA,OAAO;AACT;AAEA,SAAS,aACP,OACwC;CACxC,OAAO,MAAM,KAAK,UAAU;EAC1B,SAAS,iBAAiB,KAAK,OAAO;EACtC,MAAM,KAAK;EACX,MAAM,KAAK,SAAS;EAKpB,SAAS,KAAK,SAAS,UAAU,KAAK,KAAK,QAAQ;CACrD,EAAE;AACJ;AAEA,SAAS,iBAAiB,SAAiC;CACzD,MAAM,UAAU,QAAQ,KAAK;CAE7B,IAAI,YAAY,SAAS,OAAO;CAChC,IAAI,YAAY,QAAQ,OAAO;CAC/B,IAAI,YAAY,QAAQ,OAAO;CAC/B,IAAI,YAAY,OAAO,OAAO;CAC9B,IAAI,YAAY,OAAO,OAAO;CAE9B,OAAO;AACT;AAEA,SAAS,yBACP,OACc;CACd,IAAI,gBAA2C;CAE/C,OAAO,MAAM,KAAK,SAAS;EACzB,IAAI;EACJ,IAAI,KAAK,YAAY,SAAS,KAAK,YAAY,OAC7C,mBAAmB;OAEnB,mBAAmB,KAAK;EAE1B,gBAAgB;EAEhB,OAAO;GACL,GAAG;GACH;EACF;CACF,CAAC;AACH;AAEA,SAAS,wBACP,MACA,cACQ;CACR,IAAI,SAAS;CACb,KAAK,MAAM,CAAC,KAAK,UAAU,OAAO,QAAQ,YAAY,GACpD,SAAS,OAAO,QAAQ,IAAI,OAAO,IAAI,IAAI,IAAI,GAAG,GAAG,KAAK;CAE5D,OAAO;AACT;;;AC3KA,SAAS,mBACP,aACmB;CACnB,MAAM,WAA8B,CAAC;CACrC,KAAK,MAAM,OAAO,aAChB,IAAI;EAIF,MAAM,cAAc;EACpB,MAAM,WAAW,IAAI,WAClB,QAAQ,cAAc,WAAW,EACjC,QAAQ,qBAAqB,MAAM,EACnC,QAAQ,IAAI,OAAO,aAAa,GAAG,GAAG,MAAM;EAC/C,SAAS,KAAK;GACZ,OAAO,IAAI,OAAO,IAAI,SAAS,IAAI,GAAG;GACtC,YAAY;EACd,CAAC;CACH,QAAQ,CAER;CAEF,OAAO;AACT;AAEA,SAAgB,mBACd,UACA,aACe;CACf,MAAM,WAAW,mBAAmB,WAAW;CAE/C,OAAO,SAAS,MAAM,KAAK,SAAS;EAClC,MAAM,UAAU,YAAY,KAAK,MAAM,KAAK,kBAAkB,QAAQ;EACtE,OAAO;GACL,GAAG;GACH,aAAa;EACf;CACF,CAAC;AACH;AAEA,SAAgB,wBACd,MACA,kBACA,aACsB;CAEtB,OAAO,YAAY,MAAM,kBADR,mBAAmB,WACc,CAAC;AACrD;AAEA,SAAS,YACP,MACA,kBACA,UACsB;CAMtB,MAAM,mBAAmB;EAJvB,OAAO;EACP,MAAM;EACN,MAAM;CAEiC,EAAE;CAG3C,MAAM,eAAqC,CAAC;CAC5C,KAAK,MAAM,EAAE,OAAO,gBAAgB,UAAU;EAC5C,IAAI,WAAW,aAAa,kBAAkB;EAC9C,IAAI,MAAM,KAAK,IAAI,GAAG,aAAa,KAAK,UAAU;CACpD;CAEA,IAAI,aAAa,SAAS,GAAG,OAAO;CAGpC,MAAM,kBAAwC,CAAC;CAC/C,KAAK,MAAM,EAAE,OAAO,gBAAgB,UAClC,IAAI,MAAM,KAAK,IAAI,GAAG,gBAAgB,KAAK,UAAU;CAGvD,OAAO;AACT;;;AI1EA,MAAa,eAA+B;CAC1C;EDHA,MAAM;EAEN,MACE,UACA,cACc;GACd,OAAO,aACJ,QAAQ,SAAS,KAAK,YAAY,WAAW,CAAC,EAC9C,KAAK,UAAU;IACd,MAAM,SAAS;IACf,OAAO;KACL,WAAW,KAAK;KAChB,aAAa,KAAK;KAClB,SAAS,KAAK;KACd,WAAW,KAAK,SAAS,KAAK,KAAK;IACrC;IACA,UAAU;IACV,SAAS,SAAS,KAAK,KAAK;IAC5B,MAAM;IACN,QAAQ;GACV,EAAE;EACN;CClBA;CACA;EHJA,MAAM;EAEN,MACE,UACA,cACc;GACd,OAAO,aACJ,QAAQ,SAAS,KAAK,YAAY,SAAS,CAAC,EAC5C,KAAK,SAAS;IACb,MAAM,YAAY,KAAK,YACpB,KAAK,MAAM,GAAG,EAAE,WAAW,GAAG,EAAE,MAAM,EACtC,KAAK,IAAI;IACZ,OAAO;KACL,MAAM,SAAS;KACf,OAAO;MACL,WAAW,KAAK;MAChB,aAAa,KAAK;MAClB,SAAS,KAAK;MACd,WAAW,KAAK,SAAS,KAAK,KAAK;KACrC;KACA,UAAU;KACV,SAAS,SAAS,KAAK,KAAK,uCAAuC;KACnE,MAAM;KACN,QAAQ;IACV;GACF,CAAC;EACL;CGtBA;CACA;EFLA,MAAM;EAEN,MACE,UACA,cACc;GACd,MAAM,cAA4B,CAAC;GACnC,MAAM,WAAW;IACf,uBAAO,IAAI,IAAY;IACvB,sBAAM,IAAI,IAAY;IACtB,sBAAM,IAAI,IAAY;GACxB;GAEA,KAAK,MAAM,QAAQ,cAAc;IAC/B,IAAI,KAAK,YAAY,WAAW,GAAG;IAEnC,MAAM,EAAE,cAAc,UAAU,aAAa,KAAK,YAAY;IAG9D,MAAM,UAAoC,CAAC;IAC3C,KAAK,MAAM,SAAS;KAAC;KAAS;KAAQ;IAAM,GAC1C,KAAK,MAAM,CAAC,KAAK,gBAAgB,OAAO,QAAQ,aAAa,MAAM,GACjE,IAAI,gBAAgB,cAAc,CAAC,SAAS,OAAO,IAAI,GAAG,GAAG;KAC3D,IAAI,CAAC,QAAQ,QACX,QAAQ,SAAS,CAAC;KAEpB,QAAQ,OAAO,KAAK,GAAG;IACzB;IAIJ,IAAI,OAAO,KAAK,OAAO,EAAE,SAAS,GAAG;KAKnC,MAAM,UACJ,qCALY,OAAO,QAAQ,OAAO,EAAE,KACnC,CAAC,OAAO,UACP,GAAG,MAAM,OAAO,CAAC,EAAE,YAAY,IAAI,MAAM,MAAM,CAAC,EAAE,IAAI,KAAK,KAAK,MAAM,GAAG,MAAM,GAAG,GAAG,EAAE,KAAK,IAAI,GAGzD,EAAE,KAAK,IAAI;KAEtD,YAAY,KAAK;MACf,MAAM,SAAS;MACf,OAAO;OACL,WAAW,KAAK;OAChB,aAAa,KAAK;OAClB,SAAS,KAAK;OACd,WAAW,KAAK,SAAS,KAAK,KAAK;MACrC;MACA,UAAU;MACV;MACA,MAAM;MACN,QAAQ;KACV,CAAC;IACH;IAGA,KAAK,MAAM,OAAO,UAChB,SAAS,UAAU,IAAI,GAAG;GAE9B;GAEA,OAAO;EACT;CExDA;AACF;AAEA,SAAgB,SACd,OACA,UACA,cACc;CACd,OAAO,MAAM,SAAS,SAAS,KAAK,MAAM,UAAU,YAAY,CAAC;AACnE;;;ACoBA,eAAsB,QACpB,QACA,SACuB;CACvB,MAAM,QAAQ,SAAS,SAAS;CAGhC,MAAM,gBAAgB,MAAM,aAAa,OAAO,SAAS;CACzD,MAAM,mBAAmB,MAAM,aAAa,OAAO,YAAY;CAE/D,IAAI,cAAc,WAAW,GAC3B,OAAO,CAAC;CAEV,IAAI,iBAAiB,WAAW,GAC9B,OAAO,CAAC;CAIV,MAAM,kBAAkB,uBACtB,eACA,OAAO,YACT;CAGA,MAAM,YAAY,kBAAkB,gBAAgB;CAGpD,MAAM,cAA4B,CAAC;CACnC,KAAK,MAAM,YAAY,WAAW;EAEhC,MAAM,gBAAgB,SAAS,OAAO,UADjB,mBAAmB,UAAU,eACS,CAAC;EAC5D,YAAY,KAAK,GAAG,aAAa;CACnC;CAEA,OAAO;AACT;AAEA,eAAe,aAAa,UAAuC;CACjE,MAAM,QAAkB,CAAC;CACzB,KAAK,MAAM,WAAW,UACpB,WAAW,MAAM,QAAQ,KAAK,OAAO,GACnC,MAAM,KAAK,KAAK,QAAQ,IAAI,CAAC;CAIjC,OAAO,CAAC,GAAG,IAAI,IAAI,KAAK,CAAC;AAC3B"}
+{"version":3,"file":"analyzer-QH03uejK.js","names":[],"sources":["../../src/analyzer/stepExtractor.ts","../../src/analyzer/gherkinParser.ts","../../src/analyzer/stepMatcher.ts","../../src/analyzer/rules/ambiguousStepRule.ts","../../src/analyzer/rules/dependencyRule.ts","../../src/analyzer/rules/undefinedStepRule.ts","../../src/analyzer/rules/index.ts","../../src/analyzer/index.ts"],"sourcesContent":["import ts from \"typescript\";\nimport { StepDefinitionMeta } from \"./types.js\";\n\ntype StepType = \"given\" | \"when\" | \"then\";\n\nconst BUILDER_NAMES: Record<string, StepType> = {\n  givenBuilder: \"given\",\n  whenBuilder: \"when\",\n  thenBuilder: \"then\",\n};\n\nexport function extractStepDefinitions(\n  filePaths: string[],\n  tsConfigPath?: string\n): StepDefinitionMeta[] {\n  const configPath =\n    tsConfigPath ?? ts.findConfigFile(process.cwd(), ts.sys.fileExists);\n  let compilerOptions: ts.CompilerOptions = {\n    target: ts.ScriptTarget.ESNext,\n    module: ts.ModuleKind.ESNext,\n    moduleResolution: ts.ModuleResolutionKind.Node10,\n    strict: true,\n    esModuleInterop: true,\n  };\n\n  if (configPath) {\n    const configFile = ts.readConfigFile(configPath, ts.sys.readFile);\n    if (!configFile.error) {\n      const parsed = ts.parseJsonConfigFileContent(\n        configFile.config,\n        ts.sys,\n        configPath.replace(/[/\\\\][^/\\\\]+$/, \"\")\n      );\n      compilerOptions = parsed.options;\n    }\n  }\n\n  // Ensure noEmit so we don't write files\n  compilerOptions.noEmit = true;\n\n  const program = ts.createProgram(filePaths, compilerOptions);\n  const checker = program.getTypeChecker();\n  const results: StepDefinitionMeta[] = [];\n\n  for (const filePath of filePaths) {\n    const sourceFile = program.getSourceFile(filePath);\n    if (!sourceFile) continue;\n    const fileResults = extractFromSourceFile(sourceFile, checker);\n    results.push(...fileResults);\n  }\n\n  return results;\n}\n\nfunction extractFromSourceFile(\n  sourceFile: ts.SourceFile,\n  checker: ts.TypeChecker\n): StepDefinitionMeta[] {\n  const results: StepDefinitionMeta[] = [];\n\n  function visit(node: ts.Node) {\n    // Look for .register() call expressions\n    if (\n      ts.isCallExpression(node) &&\n      ts.isPropertyAccessExpression(node.expression) &&\n      node.expression.name.text === \"register\"\n    ) {\n      const meta = extractFromRegisterCall(node, sourceFile, checker);\n      if (meta) {\n        results.push(meta);\n      }\n    }\n    ts.forEachChild(node, visit);\n  }\n\n  visit(sourceFile);\n  return results;\n}\n\nfunction extractFromRegisterCall(\n  registerCall: ts.CallExpression,\n  sourceFile: ts.SourceFile,\n  checker: ts.TypeChecker\n): StepDefinitionMeta | null {\n  // Walk backwards through the method chain to find all parts\n  // Pattern: builder().statement(...).dependencies?(...).step(...).register()\n  // Or: Variable(\"...\").dependencies?(...).step(...).register()\n\n  const chain = collectCallChain(registerCall);\n\n  let stepType: StepType | null = null;\n  let expression: string | null = null;\n  let dependencies: StepDefinitionMeta[\"dependencies\"] = {\n    given: {},\n    when: {},\n    then: {},\n  };\n  let produces: string[] = [];\n\n  for (const link of chain) {\n    const name = getCallName(link);\n    if (!name) continue;\n\n    if (name === \"register\") {\n      // Already at register, continue\n      continue;\n    }\n\n    if (name === \"step\") {\n      produces = extractProducedKeys(link, checker);\n      continue;\n    }\n\n    if (name === \"dependencies\") {\n      dependencies = extractDependencies(link);\n      continue;\n    }\n\n    if (name === \"statement\") {\n      expression = extractExpression(link);\n      // Try to find the builder type by continuing up the chain\n      continue;\n    }\n\n    // Check if this is a builder call like givenBuilder()\n    if (BUILDER_NAMES[name]) {\n      stepType = BUILDER_NAMES[name];\n      continue;\n    }\n  }\n\n  // If we didn't find the builder or expression in the chain, try the \"re-exported\" pattern:\n  // const Given = givenBuilder<T>().statement;\n  // Given(\"foo\").step(...).register()\n  if (!stepType || !expression) {\n    const reExport = resolveReExportedCall(chain, checker);\n    if (reExport) {\n      if (!stepType) stepType = reExport.stepType;\n      if (!expression) expression = reExport.expression;\n    }\n  }\n\n  if (!stepType || !expression) {\n    return null;\n  }\n\n  const line =\n    sourceFile.getLineAndCharacterOfPosition(registerCall.getStart()).line + 1;\n\n  return {\n    stepType,\n    expression,\n    dependencies,\n    produces,\n    sourceFile: sourceFile.fileName,\n    line,\n  };\n}\n\n/**\n * Collect all call expressions in the method chain, from register() back to the origin.\n */\nfunction collectCallChain(call: ts.CallExpression): ts.CallExpression[] {\n  const chain: ts.CallExpression[] = [call];\n  let current: ts.Expression = call.expression;\n\n  while (true) {\n    // Walk through PropertyAccessExpression to find the next call\n    if (ts.isPropertyAccessExpression(current)) {\n      current = current.expression;\n    }\n\n    if (ts.isCallExpression(current)) {\n      chain.push(current);\n      current = current.expression;\n    } else {\n      break;\n    }\n  }\n\n  return chain;\n}\n\nfunction getCallName(call: ts.CallExpression): string | null {\n  const expr = call.expression;\n\n  // .method() pattern\n  if (ts.isPropertyAccessExpression(expr)) {\n    return expr.name.text;\n  }\n\n  // direct call: functionName()\n  if (ts.isIdentifier(expr)) {\n    return expr.text;\n  }\n\n  return null;\n}\n\nfunction extractExpression(statementCall: ts.CallExpression): string | null {\n  const arg = statementCall.arguments[0];\n  if (!arg) return null;\n\n  // String literal: .statement(\"a user\")\n  if (ts.isStringLiteral(arg)) {\n    return arg.text;\n  }\n\n  // Arrow function with template literal: .statement((name: string) => `a user named ${name}`)\n  if (ts.isArrowFunction(arg)) {\n    return extractExpressionFromArrowFunction(arg);\n  }\n\n  return null;\n}\n\nfunction extractExpressionFromArrowFunction(\n  fn: ts.ArrowFunction\n): string | null {\n  const params = fn.parameters.map((p) => p.name.getText());\n\n  // The body should be a template expression or string literal\n  let body = fn.body;\n\n  // If wrapped in a block with a return, unwrap\n  if (ts.isBlock(body)) {\n    const returnStmt = body.statements.find(ts.isReturnStatement);\n    if (returnStmt?.expression) {\n      body = returnStmt.expression;\n    } else {\n      return null;\n    }\n  }\n\n  if (ts.isTemplateExpression(body)) {\n    return reconstructExpressionFromTemplate(body, params);\n  }\n\n  if (ts.isNoSubstitutionTemplateLiteral(body)) {\n    return body.text;\n  }\n\n  return null;\n}\n\nfunction reconstructExpressionFromTemplate(\n  template: ts.TemplateExpression,\n  paramNames: string[]\n): string {\n  let result = template.head.text;\n\n  for (const span of template.templateSpans) {\n    if (ts.isIdentifier(span.expression) && paramNames.includes(span.expression.text)) {\n      result += \"{string}\";\n    } else {\n      // Non-parameter expression, use {string} as fallback\n      result += \"{string}\";\n    }\n    result += span.literal.text;\n  }\n\n  return result;\n}\n\nfunction extractDependencies(\n  depsCall: ts.CallExpression\n): StepDefinitionMeta[\"dependencies\"] {\n  const deps: StepDefinitionMeta[\"dependencies\"] = {\n    given: {},\n    when: {},\n    then: {},\n  };\n\n  const arg = depsCall.arguments[0];\n  if (!arg || !ts.isObjectLiteralExpression(arg)) return deps;\n\n  for (const prop of arg.properties) {\n    if (!ts.isPropertyAssignment(prop) || !ts.isIdentifier(prop.name))\n      continue;\n\n    const phase = prop.name.text as \"given\" | \"when\" | \"then\";\n    if (!deps[phase]) continue;\n\n    if (ts.isObjectLiteralExpression(prop.initializer)) {\n      for (const innerProp of prop.initializer.properties) {\n        if (\n          ts.isPropertyAssignment(innerProp) &&\n          ts.isIdentifier(innerProp.name) &&\n          ts.isStringLiteral(innerProp.initializer)\n        ) {\n          const val = innerProp.initializer.text;\n          if (val === \"required\" || val === \"optional\") {\n            deps[phase][innerProp.name.text] = val;\n          }\n        }\n      }\n    }\n  }\n\n  return deps;\n}\n\nfunction extractProducedKeys(\n  stepCall: ts.CallExpression,\n  checker: ts.TypeChecker\n): string[] {\n  const callback = stepCall.arguments[0];\n  if (!callback) return [];\n\n  // Try to get the return type of the callback by analyzing its body\n  if (ts.isArrowFunction(callback) || ts.isFunctionExpression(callback)) {\n    return extractProducedKeysFromCallback(callback, checker);\n  }\n\n  return [];\n}\n\nfunction extractProducedKeysFromCallback(\n  callback: ts.ArrowFunction | ts.FunctionExpression,\n  checker: ts.TypeChecker\n): string[] {\n  const body = callback.body;\n\n  // Concise arrow: () => ({ key: value })\n  if (!ts.isBlock(body)) {\n    return extractKeysFromExpression(body, checker);\n  }\n\n  // Block body: look at return statements\n  const keys = new Set<string>();\n  function visitReturn(node: ts.Node) {\n    if (ts.isReturnStatement(node) && node.expression) {\n      for (const key of extractKeysFromExpression(node.expression, checker)) {\n        keys.add(key);\n      }\n    }\n    ts.forEachChild(node, visitReturn);\n  }\n  visitReturn(body);\n  return [...keys];\n}\n\nfunction extractKeysFromExpression(\n  expr: ts.Expression,\n  checker: ts.TypeChecker\n): string[] {\n  // Unwrap parenthesized expressions\n  while (ts.isParenthesizedExpression(expr)) {\n    expr = expr.expression;\n  }\n\n  // Object literal: { user: ..., token: ... }\n  if (ts.isObjectLiteralExpression(expr)) {\n    return expr.properties\n      .filter(\n        (p): p is ts.PropertyAssignment | ts.ShorthandPropertyAssignment =>\n          ts.isPropertyAssignment(p) || ts.isShorthandPropertyAssignment(p)\n      )\n      .map((p) => p.name.getText())\n      .filter(Boolean);\n  }\n\n  // Try type checker as fallback\n  try {\n    const type = checker.getTypeAtLocation(expr);\n    return type\n      .getProperties()\n      .map((p) => p.name)\n      .filter((n) => n !== \"merge\");\n  } catch {\n    return [];\n  }\n}\n\ninterface ReExportResult {\n  stepType: StepType;\n  expression: string | null;\n}\n\nfunction resolveReExportedCall(\n  chain: ts.CallExpression[],\n  checker: ts.TypeChecker\n): ReExportResult | null {\n  // Look for the pattern: Variable(\"...\")... where Variable was assigned from builderType().statement\n  // The last call in the chain (furthest from register) should be the variable call\n\n  const lastCall = chain[chain.length - 1];\n  if (!lastCall) return null;\n\n  const expr = lastCall.expression;\n\n  // If it's an identifier (like \"Given\", \"When\", \"Then\"), trace its declaration\n  let identifier: ts.Identifier | null = null;\n  if (ts.isIdentifier(expr)) {\n    identifier = expr;\n  } else if (\n    ts.isPropertyAccessExpression(expr) &&\n    ts.isIdentifier(expr.expression)\n  ) {\n    identifier = expr.expression;\n  }\n\n  if (!identifier) return null;\n\n  const symbol = checker.getSymbolAtLocation(identifier);\n  if (!symbol) return null;\n\n  const decl = symbol.valueDeclaration;\n  if (!decl || !ts.isVariableDeclaration(decl) || !decl.initializer)\n    return null;\n\n  // Check if initializer is builderType<T>().statement\n  const init = decl.initializer;\n\n  // Pattern: givenBuilder<T>().statement  (PropertyAccessExpression)\n  if (ts.isPropertyAccessExpression(init) && init.name.text === \"statement\") {\n    const callExpr = init.expression;\n    if (ts.isCallExpression(callExpr)) {\n      const callee = callExpr.expression;\n      if (ts.isIdentifier(callee) && BUILDER_NAMES[callee.text]) {\n        // The lastCall IS the statement call — extract expression from it\n        const expression = extractExpression(lastCall);\n        return {\n          stepType: BUILDER_NAMES[callee.text],\n          expression,\n        };\n      }\n    }\n  }\n\n  return null;\n}\n","import * as fs from \"node:fs\";\nimport { GherkinClassicTokenMatcher, Parser, AstBuilder } from \"@cucumber/gherkin\";\nimport * as messages from \"@cucumber/messages\";\nimport { ParsedScenario, ParsedStep } from \"./types.js\";\n\ntype GherkinKeyword = \"Given\" | \"When\" | \"Then\" | \"And\" | \"But\";\n\nexport function parseFeatureFiles(filePaths: string[]): ParsedScenario[] {\n  const scenarios: ParsedScenario[] = [];\n\n  for (const filePath of filePaths) {\n    const content = fs.readFileSync(filePath, \"utf-8\");\n    const parsed = parseFeatureContent(content, filePath);\n    scenarios.push(...parsed);\n  }\n\n  return scenarios;\n}\n\nexport function parseFeatureContent(\n  content: string,\n  filePath: string\n): ParsedScenario[] {\n  const newId = messages.IdGenerator.uuid();\n  const builder = new AstBuilder(newId);\n  const matcher = new GherkinClassicTokenMatcher();\n  const parser = new Parser(builder, matcher);\n\n  const gherkinDocument: messages.GherkinDocument = parser.parse(content);\n  const feature = gherkinDocument.feature;\n  if (!feature) return [];\n\n  // Collect background steps at the feature level\n  const featureBackground: messages.Step[] = [];\n  const scenarios: ParsedScenario[] = [];\n\n  for (const child of feature.children) {\n    if (child.background) {\n      featureBackground.push(...child.background.steps);\n    }\n\n    if (child.scenario) {\n      scenarios.push(\n        ...expandScenario(child.scenario, featureBackground, filePath)\n      );\n    }\n\n    if (child.rule) {\n      // Rules can have their own backgrounds\n      const ruleBackground: messages.Step[] = [...featureBackground];\n      for (const ruleChild of child.rule.children) {\n        if (ruleChild.background) {\n          ruleBackground.push(...ruleChild.background.steps);\n        }\n        if (ruleChild.scenario) {\n          scenarios.push(\n            ...expandScenario(ruleChild.scenario, ruleBackground, filePath)\n          );\n        }\n      }\n    }\n  }\n\n  return scenarios;\n}\n\nfunction expandScenario(\n  scenario: messages.Scenario,\n  backgroundSteps: messages.Step[],\n  filePath: string\n): ParsedScenario[] {\n  const hasExamples =\n    scenario.examples.length > 0 &&\n    scenario.examples.some((e) => e.tableBody.length > 0);\n\n  if (!hasExamples) {\n    // Regular scenario\n    const bgParsed = convertSteps(backgroundSteps);\n    const scenarioParsed = convertSteps(scenario.steps);\n    const allSteps = resolveEffectiveKeywords([...bgParsed, ...scenarioParsed]);\n\n    return [\n      {\n        name: scenario.name,\n        file: filePath,\n        steps: allSteps,\n      },\n    ];\n  }\n\n  // Scenario Outline — expand with each example row\n  const results: ParsedScenario[] = [];\n  for (const example of scenario.examples) {\n    if (!example.tableHeader || example.tableBody.length === 0) continue;\n    const headers = example.tableHeader.cells.map((c) => c.value);\n\n    for (const row of example.tableBody) {\n      const values = row.cells.map((c) => c.value);\n      const substitution: Record<string, string> = {};\n      headers.forEach((h, i) => {\n        substitution[h] = values[i];\n      });\n\n      const bgParsed = convertSteps(backgroundSteps);\n      const scenarioSteps = convertSteps(scenario.steps).map((step) => ({\n        ...step,\n        text: substituteExampleValues(step.text, substitution),\n      }));\n      const allSteps = resolveEffectiveKeywords([...bgParsed, ...scenarioSteps]);\n\n      results.push({\n        name: `${scenario.name} (${values.join(\", \")})`,\n        file: filePath,\n        steps: allSteps,\n      });\n    }\n  }\n\n  return results;\n}\n\nfunction convertSteps(\n  steps: readonly messages.Step[]\n): Omit<ParsedStep, \"effectiveKeyword\">[] {\n  return steps.map((step) => ({\n    keyword: normalizeKeyword(step.keyword),\n    text: step.text,\n    line: step.location.line,\n    // step.location.column points to the keyword start; shift past the\n    // keyword (which includes a trailing space) so column points to the\n    // start of the step text. This makes `column + text.length` produce\n    // the correct end position for diagnostic ranges.\n    column: (step.location.column ?? 1) + step.keyword.length,\n  }));\n}\n\nfunction normalizeKeyword(keyword: string): GherkinKeyword {\n  const trimmed = keyword.trim();\n  // Gherkin keywords may include trailing space, e.g. \"Given \"\n  if (trimmed === \"Given\") return \"Given\";\n  if (trimmed === \"When\") return \"When\";\n  if (trimmed === \"Then\") return \"Then\";\n  if (trimmed === \"And\") return \"And\";\n  if (trimmed === \"But\") return \"But\";\n  // Fallback: treat as Given (shouldn't happen with valid Gherkin)\n  return \"Given\";\n}\n\nfunction resolveEffectiveKeywords(\n  steps: Omit<ParsedStep, \"effectiveKeyword\">[]\n): ParsedStep[] {\n  let lastEffective: \"Given\" | \"When\" | \"Then\" = \"Given\";\n\n  return steps.map((step) => {\n    let effectiveKeyword: \"Given\" | \"When\" | \"Then\";\n    if (step.keyword === \"And\" || step.keyword === \"But\") {\n      effectiveKeyword = lastEffective;\n    } else {\n      effectiveKeyword = step.keyword as \"Given\" | \"When\" | \"Then\";\n    }\n    lastEffective = effectiveKeyword;\n\n    return {\n      ...step,\n      effectiveKeyword,\n    };\n  });\n}\n\nfunction substituteExampleValues(\n  text: string,\n  substitution: Record<string, string>\n): string {\n  let result = text;\n  for (const [key, value] of Object.entries(substitution)) {\n    result = result.replace(new RegExp(`<${key}>`, \"g\"), value);\n  }\n  return result;\n}\n","import { MatchedStep, ParsedScenario, StepDefinitionMeta } from \"./types.js\";\n\ninterface CompiledPattern {\n  regex: RegExp;\n  definition: StepDefinitionMeta;\n}\n\nfunction compileDefinitions(\n  definitions: StepDefinitionMeta[]\n): CompiledPattern[] {\n  const compiled: CompiledPattern[] = [];\n  for (const def of definitions) {\n    try {\n      // Replace {paramType} placeholders with (.+) to match any value,\n      // regardless of which parser placeholder ({string}, {int}, ...) the\n      // step definition declared.\n      const placeholder = \"###PLACEHOLDER###\";\n      const regexStr = def.expression\n        .replace(/\\{[^}]+\\}/g, placeholder)\n        .replace(/[.*+?^$()|[\\]\\\\]/g, \"\\\\$&\")\n        .replace(new RegExp(placeholder, \"g\"), \"(.+)\");\n      compiled.push({\n        regex: new RegExp(`^${regexStr}$`, \"i\"),\n        definition: def,\n      });\n    } catch {\n      // Skip definitions with invalid expressions\n    }\n  }\n  return compiled;\n}\n\nexport function matchScenarioSteps(\n  scenario: ParsedScenario,\n  definitions: StepDefinitionMeta[]\n): MatchedStep[] {\n  const compiled = compileDefinitions(definitions);\n\n  return scenario.steps.map(step => {\n    const matches = findMatches(step.text, step.effectiveKeyword, compiled);\n    return {\n      ...step,\n      definitions: matches,\n    };\n  });\n}\n\nexport function findMatchingDefinitions(\n  text: string,\n  effectiveKeyword: \"Given\" | \"When\" | \"Then\",\n  definitions: StepDefinitionMeta[]\n): StepDefinitionMeta[] {\n  const compiled = compileDefinitions(definitions);\n  return findMatches(text, effectiveKeyword, compiled);\n}\n\nfunction findMatches(\n  text: string,\n  effectiveKeyword: \"Given\" | \"When\" | \"Then\",\n  compiled: CompiledPattern[]\n): StepDefinitionMeta[] {\n  const keywordToStepType: Record<string, string> = {\n    Given: \"given\",\n    When: \"when\",\n    Then: \"then\",\n  };\n  const expectedStepType = keywordToStepType[effectiveKeyword];\n\n  // First try to match with the correct step type\n  const typedMatches: StepDefinitionMeta[] = [];\n  for (const { regex, definition } of compiled) {\n    if (definition.stepType !== expectedStepType) continue;\n    if (regex.test(text)) typedMatches.push(definition);\n  }\n\n  if (typedMatches.length > 0) return typedMatches;\n\n  // Fallback: match any step type\n  const fallbackMatches: StepDefinitionMeta[] = [];\n  for (const { regex, definition } of compiled) {\n    if (regex.test(text)) fallbackMatches.push(definition);\n  }\n\n  return fallbackMatches;\n}\n","import {\n  AnalysisRule,\n  Diagnostic,\n  MatchedStep,\n  ParsedScenario,\n} from \"../types.js\";\n\nexport const ambiguousStepRule: AnalysisRule = {\n  name: \"ambiguous-step\",\n\n  check(\n    scenario: ParsedScenario,\n    matchedSteps: MatchedStep[]\n  ): Diagnostic[] {\n    return matchedSteps\n      .filter((step) => step.definitions.length > 1)\n      .map((step) => {\n        const locations = step.definitions\n          .map((d) => `${d.sourceFile}:${d.line}`)\n          .join(\", \");\n        return {\n          file: scenario.file,\n          range: {\n            startLine: step.line,\n            startColumn: step.column,\n            endLine: step.line,\n            endColumn: step.column + step.text.length,\n          },\n          severity: \"error\" as const,\n          message: `Step \"${step.text}\" matches multiple step definitions: ${locations}`,\n          rule: \"ambiguous-step\",\n          source: \"step-forge\" as const,\n        };\n      });\n  },\n};\n","import {\n  AnalysisRule,\n  Diagnostic,\n  MatchedStep,\n  ParsedScenario,\n} from \"../types.js\";\n\nexport const dependencyRule: AnalysisRule = {\n  name: \"dependency-check\",\n\n  check(\n    scenario: ParsedScenario,\n    matchedSteps: MatchedStep[]\n  ): Diagnostic[] {\n    const diagnostics: Diagnostic[] = [];\n    const produced = {\n      given: new Set<string>(),\n      when: new Set<string>(),\n      then: new Set<string>(),\n    };\n\n    for (const step of matchedSteps) {\n      if (step.definitions.length !== 1) continue;\n\n      const { dependencies, produces, stepType } = step.definitions[0];\n\n      // Collect all missing required dependencies for this step\n      const missing: Record<string, string[]> = {};\n      for (const phase of [\"given\", \"when\", \"then\"] as const) {\n        for (const [key, requirement] of Object.entries(dependencies[phase])) {\n          if (requirement === \"required\" && !produced[phase].has(key)) {\n            if (!missing[phase]) {\n              missing[phase] = [];\n            }\n            missing[phase].push(key);\n          }\n        }\n      }\n\n      if (Object.keys(missing).length > 0) {\n        const lines = Object.entries(missing).map(\n          ([phase, keys]) =>\n            `${phase.charAt(0).toUpperCase() + phase.slice(1)}: ${keys.map((k) => `${phase}.${k}`).join(\", \")}`\n        );\n        const message =\n          \"Missing required dependencies:\\n\" + lines.join(\"\\n\");\n\n        diagnostics.push({\n          file: scenario.file,\n          range: {\n            startLine: step.line,\n            startColumn: step.column,\n            endLine: step.line,\n            endColumn: step.column + step.text.length,\n          },\n          severity: \"error\",\n          message,\n          rule: \"dependency-check\",\n          source: \"step-forge\",\n        });\n      }\n\n      // Add produced keys for this step\n      for (const key of produces) {\n        produced[stepType].add(key);\n      }\n    }\n\n    return diagnostics;\n  },\n};\n","import {\n  AnalysisRule,\n  Diagnostic,\n  MatchedStep,\n  ParsedScenario,\n} from \"../types.js\";\n\nexport const undefinedStepRule: AnalysisRule = {\n  name: \"undefined-step\",\n\n  check(\n    scenario: ParsedScenario,\n    matchedSteps: MatchedStep[]\n  ): Diagnostic[] {\n    return matchedSteps\n      .filter((step) => step.definitions.length === 0)\n      .map((step) => ({\n        file: scenario.file,\n        range: {\n          startLine: step.line,\n          startColumn: step.column,\n          endLine: step.line,\n          endColumn: step.column + step.text.length,\n        },\n        severity: \"error\" as const,\n        message: `Step \"${step.text}\" does not match any step definition`,\n        rule: \"undefined-step\",\n        source: \"step-forge\" as const,\n      }));\n  },\n};\n","import {\n  AnalysisRule,\n  Diagnostic,\n  MatchedStep,\n  ParsedScenario,\n} from \"../types.js\";\nimport { ambiguousStepRule } from \"./ambiguousStepRule.js\";\nimport { dependencyRule } from \"./dependencyRule.js\";\nimport { undefinedStepRule } from \"./undefinedStepRule.js\";\n\nexport const defaultRules: AnalysisRule[] = [\n  undefinedStepRule,\n  ambiguousStepRule,\n  dependencyRule,\n];\n\nexport function runRules(\n  rules: AnalysisRule[],\n  scenario: ParsedScenario,\n  matchedSteps: MatchedStep[]\n): Diagnostic[] {\n  return rules.flatMap((rule) => rule.check(scenario, matchedSteps));\n}\n","import { glob } from \"node:fs/promises\";\nimport * as path from \"node:path\";\nimport { extractStepDefinitions } from \"./stepExtractor.js\";\nimport { parseFeatureFiles, parseFeatureContent } from \"./gherkinParser.js\";\nimport {\n  matchScenarioSteps,\n  findMatchingDefinitions,\n} from \"./stepMatcher.js\";\nimport { defaultRules, runRules } from \"./rules/index.js\";\nimport type {\n  AnalyzerConfig,\n  AnalysisRule,\n  Diagnostic,\n  StepDefinitionMeta,\n  ParsedScenario,\n  MatchedStep,\n  ParsedStep,\n} from \"./types.js\";\n\nexport type {\n  AnalyzerConfig,\n  AnalysisRule,\n  Diagnostic,\n  StepDefinitionMeta,\n  ParsedScenario,\n  MatchedStep,\n  ParsedStep,\n};\n\nexport {\n  extractStepDefinitions,\n  parseFeatureFiles,\n  parseFeatureContent,\n  matchScenarioSteps,\n  findMatchingDefinitions,\n  defaultRules,\n};\n\nexport interface AnalyzeOptions {\n  rules?: AnalysisRule[];\n}\n\nexport async function analyze(\n  config: AnalyzerConfig,\n  options?: AnalyzeOptions\n): Promise<Diagnostic[]> {\n  const rules = options?.rules ?? defaultRules;\n\n  // 1. Resolve file globs to paths\n  const stepFilePaths = await resolveGlobs(config.stepFiles);\n  const featureFilePaths = await resolveGlobs(config.featureFiles);\n\n  if (stepFilePaths.length === 0) {\n    return [];\n  }\n  if (featureFilePaths.length === 0) {\n    return [];\n  }\n\n  // 2. Extract step metadata from step files\n  const stepDefinitions = extractStepDefinitions(\n    stepFilePaths,\n    config.tsConfigPath\n  );\n\n  // 3. Parse feature files\n  const scenarios = parseFeatureFiles(featureFilePaths);\n\n  // 4. For each scenario, match steps and run rules\n  const diagnostics: Diagnostic[] = [];\n  for (const scenario of scenarios) {\n    const matchedSteps = matchScenarioSteps(scenario, stepDefinitions);\n    const scenarioDiags = runRules(rules, scenario, matchedSteps);\n    diagnostics.push(...scenarioDiags);\n  }\n\n  return diagnostics;\n}\n\nasync function resolveGlobs(patterns: string[]): Promise<string[]> {\n  const files: string[] = [];\n  for (const pattern of patterns) {\n    for await (const file of glob(pattern)) {\n      files.push(path.resolve(file));\n    }\n  }\n  // Deduplicate\n  return [...new Set(files)];\n}\n"],"mappings":";;;;;;;AAKA,MAAM,gBAA0C;CAC9C,cAAc;CACd,aAAa;CACb,aAAa;AACf;AAEA,SAAgB,uBACd,WACA,cACsB;CACtB,MAAM,aACJ,gBAAgB,GAAG,eAAe,QAAQ,IAAI,GAAG,GAAG,IAAI,UAAU;CACpE,IAAI,kBAAsC;EACxC,QAAQ,GAAG,aAAa;EACxB,QAAQ,GAAG,WAAW;EACtB,kBAAkB,GAAG,qBAAqB;EAC1C,QAAQ;EACR,iBAAiB;CACnB;CAEA,IAAI,YAAY;EACd,MAAM,aAAa,GAAG,eAAe,YAAY,GAAG,IAAI,QAAQ;EAChE,IAAI,CAAC,WAAW,OAMd,kBALe,GAAG,2BAChB,WAAW,QACX,GAAG,KACH,WAAW,QAAQ,iBAAiB,EAAE,CAEjB,EAAE;CAE7B;CAGA,gBAAgB,SAAS;CAEzB,MAAM,UAAU,GAAG,cAAc,WAAW,eAAe;CAC3D,MAAM,UAAU,QAAQ,eAAe;CACvC,MAAM,UAAgC,CAAC;CAEvC,KAAK,MAAM,YAAY,WAAW;EAChC,MAAM,aAAa,QAAQ,cAAc,QAAQ;EACjD,IAAI,CAAC,YAAY;EACjB,MAAM,cAAc,sBAAsB,YAAY,OAAO;EAC7D,QAAQ,KAAK,GAAG,WAAW;CAC7B;CAEA,OAAO;AACT;AAEA,SAAS,sBACP,YACA,SACsB;CACtB,MAAM,UAAgC,CAAC;CAEvC,SAAS,MAAM,MAAe;EAE5B,IACE,GAAG,iBAAiB,IAAI,KACxB,GAAG,2BAA2B,KAAK,UAAU,KAC7C,KAAK,WAAW,KAAK,SAAS,YAC9B;GACA,MAAM,OAAO,wBAAwB,MAAM,YAAY,OAAO;GAC9D,IAAI,MACF,QAAQ,KAAK,IAAI;EAErB;EACA,GAAG,aAAa,MAAM,KAAK;CAC7B;CAEA,MAAM,UAAU;CAChB,OAAO;AACT;AAEA,SAAS,wBACP,cACA,YACA,SAC2B;CAK3B,MAAM,QAAQ,iBAAiB,YAAY;CAE3C,IAAI,WAA4B;CAChC,IAAI,aAA4B;CAChC,IAAI,eAAmD;EACrD,OAAO,CAAC;EACR,MAAM,CAAC;EACP,MAAM,CAAC;CACT;CACA,IAAI,WAAqB,CAAC;CAE1B,KAAK,MAAM,QAAQ,OAAO;EACxB,MAAM,OAAO,YAAY,IAAI;EAC7B,IAAI,CAAC,MAAM;EAEX,IAAI,SAAS,YAEX;EAGF,IAAI,SAAS,QAAQ;GACnB,WAAW,oBAAoB,MAAM,OAAO;GAC5C;EACF;EAEA,IAAI,SAAS,gBAAgB;GAC3B,eAAe,oBAAoB,IAAI;GACvC;EACF;EAEA,IAAI,SAAS,aAAa;GACxB,aAAa,kBAAkB,IAAI;GAEnC;EACF;EAGA,IAAI,cAAc,OAAO;GACvB,WAAW,cAAc;GACzB;EACF;CACF;CAKA,IAAI,CAAC,YAAY,CAAC,YAAY;EAC5B,MAAM,WAAW,sBAAsB,OAAO,OAAO;EACrD,IAAI,UAAU;GACZ,IAAI,CAAC,UAAU,WAAW,SAAS;GACnC,IAAI,CAAC,YAAY,aAAa,SAAS;EACzC;CACF;CAEA,IAAI,CAAC,YAAY,CAAC,YAChB,OAAO;CAGT,MAAM,OACJ,WAAW,8BAA8B,aAAa,SAAS,CAAC,EAAE,OAAO;CAE3E,OAAO;EACL;EACA;EACA;EACA;EACA,YAAY,WAAW;EACvB;CACF;AACF;;;;AAKA,SAAS,iBAAiB,MAA8C;CACtE,MAAM,QAA6B,CAAC,IAAI;CACxC,IAAI,UAAyB,KAAK;CAElC,OAAO,MAAM;EAEX,IAAI,GAAG,2BAA2B,OAAO,GACvC,UAAU,QAAQ;EAGpB,IAAI,GAAG,iBAAiB,OAAO,GAAG;GAChC,MAAM,KAAK,OAAO;GAClB,UAAU,QAAQ;EACpB,OACE;CAEJ;CAEA,OAAO;AACT;AAEA,SAAS,YAAY,MAAwC;CAC3D,MAAM,OAAO,KAAK;CAGlB,IAAI,GAAG,2BAA2B,IAAI,GACpC,OAAO,KAAK,KAAK;CAInB,IAAI,GAAG,aAAa,IAAI,GACtB,OAAO,KAAK;CAGd,OAAO;AACT;AAEA,SAAS,kBAAkB,eAAiD;CAC1E,MAAM,MAAM,cAAc,UAAU;CACpC,IAAI,CAAC,KAAK,OAAO;CAGjB,IAAI,GAAG,gBAAgB,GAAG,GACxB,OAAO,IAAI;CAIb,IAAI,GAAG,gBAAgB,GAAG,GACxB,OAAO,mCAAmC,GAAG;CAG/C,OAAO;AACT;AAEA,SAAS,mCACP,IACe;CACf,MAAM,SAAS,GAAG,WAAW,KAAK,MAAM,EAAE,KAAK,QAAQ,CAAC;CAGxD,IAAI,OAAO,GAAG;CAGd,IAAI,GAAG,QAAQ,IAAI,GAAG;EACpB,MAAM,aAAa,KAAK,WAAW,KAAK,GAAG,iBAAiB;EAC5D,IAAI,YAAY,YACd,OAAO,WAAW;OAElB,OAAO;CAEX;CAEA,IAAI,GAAG,qBAAqB,IAAI,GAC9B,OAAO,kCAAkC,MAAM,MAAM;CAGvD,IAAI,GAAG,gCAAgC,IAAI,GACzC,OAAO,KAAK;CAGd,OAAO;AACT;AAEA,SAAS,kCACP,UACA,YACQ;CACR,IAAI,SAAS,SAAS,KAAK;CAE3B,KAAK,MAAM,QAAQ,SAAS,eAAe;EACzC,IAAI,GAAG,aAAa,KAAK,UAAU,KAAK,WAAW,SAAS,KAAK,WAAW,IAAI,GAC9E,UAAU;OAGV,UAAU;EAEZ,UAAU,KAAK,QAAQ;CACzB;CAEA,OAAO;AACT;AAEA,SAAS,oBACP,UACoC;CACpC,MAAM,OAA2C;EAC/C,OAAO,CAAC;EACR,MAAM,CAAC;EACP,MAAM,CAAC;CACT;CAEA,MAAM,MAAM,SAAS,UAAU;CAC/B,IAAI,CAAC,OAAO,CAAC,GAAG,0BAA0B,GAAG,GAAG,OAAO;CAEvD,KAAK,MAAM,QAAQ,IAAI,YAAY;EACjC,IAAI,CAAC,GAAG,qBAAqB,IAAI,KAAK,CAAC,GAAG,aAAa,KAAK,IAAI,GAC9D;EAEF,MAAM,QAAQ,KAAK,KAAK;EACxB,IAAI,CAAC,KAAK,QAAQ;EAElB,IAAI,GAAG,0BAA0B,KAAK,WAAW;QAC1C,MAAM,aAAa,KAAK,YAAY,YACvC,IACE,GAAG,qBAAqB,SAAS,KACjC,GAAG,aAAa,UAAU,IAAI,KAC9B,GAAG,gBAAgB,UAAU,WAAW,GACxC;IACA,MAAM,MAAM,UAAU,YAAY;IAClC,IAAI,QAAQ,cAAc,QAAQ,YAChC,KAAK,OAAO,UAAU,KAAK,QAAQ;GAEvC;;CAGN;CAEA,OAAO;AACT;AAEA,SAAS,oBACP,UACA,SACU;CACV,MAAM,WAAW,SAAS,UAAU;CACpC,IAAI,CAAC,UAAU,OAAO,CAAC;CAGvB,IAAI,GAAG,gBAAgB,QAAQ,KAAK,GAAG,qBAAqB,QAAQ,GAClE,OAAO,gCAAgC,UAAU,OAAO;CAG1D,OAAO,CAAC;AACV;AAEA,SAAS,gCACP,UACA,SACU;CACV,MAAM,OAAO,SAAS;CAGtB,IAAI,CAAC,GAAG,QAAQ,IAAI,GAClB,OAAO,0BAA0B,MAAM,OAAO;CAIhD,MAAM,uBAAO,IAAI,IAAY;CAC7B,SAAS,YAAY,MAAe;EAClC,IAAI,GAAG,kBAAkB,IAAI,KAAK,KAAK,YACrC,KAAK,MAAM,OAAO,0BAA0B,KAAK,YAAY,OAAO,GAClE,KAAK,IAAI,GAAG;EAGhB,GAAG,aAAa,MAAM,WAAW;CACnC;CACA,YAAY,IAAI;CAChB,OAAO,CAAC,GAAG,IAAI;AACjB;AAEA,SAAS,0BACP,MACA,SACU;CAEV,OAAO,GAAG,0BAA0B,IAAI,GACtC,OAAO,KAAK;CAId,IAAI,GAAG,0BAA0B,IAAI,GACnC,OAAO,KAAK,WACT,QACE,MACC,GAAG,qBAAqB,CAAC,KAAK,GAAG,8BAA8B,CAAC,CACpE,EACC,KAAK,MAAM,EAAE,KAAK,QAAQ,CAAC,EAC3B,OAAO,OAAO;CAInB,IAAI;EAEF,OADa,QAAQ,kBAAkB,IAC7B,EACP,cAAc,EACd,KAAK,MAAM,EAAE,IAAI,EACjB,QAAQ,MAAM,MAAM,OAAO;CAChC,QAAQ;EACN,OAAO,CAAC;CACV;AACF;AAOA,SAAS,sBACP,OACA,SACuB;CAIvB,MAAM,WAAW,MAAM,MAAM,SAAS;CACtC,IAAI,CAAC,UAAU,OAAO;CAEtB,MAAM,OAAO,SAAS;CAGtB,IAAI,aAAmC;CACvC,IAAI,GAAG,aAAa,IAAI,GACtB,aAAa;MACR,IACL,GAAG,2BAA2B,IAAI,KAClC,GAAG,aAAa,KAAK,UAAU,GAE/B,aAAa,KAAK;CAGpB,IAAI,CAAC,YAAY,OAAO;CAExB,MAAM,SAAS,QAAQ,oBAAoB,UAAU;CACrD,IAAI,CAAC,QAAQ,OAAO;CAEpB,MAAM,OAAO,OAAO;CACpB,IAAI,CAAC,QAAQ,CAAC,GAAG,sBAAsB,IAAI,KAAK,CAAC,KAAK,aACpD,OAAO;CAGT,MAAM,OAAO,KAAK;CAGlB,IAAI,GAAG,2BAA2B,IAAI,KAAK,KAAK,KAAK,SAAS,aAAa;EACzE,MAAM,WAAW,KAAK;EACtB,IAAI,GAAG,iBAAiB,QAAQ,GAAG;GACjC,MAAM,SAAS,SAAS;GACxB,IAAI,GAAG,aAAa,MAAM,KAAK,cAAc,OAAO,OAAO;IAEzD,MAAM,aAAa,kBAAkB,QAAQ;IAC7C,OAAO;KACL,UAAU,cAAc,OAAO;KAC/B;IACF;GACF;EACF;CACF;CAEA,OAAO;AACT;;;ACxaA,SAAgB,kBAAkB,WAAuC;CACvE,MAAM,YAA8B,CAAC;CAErC,KAAK,MAAM,YAAY,WAAW;EAEhC,MAAM,SAAS,oBADC,GAAG,aAAa,UAAU,OACD,GAAG,QAAQ;EACpD,UAAU,KAAK,GAAG,MAAM;CAC1B;CAEA,OAAO;AACT;AAEA,SAAgB,oBACd,SACA,UACkB;CAOlB,MAAM,UAD4C,IAF/B,OAAO,IAFN,WADN,SAAS,YAAY,KACA,CAEH,GAAG,IADf,2BACqB,CAEc,EAAE,MAAM,OACjC,EAAE;CAChC,IAAI,CAAC,SAAS,OAAO,CAAC;CAGtB,MAAM,oBAAqC,CAAC;CAC5C,MAAM,YAA8B,CAAC;CAErC,KAAK,MAAM,SAAS,QAAQ,UAAU;EACpC,IAAI,MAAM,YACR,kBAAkB,KAAK,GAAG,MAAM,WAAW,KAAK;EAGlD,IAAI,MAAM,UACR,UAAU,KACR,GAAG,eAAe,MAAM,UAAU,mBAAmB,QAAQ,CAC/D;EAGF,IAAI,MAAM,MAAM;GAEd,MAAM,iBAAkC,CAAC,GAAG,iBAAiB;GAC7D,KAAK,MAAM,aAAa,MAAM,KAAK,UAAU;IAC3C,IAAI,UAAU,YACZ,eAAe,KAAK,GAAG,UAAU,WAAW,KAAK;IAEnD,IAAI,UAAU,UACZ,UAAU,KACR,GAAG,eAAe,UAAU,UAAU,gBAAgB,QAAQ,CAChE;GAEJ;EACF;CACF;CAEA,OAAO;AACT;AAEA,SAAS,eACP,UACA,iBACA,UACkB;CAKlB,IAAI,EAHF,SAAS,SAAS,SAAS,KAC3B,SAAS,SAAS,MAAM,MAAM,EAAE,UAAU,SAAS,CAAC,IAEpC;EAEhB,MAAM,WAAW,aAAa,eAAe;EAC7C,MAAM,iBAAiB,aAAa,SAAS,KAAK;EAClD,MAAM,WAAW,yBAAyB,CAAC,GAAG,UAAU,GAAG,cAAc,CAAC;EAE1E,OAAO,CACL;GACE,MAAM,SAAS;GACf,MAAM;GACN,OAAO;EACT,CACF;CACF;CAGA,MAAM,UAA4B,CAAC;CACnC,KAAK,MAAM,WAAW,SAAS,UAAU;EACvC,IAAI,CAAC,QAAQ,eAAe,QAAQ,UAAU,WAAW,GAAG;EAC5D,MAAM,UAAU,QAAQ,YAAY,MAAM,KAAK,MAAM,EAAE,KAAK;EAE5D,KAAK,MAAM,OAAO,QAAQ,WAAW;GACnC,MAAM,SAAS,IAAI,MAAM,KAAK,MAAM,EAAE,KAAK;GAC3C,MAAM,eAAuC,CAAC;GAC9C,QAAQ,SAAS,GAAG,MAAM;IACxB,aAAa,KAAK,OAAO;GAC3B,CAAC;GAED,MAAM,WAAW,aAAa,eAAe;GAC7C,MAAM,gBAAgB,aAAa,SAAS,KAAK,EAAE,KAAK,UAAU;IAChE,GAAG;IACH,MAAM,wBAAwB,KAAK,MAAM,YAAY;GACvD,EAAE;GACF,MAAM,WAAW,yBAAyB,CAAC,GAAG,UAAU,GAAG,aAAa,CAAC;GAEzE,QAAQ,KAAK;IACX,MAAM,GAAG,SAAS,KAAK,IAAI,OAAO,KAAK,IAAI,EAAE;IAC7C,MAAM;IACN,OAAO;GACT,CAAC;EACH;CACF;CAEA,OAAO;AACT;AAEA,SAAS,aACP,OACwC;CACxC,OAAO,MAAM,KAAK,UAAU;EAC1B,SAAS,iBAAiB,KAAK,OAAO;EACtC,MAAM,KAAK;EACX,MAAM,KAAK,SAAS;EAKpB,SAAS,KAAK,SAAS,UAAU,KAAK,KAAK,QAAQ;CACrD,EAAE;AACJ;AAEA,SAAS,iBAAiB,SAAiC;CACzD,MAAM,UAAU,QAAQ,KAAK;CAE7B,IAAI,YAAY,SAAS,OAAO;CAChC,IAAI,YAAY,QAAQ,OAAO;CAC/B,IAAI,YAAY,QAAQ,OAAO;CAC/B,IAAI,YAAY,OAAO,OAAO;CAC9B,IAAI,YAAY,OAAO,OAAO;CAE9B,OAAO;AACT;AAEA,SAAS,yBACP,OACc;CACd,IAAI,gBAA2C;CAE/C,OAAO,MAAM,KAAK,SAAS;EACzB,IAAI;EACJ,IAAI,KAAK,YAAY,SAAS,KAAK,YAAY,OAC7C,mBAAmB;OAEnB,mBAAmB,KAAK;EAE1B,gBAAgB;EAEhB,OAAO;GACL,GAAG;GACH;EACF;CACF,CAAC;AACH;AAEA,SAAS,wBACP,MACA,cACQ;CACR,IAAI,SAAS;CACb,KAAK,MAAM,CAAC,KAAK,UAAU,OAAO,QAAQ,YAAY,GACpD,SAAS,OAAO,QAAQ,IAAI,OAAO,IAAI,IAAI,IAAI,GAAG,GAAG,KAAK;CAE5D,OAAO;AACT;;;AC3KA,SAAS,mBACP,aACmB;CACnB,MAAM,WAA8B,CAAC;CACrC,KAAK,MAAM,OAAO,aAChB,IAAI;EAIF,MAAM,cAAc;EACpB,MAAM,WAAW,IAAI,WAClB,QAAQ,cAAc,WAAW,EACjC,QAAQ,qBAAqB,MAAM,EACnC,QAAQ,IAAI,OAAO,aAAa,GAAG,GAAG,MAAM;EAC/C,SAAS,KAAK;GACZ,OAAO,IAAI,OAAO,IAAI,SAAS,IAAI,GAAG;GACtC,YAAY;EACd,CAAC;CACH,QAAQ,CAER;CAEF,OAAO;AACT;AAEA,SAAgB,mBACd,UACA,aACe;CACf,MAAM,WAAW,mBAAmB,WAAW;CAE/C,OAAO,SAAS,MAAM,KAAI,SAAQ;EAChC,MAAM,UAAU,YAAY,KAAK,MAAM,KAAK,kBAAkB,QAAQ;EACtE,OAAO;GACL,GAAG;GACH,aAAa;EACf;CACF,CAAC;AACH;AAEA,SAAgB,wBACd,MACA,kBACA,aACsB;CAEtB,OAAO,YAAY,MAAM,kBADR,mBAAmB,WACc,CAAC;AACrD;AAEA,SAAS,YACP,MACA,kBACA,UACsB;CAMtB,MAAM,mBAAmB;EAJvB,OAAO;EACP,MAAM;EACN,MAAM;CAEiC,EAAE;CAG3C,MAAM,eAAqC,CAAC;CAC5C,KAAK,MAAM,EAAE,OAAO,gBAAgB,UAAU;EAC5C,IAAI,WAAW,aAAa,kBAAkB;EAC9C,IAAI,MAAM,KAAK,IAAI,GAAG,aAAa,KAAK,UAAU;CACpD;CAEA,IAAI,aAAa,SAAS,GAAG,OAAO;CAGpC,MAAM,kBAAwC,CAAC;CAC/C,KAAK,MAAM,EAAE,OAAO,gBAAgB,UAClC,IAAI,MAAM,KAAK,IAAI,GAAG,gBAAgB,KAAK,UAAU;CAGvD,OAAO;AACT;;;AI1EA,MAAa,eAA+B;CAC1C;EDHA,MAAM;EAEN,MACE,UACA,cACc;GACd,OAAO,aACJ,QAAQ,SAAS,KAAK,YAAY,WAAW,CAAC,EAC9C,KAAK,UAAU;IACd,MAAM,SAAS;IACf,OAAO;KACL,WAAW,KAAK;KAChB,aAAa,KAAK;KAClB,SAAS,KAAK;KACd,WAAW,KAAK,SAAS,KAAK,KAAK;IACrC;IACA,UAAU;IACV,SAAS,SAAS,KAAK,KAAK;IAC5B,MAAM;IACN,QAAQ;GACV,EAAE;EACN;CClBA;CACA;EHJA,MAAM;EAEN,MACE,UACA,cACc;GACd,OAAO,aACJ,QAAQ,SAAS,KAAK,YAAY,SAAS,CAAC,EAC5C,KAAK,SAAS;IACb,MAAM,YAAY,KAAK,YACpB,KAAK,MAAM,GAAG,EAAE,WAAW,GAAG,EAAE,MAAM,EACtC,KAAK,IAAI;IACZ,OAAO;KACL,MAAM,SAAS;KACf,OAAO;MACL,WAAW,KAAK;MAChB,aAAa,KAAK;MAClB,SAAS,KAAK;MACd,WAAW,KAAK,SAAS,KAAK,KAAK;KACrC;KACA,UAAU;KACV,SAAS,SAAS,KAAK,KAAK,uCAAuC;KACnE,MAAM;KACN,QAAQ;IACV;GACF,CAAC;EACL;CGtBA;CACA;EFLA,MAAM;EAEN,MACE,UACA,cACc;GACd,MAAM,cAA4B,CAAC;GACnC,MAAM,WAAW;IACf,uBAAO,IAAI,IAAY;IACvB,sBAAM,IAAI,IAAY;IACtB,sBAAM,IAAI,IAAY;GACxB;GAEA,KAAK,MAAM,QAAQ,cAAc;IAC/B,IAAI,KAAK,YAAY,WAAW,GAAG;IAEnC,MAAM,EAAE,cAAc,UAAU,aAAa,KAAK,YAAY;IAG9D,MAAM,UAAoC,CAAC;IAC3C,KAAK,MAAM,SAAS;KAAC;KAAS;KAAQ;IAAM,GAC1C,KAAK,MAAM,CAAC,KAAK,gBAAgB,OAAO,QAAQ,aAAa,MAAM,GACjE,IAAI,gBAAgB,cAAc,CAAC,SAAS,OAAO,IAAI,GAAG,GAAG;KAC3D,IAAI,CAAC,QAAQ,QACX,QAAQ,SAAS,CAAC;KAEpB,QAAQ,OAAO,KAAK,GAAG;IACzB;IAIJ,IAAI,OAAO,KAAK,OAAO,EAAE,SAAS,GAAG;KAKnC,MAAM,UACJ,qCALY,OAAO,QAAQ,OAAO,EAAE,KACnC,CAAC,OAAO,UACP,GAAG,MAAM,OAAO,CAAC,EAAE,YAAY,IAAI,MAAM,MAAM,CAAC,EAAE,IAAI,KAAK,KAAK,MAAM,GAAG,MAAM,GAAG,GAAG,EAAE,KAAK,IAAI,GAGzD,EAAE,KAAK,IAAI;KAEtD,YAAY,KAAK;MACf,MAAM,SAAS;MACf,OAAO;OACL,WAAW,KAAK;OAChB,aAAa,KAAK;OAClB,SAAS,KAAK;OACd,WAAW,KAAK,SAAS,KAAK,KAAK;MACrC;MACA,UAAU;MACV;MACA,MAAM;MACN,QAAQ;KACV,CAAC;IACH;IAGA,KAAK,MAAM,OAAO,UAChB,SAAS,UAAU,IAAI,GAAG;GAE9B;GAEA,OAAO;EACT;CExDA;AACF;AAEA,SAAgB,SACd,OACA,UACA,cACc;CACd,OAAO,MAAM,SAAS,SAAS,KAAK,MAAM,UAAU,YAAY,CAAC;AACnE;;;ACoBA,eAAsB,QACpB,QACA,SACuB;CACvB,MAAM,QAAQ,SAAS,SAAS;CAGhC,MAAM,gBAAgB,MAAM,aAAa,OAAO,SAAS;CACzD,MAAM,mBAAmB,MAAM,aAAa,OAAO,YAAY;CAE/D,IAAI,cAAc,WAAW,GAC3B,OAAO,CAAC;CAEV,IAAI,iBAAiB,WAAW,GAC9B,OAAO,CAAC;CAIV,MAAM,kBAAkB,uBACtB,eACA,OAAO,YACT;CAGA,MAAM,YAAY,kBAAkB,gBAAgB;CAGpD,MAAM,cAA4B,CAAC;CACnC,KAAK,MAAM,YAAY,WAAW;EAEhC,MAAM,gBAAgB,SAAS,OAAO,UADjB,mBAAmB,UAAU,eACS,CAAC;EAC5D,YAAY,KAAK,GAAG,aAAa;CACnC;CAEA,OAAO;AACT;AAEA,eAAe,aAAa,UAAuC;CACjE,MAAM,QAAkB,CAAC;CACzB,KAAK,MAAM,WAAW,UACpB,WAAW,MAAM,QAAQ,KAAK,OAAO,GACnC,MAAM,KAAK,KAAK,QAAQ,IAAI,CAAC;CAIjC,OAAO,CAAC,GAAG,IAAI,IAAI,KAAK,CAAC;AAC3B"}

package/dist/step-forge.cjs

@@ -37,6 +37,28 @@ _cucumber_messages = __toESM(_cucumber_messages, 1);
 //#region src/builderTypeUtils.ts
 const isString = (statement) => typeof statement === "string";
 //#endregion
+//#region src/parsers.ts
+/** Matches a quoted string (`{string}`) and passes the unquoted contents through. */
+const stringParser = {
+	parse: (value) => String(value),
+	gherkin: "{string}"
+};
+/** Matches an unquoted integer (`{int}`). */
+const intParser = {
+	parse: (value) => typeof value === "number" ? value : parseInt(String(value), 10),
+	gherkin: "{int}"
+};
+/** Matches an unquoted floating point number (`{float}`). */
+const numberParser = {
+	parse: (value) => typeof value === "number" ? value : parseFloat(String(value)),
+	gherkin: "{float}"
+};
+/** Matches an unquoted `true`/`false` word (`{word}`) and parses it to a boolean. */
+const booleanParser = {
+	parse: (value) => value === true || value === "true",
+	gherkin: "{word}"
+};
+//#endregion
 //#region src/utils.ts
 const requireFromGiven = (keys, world) => {
 	keys.forEach((key) => {
@@ -71,13 +93,6 @@ const requireFromThen = (keys, world) => {
 		};
 	}, {});
 };
-const typeCoercer = (value) => {
-	const numberValue = parseInt(value, 10);
-	if (!isNaN(numberValue)) return numberValue;
-	if (value === "true") return true;
-	if (value === "false") return false;
-	return value;
-};
 //#endregion
 //#region src/common.ts
 const cucFunctionMap = {
@@ -89,19 +104,21 @@ const addStep = (statement, stepType, dependencies = {
 	given: {},
 	when: {},
 	then: {}
-}) => (stepFunction) => {
+}, declaredParsers) => (stepFunction) => {
 	const statementFunction = statement;
 	const { given: givenDependencies, when: whenDependencies, then: thenDependencies } = dependencies;
+	const argCount = statementFunction.length;
+	const parsers = declaredParsers ?? Array.from({ length: argCount }, () => stringParser);
+	const expression = statementFunction(...parsers.map((parser) => parser.gherkin));
 	return {
 		statement,
+		expression,
 		dependencies,
 		stepType,
 		stepFunction,
 		register: () => {
-			const argCount = statementFunction.length;
-			const statement = statementFunction(...Array.from({ length: argCount }, () => "{string}"));
 			const cucStepFunction = Object.defineProperty(async function(...args) {
-				const coercedArgs = args.map(typeCoercer);
+				const coercedArgs = parsers.map((parser, index) => parser.parse(args[index]));
 				const ensuredGivenValues = requireFromGiven(Object.entries(givenDependencies ?? {}).filter(([, value]) => value === "required").map(([key]) => key), this);
 				const narrowedGiven = {
 					...lodash.default.pick(this.given, Object.keys(givenDependencies ?? {})),
@@ -128,9 +145,10 @@ const addStep = (statement, stepType, dependencies = {
 				configurable: true
 			});
 			const cucStep = cucFunctionMap[stepType];
-			cucStep(statement, cucStepFunction);
+			cucStep(expression, cucStepFunction);
 			return {
 				stepType,
+				expression,
 				dependencies,
 				statement: statementFunction,
 				stepFunction
@@ -140,12 +158,18 @@ const addStep = (statement, stepType, dependencies = {
 };
 //#endregion
 //#region src/given.ts
-const givenDependencies = (statement, stepType) => (dependencies) => {
+const givenDependencies = (statement, stepType, parsers) => (dependencies) => {
 	return { step: addStep(statement, stepType, {
 		...dependencies,
 		when: {},
 		then: {}
-	}) };
+	}, parsers) };
+};
+const givenParsers = (statement, stepType) => (parsers) => {
+	return {
+		dependencies: givenDependencies(statement, stepType, parsers),
+		step: addStep(statement, stepType, void 0, parsers)
+	};
 };
 const givenStatement = (stepType) => (statement) => {
 	let normalizedStatement;
@@ -153,6 +177,7 @@ const givenStatement = (stepType) => (statement) => {
 	else normalizedStatement = statement;
 	return {
 		dependencies: givenDependencies(normalizedStatement, stepType),
+		parsers: givenParsers(normalizedStatement, stepType),
 		step: addStep(normalizedStatement, stepType)
 	};
 };
@@ -161,12 +186,18 @@ const givenBuilder = () => {
 };
 //#endregion
 //#region src/when.ts
-const whenDependencies = (statement, stepType) => (dependencies) => {
+const whenDependencies = (statement, stepType, parsers) => (dependencies) => {
 	return { step: addStep(statement, stepType, {
 		given: dependencies.given ?? {},
 		when: dependencies.when ?? {},
 		then: {}
-	}) };
+	}, parsers) };
+};
+const whenParsers = (statement, stepType) => (parsers) => {
+	return {
+		dependencies: whenDependencies(statement, stepType, parsers),
+		step: addStep(statement, stepType, void 0, parsers)
+	};
 };
 const whenStatement = (stepType) => (statement) => {
 	let normalizedStatement;
@@ -174,6 +205,7 @@ const whenStatement = (stepType) => (statement) => {
 	else normalizedStatement = statement;
 	return {
 		dependencies: whenDependencies(normalizedStatement, stepType),
+		parsers: whenParsers(normalizedStatement, stepType),
 		step: addStep(normalizedStatement, stepType)
 	};
 };
@@ -182,12 +214,18 @@ const whenBuilder = () => {
 };
 //#endregion
 //#region src/then.ts
-const thenDependencies = (statement, stepType) => (dependencies) => {
+const thenDependencies = (statement, stepType, parsers) => (dependencies) => {
 	return { step: addStep(statement, stepType, {
 		given: dependencies.given ?? {},
 		when: dependencies.when ?? {},
 		then: dependencies.then ?? {}
-	}) };
+	}, parsers) };
+};
+const thenParsers = (statement, stepType) => (parsers) => {
+	return {
+		dependencies: thenDependencies(statement, stepType, parsers),
+		step: addStep(statement, stepType, void 0, parsers)
+	};
 };
 const thenStatement = (stepType) => (statement) => {
 	let normalizedStatement;
@@ -195,6 +233,7 @@ const thenStatement = (stepType) => (statement) => {
 	else normalizedStatement = statement;
 	return {
 		dependencies: thenDependencies(normalizedStatement, stepType),
+		parsers: thenParsers(normalizedStatement, stepType),
 		step: addStep(normalizedStatement, stepType)
 	};
 };
@@ -720,7 +759,11 @@ const analyzer = {
 //#endregion
 exports.BasicWorld = BasicWorld;
 exports.analyzer = analyzer;
+exports.booleanParser = booleanParser;
 exports.givenBuilder = givenBuilder;
+exports.intParser = intParser;
+exports.numberParser = numberParser;
+exports.stringParser = stringParser;
 exports.thenBuilder = thenBuilder;
 exports.whenBuilder = whenBuilder;