@step-forge/step-forge 0.0.25-alpha.3 → 0.0.25-alpha.4

package/dist/{analyzer-gYyAKIpM.js → analyzer-5H699Eg4.js}

@@ -4,6 +4,7 @@ import ts from "typescript";
 import * as fs from "node:fs";
 import { AstBuilder, GherkinClassicTokenMatcher, Parser } from "@cucumber/gherkin";
 import * as messages from "@cucumber/messages";
+import { CucumberExpression, ParameterType, ParameterTypeRegistry } from "@cucumber/cucumber-expressions";
 //#region src/globFiles.ts
 /** Glob metacharacters. A pattern with none of these is a literal path. */
 const MAGIC = /[*?[\]{}!()]/;
@@ -43,6 +44,21 @@ const BUILDER_NAMES = {
 	whenBuilder: "when",
 	thenBuilder: "then"
 };
+/**
+* Built-in parsers exported by the library, mapped to the cucumber-expression
+* placeholder they register. A step's `.parsers([...])` drives which `{name}`
+* each variable becomes; without this the extractor defaulted every variable to
+* `{string}`, so `the deposit amount is {int}` was recorded as `{string}` and a
+* plain number like `100` looked unmatched. Custom parsers are resolved from
+* their `name` property (see {@link resolveCustomParserName}); anything we can't
+* resolve falls back to `string`.
+*/
+const BUILTIN_PARSER_PLACEHOLDERS = {
+	intParser: "int",
+	numberParser: "float",
+	stringParser: "string",
+	booleanParser: "boolean"
+};
 function extractStepDefinitions(filePaths, tsConfigPath) {
 	const fast = extractWithSources(filePaths.map(parseSourceFile).filter((s) => s !== null), null);
 	if (!fast.needsChecker) return fast.results;
@@ -101,6 +117,7 @@ function extractFromSourceFile(sourceFile, ctx) {
 function extractFromRegisterCall(registerCall, sourceFile, ctx) {
 	const chain = collectCallChain(registerCall);
 	let stepType = null;
+	let statementCall = null;
 	let expression = null;
 	let dependencies = {
 		given: {},
@@ -108,6 +125,7 @@ function extractFromRegisterCall(registerCall, sourceFile, ctx) {
 		then: {}
 	};
 	let produces = [];
+	let placeholders = null;
 	for (const link of chain) {
 		const name = getCallName(link);
 		if (!name) continue;
@@ -120,8 +138,12 @@ function extractFromRegisterCall(registerCall, sourceFile, ctx) {
 			dependencies = extractDependencies(link);
 			continue;
 		}
+		if (name === "parsers") {
+			placeholders = resolveParserPlaceholders(link, sourceFile);
+			continue;
+		}
 		if (name === "statement") {
-			expression = extractExpression(link);
+			statementCall = link;
 			continue;
 		}
 		if (BUILDER_NAMES[name]) {
@@ -129,6 +151,7 @@ function extractFromRegisterCall(registerCall, sourceFile, ctx) {
 			continue;
 		}
 	}
+	if (statementCall) expression = extractExpression(statementCall, placeholders);
 	if (!stepType || !expression) {
 		const reExport = resolveReExportedCall(chain, ctx);
 		if (reExport) {
@@ -168,14 +191,14 @@ function getCallName(call) {
 	if (ts.isIdentifier(expr)) return expr.text;
 	return null;
 }
-function extractExpression(statementCall) {
+function extractExpression(statementCall, placeholders) {
 	const arg = statementCall.arguments[0];
 	if (!arg) return null;
 	if (ts.isStringLiteral(arg)) return arg.text;
-	if (ts.isArrowFunction(arg)) return extractExpressionFromArrowFunction(arg);
+	if (ts.isArrowFunction(arg)) return extractExpressionFromArrowFunction(arg, placeholders);
 	return null;
 }
-function extractExpressionFromArrowFunction(fn) {
+function extractExpressionFromArrowFunction(fn, placeholders) {
 	const params = fn.parameters.map((p) => p.name.getText());
 	let body = fn.body;
 	if (ts.isBlock(body)) {
@@ -183,19 +206,63 @@ function extractExpressionFromArrowFunction(fn) {
 		if (returnStmt?.expression) body = returnStmt.expression;
 		else return null;
 	}
-	if (ts.isTemplateExpression(body)) return reconstructExpressionFromTemplate(body, params);
+	if (ts.isTemplateExpression(body)) return reconstructExpressionFromTemplate(body, params, placeholders);
 	if (ts.isNoSubstitutionTemplateLiteral(body)) return body.text;
 	return null;
 }
-function reconstructExpressionFromTemplate(template, paramNames) {
+function reconstructExpressionFromTemplate(template, paramNames, placeholders) {
 	let result = template.head.text;
 	for (const span of template.templateSpans) {
-		if (ts.isIdentifier(span.expression) && paramNames.includes(span.expression.text)) result += "{string}";
-		else result += "{string}";
+		let placeholder = "string";
+		if (ts.isIdentifier(span.expression) && paramNames.includes(span.expression.text)) {
+			const index = paramNames.indexOf(span.expression.text);
+			placeholder = placeholders?.[index] ?? "string";
+		}
+		result += `{${placeholder}}`;
 		result += span.literal.text;
 	}
 	return result;
 }
+/**
+* Resolve `.parsers([intParser, colorParser])` to the placeholder name for each
+* variable, positionally. Built-ins map via {@link BUILTIN_PARSER_PLACEHOLDERS};
+* a custom parser is resolved from its `name` property in the same source file;
+* anything unresolved defaults to `string`, matching the runtime default parser.
+*/
+function resolveParserPlaceholders(parsersCall, sourceFile) {
+	const arg = parsersCall.arguments[0];
+	if (!arg || !ts.isArrayLiteralExpression(arg)) return null;
+	return arg.elements.map((element) => {
+		if (ts.isIdentifier(element)) {
+			const builtin = BUILTIN_PARSER_PLACEHOLDERS[element.text];
+			if (builtin) return builtin;
+			const custom = resolveCustomParserName(element.text, sourceFile);
+			if (custom) return custom;
+		}
+		return "string";
+	});
+}
+/**
+* Find `const <identifier> = { name: "...", ... }` in `sourceFile` and return
+* its `name` — the cucumber placeholder a custom `Parser` registers. Scoped to
+* the file, so a parser imported from elsewhere won't resolve (it falls back to
+* `string`); the common in-file `const colorParser: Parser<Color> = {...}` does.
+*/
+function resolveCustomParserName(identifier, sourceFile) {
+	let found = null;
+	const visit = (node) => {
+		if (found) return;
+		if (ts.isVariableDeclaration(node) && ts.isIdentifier(node.name) && node.name.text === identifier && node.initializer && ts.isObjectLiteralExpression(node.initializer)) {
+			for (const prop of node.initializer.properties) if (ts.isPropertyAssignment(prop) && ts.isIdentifier(prop.name) && prop.name.text === "name" && ts.isStringLiteralLike(prop.initializer)) {
+				found = prop.initializer.text;
+				return;
+			}
+		}
+		ts.forEachChild(node, visit);
+	};
+	visit(sourceFile);
+	return found;
+}
 function extractDependencies(depsCall) {
 	const deps = {
 		given: {},
@@ -269,7 +336,7 @@ function resolveReExportedCall(chain, ctx) {
 		if (ts.isCallExpression(callExpr)) {
 			const callee = callExpr.expression;
 			if (ts.isIdentifier(callee) && BUILDER_NAMES[callee.text]) {
-				const expression = extractExpression(lastCall);
+				const expression = extractExpression(lastCall, null);
 				return {
 					stepType: BUILDER_NAMES[callee.text],
 					expression
@@ -401,13 +468,36 @@ function substituteExampleValues(text, substitution) {
 }
 //#endregion
 //#region src/analyzer/stepMatcher.ts
+/** `{name}` tokens in a cucumber expression (empty name is the anonymous `{}`). */
+const PARAM_TOKEN = /\{([^}]*)\}/g;
+/**
+* Compile each definition's cucumber expression with the **same** engine the
+* runtime uses (`@cucumber/cucumber-expressions`), so the analyzer and the
+* runtime agree on what a step matches.
+*
+* A hand-rolled `{param}` → `(.+)` regex used to stand in here, but it treated
+* cucumber-expression alternative (`a/b`) and optional (`text(s)`) syntax as
+* literal characters — so any step definition using them (e.g.
+* `there should be {int} error/errors`) never matched, and every such step was
+* wrongly reported as an undefined step regardless of the real state.
+*
+* Built-in placeholders (`{int}`, `{float}`, `{string}`, `{word}`) keep their
+* real, strict regexes so the analyzer disambiguates the way the runtime does
+* (e.g. `no` isn't an `{int}`). The analyzer has only the expression string, not
+* a custom parser's regexp, so each custom `{name}` is registered as a permissive
+* parameter type (any value) — lenient about the value's exact shape, but still
+* anchored by the surrounding literal text.
+*/
 function compileDefinitions(definitions) {
 	const compiled = [];
 	for (const def of definitions) try {
-		const placeholder = "###PLACEHOLDER###";
-		const regexStr = def.expression.replace(/\{[^}]+\}/g, placeholder).replace(/[.*+?^$()|[\]\\]/g, "\\$&").replace(new RegExp(placeholder, "g"), "(.+)");
+		const registry = new ParameterTypeRegistry();
+		for (const [, name] of def.expression.matchAll(PARAM_TOKEN)) {
+			if (!name || registry.lookupByTypeName(name)) continue;
+			registry.defineParameterType(new ParameterType(name, /.+/, null, (value) => value));
+		}
 		compiled.push({
-			regex: new RegExp(`^${regexStr}$`, "i"),
+			expression: new CucumberExpression(def.expression, registry),
 			definition: def
 		});
 	} catch {}
@@ -433,13 +523,13 @@ function findMatches(text, effectiveKeyword, compiled) {
 		Then: "then"
 	}[effectiveKeyword];
 	const typedMatches = [];
-	for (const { regex, definition } of compiled) {
+	for (const { expression, definition } of compiled) {
 		if (definition.stepType !== expectedStepType) continue;
-		if (regex.test(text)) typedMatches.push(definition);
+		if (expression.match(text) != null) typedMatches.push(definition);
 	}
 	if (typedMatches.length > 0) return typedMatches;
 	const fallbackMatches = [];
-	for (const { regex, definition } of compiled) if (regex.test(text)) fallbackMatches.push(definition);
+	for (const { expression, definition } of compiled) if (expression.match(text) != null) fallbackMatches.push(definition);
 	return fallbackMatches;
 }
 //#endregion
@@ -550,4 +640,4 @@ async function analyze(config, options) {
 //#endregion
 export { parseFeatureContent as a, matchScenarioSteps as i, defaultRules as n, parseFeatureFiles as o, findMatchingDefinitions as r, extractStepDefinitions as s, analyze as t };
 
-//# sourceMappingURL=analyzer-gYyAKIpM.js.map
+//# sourceMappingURL=analyzer-5H699Eg4.js.map

package/dist/analyzer-5H699Eg4.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"analyzer-5H699Eg4.js","names":[],"sources":["../../src/globFiles.ts","../../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 { glob } from \"node:fs/promises\";\nimport { stat } from \"node:fs/promises\";\nimport * as path from \"node:path\";\n\n/** Glob metacharacters. A pattern with none of these is a literal path. */\nconst MAGIC = /[*?[\\]{}!()]/;\n\nasync function isFile(p: string): Promise<boolean> {\n  try {\n    return (await stat(p)).isFile();\n  } catch {\n    return false;\n  }\n}\n\n/**\n * Resolve glob patterns to a de-duplicated list of absolute file paths, with one\n * important portability guarantee: a **literal absolute path** (no glob magic)\n * is returned directly if it exists, without being handed to `glob()`.\n *\n * This exists because `node:fs`'s `glob` diverges between runtimes — Node\n * matches an absolute-path pattern, Bun returns nothing for one. Rather than\n * depend on that behaviour, we only ever glob relative patterns (against `cwd`)\n * and short-circuit concrete absolute paths ourselves, so callers get identical\n * results under Node and Bun.\n */\nexport async function globFiles(\n  patterns: string[],\n  cwd: string = process.cwd()\n): Promise<string[]> {\n  const files = new Set<string>();\n  for (const pattern of patterns) {\n    if (path.isAbsolute(pattern) && !MAGIC.test(pattern)) {\n      if (await isFile(pattern)) files.add(pattern);\n      continue;\n    }\n    for await (const match of glob(pattern, { cwd })) {\n      files.add(path.resolve(cwd, match));\n    }\n  }\n  return [...files];\n}\n","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\n/**\n * Built-in parsers exported by the library, mapped to the cucumber-expression\n * placeholder they register. A step's `.parsers([...])` drives which `{name}`\n * each variable becomes; without this the extractor defaulted every variable to\n * `{string}`, so `the deposit amount is {int}` was recorded as `{string}` and a\n * plain number like `100` looked unmatched. Custom parsers are resolved from\n * their `name` property (see {@link resolveCustomParserName}); anything we can't\n * resolve falls back to `string`.\n */\nconst BUILTIN_PARSER_PLACEHOLDERS: Record<string, string> = {\n  intParser: \"int\",\n  numberParser: \"float\",\n  stringParser: \"string\",\n  booleanParser: \"boolean\",\n};\n\n/**\n * Threaded through the AST walk. `checker` is `null` on the parse-only fast\n * path; a step that genuinely needs type information sets `needsChecker`, which\n * triggers a one-time retry with a real type-checked `Program`.\n */\ninterface ExtractCtx {\n  checker: ts.TypeChecker | null;\n  needsChecker: boolean;\n}\n\nexport function extractStepDefinitions(\n  filePaths: string[],\n  tsConfigPath?: string\n): StepDefinitionMeta[] {\n  // Fast path: parse each file with `createSourceFile` (tokenize + parse only,\n  // no type resolution — ~1ms/file) and walk the AST. Building a full\n  // type-checked `Program` loads `lib.*.d.ts` and resolves every import (~150ms)\n  // and is only needed for two uncommon shapes: a `.step()` whose return isn't a\n  // plain object literal, or the re-exported-builder pattern. Those set\n  // `needsChecker`, and we retry once with a real Program below.\n  const sources = filePaths\n    .map(parseSourceFile)\n    .filter((s): s is ts.SourceFile => s !== null);\n  const fast = extractWithSources(sources, null);\n  if (!fast.needsChecker) return fast.results;\n\n  // Slow path: some step needs type information. Build the program once and\n  // re-extract from *its* source files — the checker only understands nodes it\n  // bound itself, so the parse-only ASTs above can't be reused here.\n  const program = ts.createProgram(\n    filePaths,\n    resolveCompilerOptions(tsConfigPath)\n  );\n  const checker = program.getTypeChecker();\n  const checkedSources = filePaths\n    .map(fp => program.getSourceFile(fp))\n    .filter((s): s is ts.SourceFile => s !== undefined);\n  return extractWithSources(checkedSources, checker).results;\n}\n\n/** Parse a single file into an AST with no type resolution. */\nfunction parseSourceFile(filePath: string): ts.SourceFile | null {\n  const text = ts.sys.readFile(filePath);\n  if (text === undefined) return null;\n  const scriptKind = filePath.endsWith(\".tsx\")\n    ? ts.ScriptKind.TSX\n    : ts.ScriptKind.TS;\n  // setParentNodes: true — the extractor relies on `.getText()`/`.getStart()`,\n  // which walk parent pointers up to the SourceFile.\n  return ts.createSourceFile(\n    filePath,\n    text,\n    ts.ScriptTarget.ESNext,\n    true,\n    scriptKind\n  );\n}\n\n/** Resolve compiler options from tsconfig (fallback to sane defaults). */\nfunction resolveCompilerOptions(tsConfigPath?: string): ts.CompilerOptions {\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  return compilerOptions;\n}\n\nfunction extractWithSources(\n  sources: ts.SourceFile[],\n  checker: ts.TypeChecker | null\n): { results: StepDefinitionMeta[]; needsChecker: boolean } {\n  const ctx: ExtractCtx = { checker, needsChecker: false };\n  const results: StepDefinitionMeta[] = [];\n  for (const sourceFile of sources) {\n    results.push(...extractFromSourceFile(sourceFile, ctx));\n  }\n  return { results, needsChecker: ctx.needsChecker };\n}\n\nfunction extractFromSourceFile(\n  sourceFile: ts.SourceFile,\n  ctx: ExtractCtx\n): StepDefinitionMeta[] {\n  const results: StepDefinitionMeta[] = [];\n\n  function visit(node: ts.Node) {\n    // The chain now terminates at `.step(...)`, which is the registration\n    // point (there is no `.register()` anymore).\n    if (\n      ts.isCallExpression(node) &&\n      ts.isPropertyAccessExpression(node.expression) &&\n      node.expression.name.text === \"step\"\n    ) {\n      const meta = extractFromRegisterCall(node, sourceFile, ctx);\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  ctx: ExtractCtx\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 statementCall: ts.CallExpression | 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  // Placeholder names per variable, from `.parsers([...])` (positional).\n  let placeholders: string[] | null = null;\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, ctx);\n      continue;\n    }\n\n    if (name === \"dependencies\") {\n      dependencies = extractDependencies(link);\n      continue;\n    }\n\n    if (name === \"parsers\") {\n      placeholders = resolveParserPlaceholders(link, sourceFile);\n      continue;\n    }\n\n    if (name === \"statement\") {\n      statementCall = 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  // Build the expression after the whole chain is seen, so `.parsers([...])` —\n  // which the chain visits before `.statement(...)` here, but conceptually\n  // annotates it — determines each variable's placeholder.\n  if (statementCall)\n    expression = extractExpression(statementCall, placeholders);\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, ctx);\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(\n  statementCall: ts.CallExpression,\n  placeholders: string[] | null\n): 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, placeholders);\n  }\n\n  return null;\n}\n\nfunction extractExpressionFromArrowFunction(\n  fn: ts.ArrowFunction,\n  placeholders: string[] | null\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, placeholders);\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  placeholders: string[] | null\n): string {\n  let result = template.head.text;\n\n  for (const span of template.templateSpans) {\n    // A variable interpolation becomes its declared parser placeholder (default\n    // `{string}`); a non-variable interpolation falls back to `{string}`.\n    let placeholder = \"string\";\n    if (\n      ts.isIdentifier(span.expression) &&\n      paramNames.includes(span.expression.text)\n    ) {\n      const index = paramNames.indexOf(span.expression.text);\n      placeholder = placeholders?.[index] ?? \"string\";\n    }\n    result += `{${placeholder}}`;\n    result += span.literal.text;\n  }\n\n  return result;\n}\n\n/**\n * Resolve `.parsers([intParser, colorParser])` to the placeholder name for each\n * variable, positionally. Built-ins map via {@link BUILTIN_PARSER_PLACEHOLDERS};\n * a custom parser is resolved from its `name` property in the same source file;\n * anything unresolved defaults to `string`, matching the runtime default parser.\n */\nfunction resolveParserPlaceholders(\n  parsersCall: ts.CallExpression,\n  sourceFile: ts.SourceFile\n): string[] | null {\n  const arg = parsersCall.arguments[0];\n  if (!arg || !ts.isArrayLiteralExpression(arg)) return null;\n  return arg.elements.map(element => {\n    if (ts.isIdentifier(element)) {\n      const builtin = BUILTIN_PARSER_PLACEHOLDERS[element.text];\n      if (builtin) return builtin;\n      const custom = resolveCustomParserName(element.text, sourceFile);\n      if (custom) return custom;\n    }\n    return \"string\";\n  });\n}\n\n/**\n * Find `const <identifier> = { name: \"...\", ... }` in `sourceFile` and return\n * its `name` — the cucumber placeholder a custom `Parser` registers. Scoped to\n * the file, so a parser imported from elsewhere won't resolve (it falls back to\n * `string`); the common in-file `const colorParser: Parser<Color> = {...}` does.\n */\nfunction resolveCustomParserName(\n  identifier: string,\n  sourceFile: ts.SourceFile\n): string | null {\n  let found: string | null = null;\n  const visit = (node: ts.Node): void => {\n    if (found) return;\n    if (\n      ts.isVariableDeclaration(node) &&\n      ts.isIdentifier(node.name) &&\n      node.name.text === identifier &&\n      node.initializer &&\n      ts.isObjectLiteralExpression(node.initializer)\n    ) {\n      for (const prop of node.initializer.properties) {\n        if (\n          ts.isPropertyAssignment(prop) &&\n          ts.isIdentifier(prop.name) &&\n          prop.name.text === \"name\" &&\n          ts.isStringLiteralLike(prop.initializer)\n        ) {\n          found = prop.initializer.text;\n          return;\n        }\n      }\n    }\n    ts.forEachChild(node, visit);\n  };\n  visit(sourceFile);\n  return found;\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)) 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  ctx: ExtractCtx\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, ctx);\n  }\n\n  return [];\n}\n\nfunction extractProducedKeysFromCallback(\n  callback: ts.ArrowFunction | ts.FunctionExpression,\n  ctx: ExtractCtx\n): string[] {\n  const body = callback.body;\n\n  // Concise arrow: () => ({ key: value })\n  if (!ts.isBlock(body)) {\n    return extractKeysFromExpression(body, ctx);\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, ctx)) {\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  ctx: ExtractCtx\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  // Non-literal return (a variable, a spread-only object, a function call): the\n  // keys can only come from the type checker. On the parse-only pass we have\n  // none — flag it so the caller retries with a real Program.\n  if (!ctx.checker) {\n    ctx.needsChecker = true;\n    return [];\n  }\n  try {\n    const type = ctx.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  ctx: ExtractCtx\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  // Tracing the re-exported builder's declaration needs symbol resolution,\n  // which only a real Program provides. Flag for the checked retry.\n  if (!ctx.checker) {\n    ctx.needsChecker = true;\n    return null;\n  }\n\n  const symbol = ctx.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        // The re-exported-builder pattern carries no `.parsers(...)`, so\n        // variables fall back to the default `{string}` placeholder.\n        const expression = extractExpression(lastCall, null);\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 {\n  GherkinClassicTokenMatcher,\n  Parser,\n  AstBuilder,\n} 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\n/**\n * One parsed feature file: its `Feature:` title (empty if unnamed) plus every\n * scenario (outline rows expanded). {@link parseFeatureContent} exposes just the\n * scenarios; {@link parseFeatureCatalog} keeps the title too, for UIs that label\n * scenarios by their feature.\n */\nexport interface ParsedFeature {\n  file: string;\n  name: string;\n  scenarios: ParsedScenario[];\n}\n\n/** Build a fresh gherkin parser and parse `content` into a document. */\nfunction parseDocument(content: string): messages.GherkinDocument {\n  const builder = new AstBuilder(messages.IdGenerator.uuid());\n  const matcher = new GherkinClassicTokenMatcher();\n  return new Parser(builder, matcher).parse(content);\n}\n\n/**\n * Parse feature files into a catalog of `{ file, name, scenarios }`, one entry\n * per file (one gherkin parse each). Used by interactive mode to offer\n * feature/scenario names as typeahead choices labelled by their `Feature:` title.\n */\nexport function parseFeatureCatalog(filePaths: string[]): ParsedFeature[] {\n  return filePaths.map(file => {\n    const document = parseDocument(fs.readFileSync(file, \"utf-8\"));\n    return {\n      file,\n      name: document.feature?.name ?? \"\",\n      scenarios: documentToScenarios(document, file),\n    };\n  });\n}\n\nexport function parseFeatureContent(\n  content: string,\n  filePath: string\n): ParsedScenario[] {\n  return documentToScenarios(parseDocument(content), filePath);\n}\n\n/** Expand a parsed gherkin document into scenarios (outline rows included). */\nfunction documentToScenarios(\n  gherkinDocument: messages.GherkinDocument,\n  filePath: string\n): ParsedScenario[] {\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  const featureTags = tagNames(feature.tags);\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(\n          child.scenario,\n          featureBackground,\n          filePath,\n          featureTags\n        )\n      );\n    }\n\n    if (child.rule) {\n      // Rules can have their own backgrounds and tags, both inherited by the\n      // rule's scenarios.\n      const ruleBackground: messages.Step[] = [...featureBackground];\n      const ruleTags = [...featureTags, ...tagNames(child.rule.tags)];\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(\n              ruleChild.scenario,\n              ruleBackground,\n              filePath,\n              ruleTags\n            )\n          );\n        }\n      }\n    }\n  }\n\n  return scenarios;\n}\n\n/** Extract tag names (each keeping its leading `@`), deduped in order. */\nfunction tagNames(tags: readonly messages.Tag[] | undefined): string[] {\n  return [...new Set((tags ?? []).map(t => t.name))];\n}\n\nfunction expandScenario(\n  scenario: messages.Scenario,\n  backgroundSteps: messages.Step[],\n  filePath: string,\n  inheritedTags: string[]\n): ParsedScenario[] {\n  const scenarioTags = [...inheritedTags, ...tagNames(scenario.tags)];\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        line: scenario.location.line,\n        steps: allSteps,\n        tags: scenarioTags,\n      },\n    ];\n  }\n\n  // Scenario Outline — expand with each example row. Rows carry the outline's\n  // base name so the runner can group them, plus the Examples-block tags.\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    const exampleTags = [...scenarioTags, ...tagNames(example.tags)];\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([\n        ...bgParsed,\n        ...scenarioSteps,\n      ]);\n\n      results.push({\n        name: headers.map((h, i) => `${h}=${values[i]}`).join(\", \"),\n        file: filePath,\n        line: row.location.line,\n        steps: allSteps,\n        tags: exampleTags,\n        outline: { name: scenario.name },\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 {\n  CucumberExpression,\n  ParameterType,\n  ParameterTypeRegistry,\n} from \"@cucumber/cucumber-expressions\";\nimport { MatchedStep, ParsedScenario, StepDefinitionMeta } from \"./types.js\";\n\ninterface CompiledPattern {\n  expression: CucumberExpression;\n  definition: StepDefinitionMeta;\n}\n\n/** `{name}` tokens in a cucumber expression (empty name is the anonymous `{}`). */\nconst PARAM_TOKEN = /\\{([^}]*)\\}/g;\n\n/**\n * Compile each definition's cucumber expression with the **same** engine the\n * runtime uses (`@cucumber/cucumber-expressions`), so the analyzer and the\n * runtime agree on what a step matches.\n *\n * A hand-rolled `{param}` → `(.+)` regex used to stand in here, but it treated\n * cucumber-expression alternative (`a/b`) and optional (`text(s)`) syntax as\n * literal characters — so any step definition using them (e.g.\n * `there should be {int} error/errors`) never matched, and every such step was\n * wrongly reported as an undefined step regardless of the real state.\n *\n * Built-in placeholders (`{int}`, `{float}`, `{string}`, `{word}`) keep their\n * real, strict regexes so the analyzer disambiguates the way the runtime does\n * (e.g. `no` isn't an `{int}`). The analyzer has only the expression string, not\n * a custom parser's regexp, so each custom `{name}` is registered as a permissive\n * parameter type (any value) — lenient about the value's exact shape, but still\n * anchored by the surrounding literal text.\n */\nfunction compileDefinitions(\n  definitions: StepDefinitionMeta[]\n): CompiledPattern[] {\n  const compiled: CompiledPattern[] = [];\n  for (const def of definitions) {\n    try {\n      const registry = new ParameterTypeRegistry();\n      for (const [, name] of def.expression.matchAll(PARAM_TOKEN)) {\n        if (!name || registry.lookupByTypeName(name)) continue;\n        registry.defineParameterType(\n          new ParameterType(name, /.+/, null, (value: string) => value)\n        );\n      }\n      compiled.push({\n        expression: new CucumberExpression(def.expression, registry),\n        definition: def,\n      });\n    } catch {\n      // Skip definitions whose expression can't be compiled.\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 { expression, definition } of compiled) {\n    if (definition.stepType !== expectedStepType) continue;\n    if (expression.match(text) != null) 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 { expression, definition } of compiled) {\n    if (expression.match(text) != null) 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 { globFiles } from \"../globFiles.js\";\nimport { extractStepDefinitions } from \"./stepExtractor.js\";\nimport { parseFeatureFiles, parseFeatureContent } from \"./gherkinParser.js\";\nimport { matchScenarioSteps, findMatchingDefinitions } 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 globFiles(config.stepFiles);\n  const featureFilePaths = await globFiles(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"],"mappings":";;;;;;;;;AAKA,MAAM,QAAQ;AAEd,eAAe,OAAO,GAA6B;CACjD,IAAI;EACF,QAAQ,MAAM,KAAK,CAAC,EAAA,CAAG,OAAO;CAChC,QAAQ;EACN,OAAO;CACT;AACF;;;;;;;;;;;;AAaA,eAAsB,UACpB,UACA,MAAc,QAAQ,IAAI,GACP;CACnB,MAAM,wBAAQ,IAAI,IAAY;CAC9B,KAAK,MAAM,WAAW,UAAU;EAC9B,IAAI,KAAK,WAAW,OAAO,KAAK,CAAC,MAAM,KAAK,OAAO,GAAG;GACpD,IAAI,MAAM,OAAO,OAAO,GAAG,MAAM,IAAI,OAAO;GAC5C;EACF;EACA,WAAW,MAAM,SAAS,KAAK,SAAS,EAAE,IAAI,CAAC,GAC7C,MAAM,IAAI,KAAK,QAAQ,KAAK,KAAK,CAAC;CAEtC;CACA,OAAO,CAAC,GAAG,KAAK;AAClB;;;ACpCA,MAAM,gBAA0C;CAC9C,cAAc;CACd,aAAa;CACb,aAAa;AACf;;;;;;;;;;AAWA,MAAM,8BAAsD;CAC1D,WAAW;CACX,cAAc;CACd,cAAc;CACd,eAAe;AACjB;AAYA,SAAgB,uBACd,WACA,cACsB;CAUtB,MAAM,OAAO,mBAHG,UACb,IAAI,eAAe,CAAC,CACpB,QAAQ,MAA0B,MAAM,IACL,GAAG,IAAI;CAC7C,IAAI,CAAC,KAAK,cAAc,OAAO,KAAK;CAKpC,MAAM,UAAU,GAAG,cACjB,WACA,uBAAuB,YAAY,CACrC;CACA,MAAM,UAAU,QAAQ,eAAe;CAIvC,OAAO,mBAHgB,UACpB,KAAI,OAAM,QAAQ,cAAc,EAAE,CAAC,CAAC,CACpC,QAAQ,MAA0B,MAAM,KAAA,CACJ,GAAG,OAAO,CAAC,CAAC;AACrD;;AAGA,SAAS,gBAAgB,UAAwC;CAC/D,MAAM,OAAO,GAAG,IAAI,SAAS,QAAQ;CACrC,IAAI,SAAS,KAAA,GAAW,OAAO;CAC/B,MAAM,aAAa,SAAS,SAAS,MAAM,IACvC,GAAG,WAAW,MACd,GAAG,WAAW;CAGlB,OAAO,GAAG,iBACR,UACA,MACA,GAAG,aAAa,QAChB,MACA,UACF;AACF;;AAGA,SAAS,uBAAuB,cAA2C;CACzE,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,CAAC,CAAC;CAE7B;CAGA,gBAAgB,SAAS;CACzB,OAAO;AACT;AAEA,SAAS,mBACP,SACA,SAC0D;CAC1D,MAAM,MAAkB;EAAE;EAAS,cAAc;CAAM;CACvD,MAAM,UAAgC,CAAC;CACvC,KAAK,MAAM,cAAc,SACvB,QAAQ,KAAK,GAAG,sBAAsB,YAAY,GAAG,CAAC;CAExD,OAAO;EAAE;EAAS,cAAc,IAAI;CAAa;AACnD;AAEA,SAAS,sBACP,YACA,KACsB;CACtB,MAAM,UAAgC,CAAC;CAEvC,SAAS,MAAM,MAAe;EAG5B,IACE,GAAG,iBAAiB,IAAI,KACxB,GAAG,2BAA2B,KAAK,UAAU,KAC7C,KAAK,WAAW,KAAK,SAAS,QAC9B;GACA,MAAM,OAAO,wBAAwB,MAAM,YAAY,GAAG;GAC1D,IAAI,MACF,QAAQ,KAAK,IAAI;EAErB;EACA,GAAG,aAAa,MAAM,KAAK;CAC7B;CAEA,MAAM,UAAU;CAChB,OAAO;AACT;AAEA,SAAS,wBACP,cACA,YACA,KAC2B;CAK3B,MAAM,QAAQ,iBAAiB,YAAY;CAE3C,IAAI,WAA4B;CAChC,IAAI,gBAA0C;CAC9C,IAAI,aAA4B;CAChC,IAAI,eAAmD;EACrD,OAAO,CAAC;EACR,MAAM,CAAC;EACP,MAAM,CAAC;CACT;CACA,IAAI,WAAqB,CAAC;CAE1B,IAAI,eAAgC;CAEpC,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,GAAG;GACxC;EACF;EAEA,IAAI,SAAS,gBAAgB;GAC3B,eAAe,oBAAoB,IAAI;GACvC;EACF;EAEA,IAAI,SAAS,WAAW;GACtB,eAAe,0BAA0B,MAAM,UAAU;GACzD;EACF;EAEA,IAAI,SAAS,aAAa;GACxB,gBAAgB;GAEhB;EACF;EAGA,IAAI,cAAc,OAAO;GACvB,WAAW,cAAc;GACzB;EACF;CACF;CAKA,IAAI,eACF,aAAa,kBAAkB,eAAe,YAAY;CAK5D,IAAI,CAAC,YAAY,CAAC,YAAY;EAC5B,MAAM,WAAW,sBAAsB,OAAO,GAAG;EACjD,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,CAAC,CAAC,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,kBACP,eACA,cACe;CACf,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,KAAK,YAAY;CAG7D,OAAO;AACT;AAEA,SAAS,mCACP,IACA,cACe;CACf,MAAM,SAAS,GAAG,WAAW,KAAI,MAAK,EAAE,KAAK,QAAQ,CAAC;CAGtD,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,QAAQ,YAAY;CAGrE,IAAI,GAAG,gCAAgC,IAAI,GACzC,OAAO,KAAK;CAGd,OAAO;AACT;AAEA,SAAS,kCACP,UACA,YACA,cACQ;CACR,IAAI,SAAS,SAAS,KAAK;CAE3B,KAAK,MAAM,QAAQ,SAAS,eAAe;EAGzC,IAAI,cAAc;EAClB,IACE,GAAG,aAAa,KAAK,UAAU,KAC/B,WAAW,SAAS,KAAK,WAAW,IAAI,GACxC;GACA,MAAM,QAAQ,WAAW,QAAQ,KAAK,WAAW,IAAI;GACrD,cAAc,eAAe,UAAU;EACzC;EACA,UAAU,IAAI,YAAY;EAC1B,UAAU,KAAK,QAAQ;CACzB;CAEA,OAAO;AACT;;;;;;;AAQA,SAAS,0BACP,aACA,YACiB;CACjB,MAAM,MAAM,YAAY,UAAU;CAClC,IAAI,CAAC,OAAO,CAAC,GAAG,yBAAyB,GAAG,GAAG,OAAO;CACtD,OAAO,IAAI,SAAS,KAAI,YAAW;EACjC,IAAI,GAAG,aAAa,OAAO,GAAG;GAC5B,MAAM,UAAU,4BAA4B,QAAQ;GACpD,IAAI,SAAS,OAAO;GACpB,MAAM,SAAS,wBAAwB,QAAQ,MAAM,UAAU;GAC/D,IAAI,QAAQ,OAAO;EACrB;EACA,OAAO;CACT,CAAC;AACH;;;;;;;AAQA,SAAS,wBACP,YACA,YACe;CACf,IAAI,QAAuB;CAC3B,MAAM,SAAS,SAAwB;EACrC,IAAI,OAAO;EACX,IACE,GAAG,sBAAsB,IAAI,KAC7B,GAAG,aAAa,KAAK,IAAI,KACzB,KAAK,KAAK,SAAS,cACnB,KAAK,eACL,GAAG,0BAA0B,KAAK,WAAW;QAExC,MAAM,QAAQ,KAAK,YAAY,YAClC,IACE,GAAG,qBAAqB,IAAI,KAC5B,GAAG,aAAa,KAAK,IAAI,KACzB,KAAK,KAAK,SAAS,UACnB,GAAG,oBAAoB,KAAK,WAAW,GACvC;IACA,QAAQ,KAAK,YAAY;IACzB;GACF;;EAGJ,GAAG,aAAa,MAAM,KAAK;CAC7B;CACA,MAAM,UAAU;CAChB,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,GAAG;EAEnE,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,MAAM,CAAC,UAAU,KAAK,QAAQ;GAEvC;;CAGN;CAEA,OAAO;AACT;AAEA,SAAS,oBACP,UACA,KACU;CACV,MAAM,WAAW,SAAS,UAAU;CACpC,IAAI,CAAC,UAAU,OAAO,CAAC;CAGvB,IAAI,GAAG,gBAAgB,QAAQ,KAAK,GAAG,qBAAqB,QAAQ,GAClE,OAAO,gCAAgC,UAAU,GAAG;CAGtD,OAAO,CAAC;AACV;AAEA,SAAS,gCACP,UACA,KACU;CACV,MAAM,OAAO,SAAS;CAGtB,IAAI,CAAC,GAAG,QAAQ,IAAI,GAClB,OAAO,0BAA0B,MAAM,GAAG;CAI5C,MAAM,uBAAO,IAAI,IAAY;CAC7B,SAAS,YAAY,MAAe;EAClC,IAAI,GAAG,kBAAkB,IAAI,KAAK,KAAK,YACrC,KAAK,MAAM,OAAO,0BAA0B,KAAK,YAAY,GAAG,GAC9D,KAAK,IAAI,GAAG;EAGhB,GAAG,aAAa,MAAM,WAAW;CACnC;CACA,YAAY,IAAI;CAChB,OAAO,CAAC,GAAG,IAAI;AACjB;AAEA,SAAS,0BACP,MACA,KACU;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,CAAC,CACA,KAAI,MAAK,EAAE,KAAK,QAAQ,CAAC,CAAC,CAC1B,OAAO,OAAO;CAMnB,IAAI,CAAC,IAAI,SAAS;EAChB,IAAI,eAAe;EACnB,OAAO,CAAC;CACV;CACA,IAAI;EAEF,OADa,IAAI,QAAQ,kBAAkB,IACjC,CAAC,CACR,cAAc,CAAC,CACf,KAAI,MAAK,EAAE,IAAI,CAAC,CAChB,QAAO,MAAK,MAAM,OAAO;CAC9B,QAAQ;EACN,OAAO,CAAC;CACV;AACF;AAOA,SAAS,sBACP,OACA,KACuB;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;CAIxB,IAAI,CAAC,IAAI,SAAS;EAChB,IAAI,eAAe;EACnB,OAAO;CACT;CAEA,MAAM,SAAS,IAAI,QAAQ,oBAAoB,UAAU;CACzD,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;IAIzD,MAAM,aAAa,kBAAkB,UAAU,IAAI;IACnD,OAAO;KACL,UAAU,cAAc,OAAO;KAC/B;IACF;GACF;EACF;CACF;CAEA,OAAO;AACT;;;AChlBA,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,SAAS,cAAc,SAA2C;CAGhE,OAAO,IAAI,OAAO,IAFE,WAAW,SAAS,YAAY,KAAK,CAEjC,GAAG,IADP,2BACa,CAAC,CAAC,CAAC,MAAM,OAAO;AACnD;AAkBA,SAAgB,oBACd,SACA,UACkB;CAClB,OAAO,oBAAoB,cAAc,OAAO,GAAG,QAAQ;AAC7D;;AAGA,SAAS,oBACP,iBACA,UACkB;CAClB,MAAM,UAAU,gBAAgB;CAChC,IAAI,CAAC,SAAS,OAAO,CAAC;CAGtB,MAAM,oBAAqC,CAAC;CAC5C,MAAM,YAA8B,CAAC;CACrC,MAAM,cAAc,SAAS,QAAQ,IAAI;CAEzC,KAAK,MAAM,SAAS,QAAQ,UAAU;EACpC,IAAI,MAAM,YACR,kBAAkB,KAAK,GAAG,MAAM,WAAW,KAAK;EAGlD,IAAI,MAAM,UACR,UAAU,KACR,GAAG,eACD,MAAM,UACN,mBACA,UACA,WACF,CACF;EAGF,IAAI,MAAM,MAAM;GAGd,MAAM,iBAAkC,CAAC,GAAG,iBAAiB;GAC7D,MAAM,WAAW,CAAC,GAAG,aAAa,GAAG,SAAS,MAAM,KAAK,IAAI,CAAC;GAC9D,KAAK,MAAM,aAAa,MAAM,KAAK,UAAU;IAC3C,IAAI,UAAU,YACZ,eAAe,KAAK,GAAG,UAAU,WAAW,KAAK;IAEnD,IAAI,UAAU,UACZ,UAAU,KACR,GAAG,eACD,UAAU,UACV,gBACA,UACA,QACF,CACF;GAEJ;EACF;CACF;CAEA,OAAO;AACT;;AAGA,SAAS,SAAS,MAAqD;CACrE,OAAO,CAAC,GAAG,IAAI,KAAK,QAAQ,CAAC,EAAA,CAAG,KAAI,MAAK,EAAE,IAAI,CAAC,CAAC;AACnD;AAEA,SAAS,eACP,UACA,iBACA,UACA,eACkB;CAClB,MAAM,eAAe,CAAC,GAAG,eAAe,GAAG,SAAS,SAAS,IAAI,CAAC;CAKlE,IAAI,EAHF,SAAS,SAAS,SAAS,KAC3B,SAAS,SAAS,MAAK,MAAK,EAAE,UAAU,SAAS,CAAC,IAElC;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,MAAM,SAAS,SAAS;GACxB,OAAO;GACP,MAAM;EACR,CACF;CACF;CAIA,MAAM,UAA4B,CAAC;CACnC,KAAK,MAAM,WAAW,SAAS,UAAU;EACvC,IAAI,CAAC,QAAQ,eAAe,QAAQ,UAAU,WAAW,GAAG;EAC5D,MAAM,UAAU,QAAQ,YAAY,MAAM,KAAI,MAAK,EAAE,KAAK;EAC1D,MAAM,cAAc,CAAC,GAAG,cAAc,GAAG,SAAS,QAAQ,IAAI,CAAC;EAE/D,KAAK,MAAM,OAAO,QAAQ,WAAW;GACnC,MAAM,SAAS,IAAI,MAAM,KAAI,MAAK,EAAE,KAAK;GACzC,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,CAAC,CAAC,KAAI,UAAS;IAC9D,GAAG;IACH,MAAM,wBAAwB,KAAK,MAAM,YAAY;GACvD,EAAE;GACF,MAAM,WAAW,yBAAyB,CACxC,GAAG,UACH,GAAG,aACL,CAAC;GAED,QAAQ,KAAK;IACX,MAAM,QAAQ,KAAK,GAAG,MAAM,GAAG,EAAE,GAAG,OAAO,IAAI,CAAC,CAAC,KAAK,IAAI;IAC1D,MAAM;IACN,MAAM,IAAI,SAAS;IACnB,OAAO;IACP,MAAM;IACN,SAAS,EAAE,MAAM,SAAS,KAAK;GACjC,CAAC;EACH;CACF;CAEA,OAAO;AACT;AAEA,SAAS,aACP,OACwC;CACxC,OAAO,MAAM,KAAI,UAAS;EACxB,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,KAAI,SAAQ;EACvB,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;;;;AC5OA,MAAM,cAAc;;;;;;;;;;;;;;;;;;;AAoBpB,SAAS,mBACP,aACmB;CACnB,MAAM,WAA8B,CAAC;CACrC,KAAK,MAAM,OAAO,aAChB,IAAI;EACF,MAAM,WAAW,IAAI,sBAAsB;EAC3C,KAAK,MAAM,GAAG,SAAS,IAAI,WAAW,SAAS,WAAW,GAAG;GAC3D,IAAI,CAAC,QAAQ,SAAS,iBAAiB,IAAI,GAAG;GAC9C,SAAS,oBACP,IAAI,cAAc,MAAM,MAAM,OAAO,UAAkB,KAAK,CAC9D;EACF;EACA,SAAS,KAAK;GACZ,YAAY,IAAI,mBAAmB,IAAI,YAAY,QAAQ;GAC3D,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,YAAY,gBAAgB,UAAU;EACjD,IAAI,WAAW,aAAa,kBAAkB;EAC9C,IAAI,WAAW,MAAM,IAAI,KAAK,MAAM,aAAa,KAAK,UAAU;CAClE;CAEA,IAAI,aAAa,SAAS,GAAG,OAAO;CAGpC,MAAM,kBAAwC,CAAC;CAC/C,KAAK,MAAM,EAAE,YAAY,gBAAgB,UACvC,IAAI,WAAW,MAAM,IAAI,KAAK,MAAM,gBAAgB,KAAK,UAAU;CAGrE,OAAO;AACT;;;AInGA,MAAa,eAA+B;CAC1C;EDHA,MAAM;EAEN,MACE,UACA,cACc;GACd,OAAO,aACJ,QAAQ,SAAS,KAAK,YAAY,WAAW,CAAC,CAAC,CAC/C,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,CAAC,CAC7C,KAAK,SAAS;IACb,MAAM,YAAY,KAAK,YACpB,KAAK,MAAM,GAAG,EAAE,WAAW,GAAG,EAAE,MAAM,CAAC,CACvC,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,MAAM,CAAC,IAAI,GAAG,GAAG;KAC3D,IAAI,CAAC,QAAQ,QACX,QAAQ,SAAS,CAAC;KAEpB,QAAQ,MAAM,CAAC,KAAK,GAAG;IACzB;IAIJ,IAAI,OAAO,KAAK,OAAO,CAAC,CAAC,SAAS,GAAG;KAKnC,MAAM,UACJ,qCALY,OAAO,QAAQ,OAAO,CAAC,CAAC,KACnC,CAAC,OAAO,UACP,GAAG,MAAM,OAAO,CAAC,CAAC,CAAC,YAAY,IAAI,MAAM,MAAM,CAAC,EAAE,IAAI,KAAK,KAAK,MAAM,GAAG,MAAM,GAAG,GAAG,CAAC,CAAC,KAAK,IAAI,GAGzD,CAAC,CAAC,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,SAAS,CAAC,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;;;ACgBA,eAAsB,QACpB,QACA,SACuB;CACvB,MAAM,QAAQ,SAAS,SAAS;CAGhC,MAAM,gBAAgB,MAAM,UAAU,OAAO,SAAS;CACtD,MAAM,mBAAmB,MAAM,UAAU,OAAO,YAAY;CAE5D,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"}

package/dist/{analyzer-DIZPMxzN.cjs → analyzer-DRudicCk.cjs}

@@ -1,12 +1,28 @@
 const require_gherkinParser = require("./gherkinParser-_ZgvELdy.cjs");
 let typescript = require("typescript");
 typescript = require_gherkinParser.__toESM(typescript, 1);
+let _cucumber_cucumber_expressions = require("@cucumber/cucumber-expressions");
 //#region src/analyzer/stepExtractor.ts
 const BUILDER_NAMES = {
 	givenBuilder: "given",
 	whenBuilder: "when",
 	thenBuilder: "then"
 };
+/**
+* Built-in parsers exported by the library, mapped to the cucumber-expression
+* placeholder they register. A step's `.parsers([...])` drives which `{name}`
+* each variable becomes; without this the extractor defaulted every variable to
+* `{string}`, so `the deposit amount is {int}` was recorded as `{string}` and a
+* plain number like `100` looked unmatched. Custom parsers are resolved from
+* their `name` property (see {@link resolveCustomParserName}); anything we can't
+* resolve falls back to `string`.
+*/
+const BUILTIN_PARSER_PLACEHOLDERS = {
+	intParser: "int",
+	numberParser: "float",
+	stringParser: "string",
+	booleanParser: "boolean"
+};
 function extractStepDefinitions(filePaths, tsConfigPath) {
 	const fast = extractWithSources(filePaths.map(parseSourceFile).filter((s) => s !== null), null);
 	if (!fast.needsChecker) return fast.results;
@@ -65,6 +81,7 @@ function extractFromSourceFile(sourceFile, ctx) {
 function extractFromRegisterCall(registerCall, sourceFile, ctx) {
 	const chain = collectCallChain(registerCall);
 	let stepType = null;
+	let statementCall = null;
 	let expression = null;
 	let dependencies = {
 		given: {},
@@ -72,6 +89,7 @@ function extractFromRegisterCall(registerCall, sourceFile, ctx) {
 		then: {}
 	};
 	let produces = [];
+	let placeholders = null;
 	for (const link of chain) {
 		const name = getCallName(link);
 		if (!name) continue;
@@ -84,8 +102,12 @@ function extractFromRegisterCall(registerCall, sourceFile, ctx) {
 			dependencies = extractDependencies(link);
 			continue;
 		}
+		if (name === "parsers") {
+			placeholders = resolveParserPlaceholders(link, sourceFile);
+			continue;
+		}
 		if (name === "statement") {
-			expression = extractExpression(link);
+			statementCall = link;
 			continue;
 		}
 		if (BUILDER_NAMES[name]) {
@@ -93,6 +115,7 @@ function extractFromRegisterCall(registerCall, sourceFile, ctx) {
 			continue;
 		}
 	}
+	if (statementCall) expression = extractExpression(statementCall, placeholders);
 	if (!stepType || !expression) {
 		const reExport = resolveReExportedCall(chain, ctx);
 		if (reExport) {
@@ -132,14 +155,14 @@ function getCallName(call) {
 	if (typescript.default.isIdentifier(expr)) return expr.text;
 	return null;
 }
-function extractExpression(statementCall) {
+function extractExpression(statementCall, placeholders) {
 	const arg = statementCall.arguments[0];
 	if (!arg) return null;
 	if (typescript.default.isStringLiteral(arg)) return arg.text;
-	if (typescript.default.isArrowFunction(arg)) return extractExpressionFromArrowFunction(arg);
+	if (typescript.default.isArrowFunction(arg)) return extractExpressionFromArrowFunction(arg, placeholders);
 	return null;
 }
-function extractExpressionFromArrowFunction(fn) {
+function extractExpressionFromArrowFunction(fn, placeholders) {
 	const params = fn.parameters.map((p) => p.name.getText());
 	let body = fn.body;
 	if (typescript.default.isBlock(body)) {
@@ -147,19 +170,63 @@ function extractExpressionFromArrowFunction(fn) {
 		if (returnStmt?.expression) body = returnStmt.expression;
 		else return null;
 	}
-	if (typescript.default.isTemplateExpression(body)) return reconstructExpressionFromTemplate(body, params);
+	if (typescript.default.isTemplateExpression(body)) return reconstructExpressionFromTemplate(body, params, placeholders);
 	if (typescript.default.isNoSubstitutionTemplateLiteral(body)) return body.text;
 	return null;
 }
-function reconstructExpressionFromTemplate(template, paramNames) {
+function reconstructExpressionFromTemplate(template, paramNames, placeholders) {
 	let result = template.head.text;
 	for (const span of template.templateSpans) {
-		if (typescript.default.isIdentifier(span.expression) && paramNames.includes(span.expression.text)) result += "{string}";
-		else result += "{string}";
+		let placeholder = "string";
+		if (typescript.default.isIdentifier(span.expression) && paramNames.includes(span.expression.text)) {
+			const index = paramNames.indexOf(span.expression.text);
+			placeholder = placeholders?.[index] ?? "string";
+		}
+		result += `{${placeholder}}`;
 		result += span.literal.text;
 	}
 	return result;
 }
+/**
+* Resolve `.parsers([intParser, colorParser])` to the placeholder name for each
+* variable, positionally. Built-ins map via {@link BUILTIN_PARSER_PLACEHOLDERS};
+* a custom parser is resolved from its `name` property in the same source file;
+* anything unresolved defaults to `string`, matching the runtime default parser.
+*/
+function resolveParserPlaceholders(parsersCall, sourceFile) {
+	const arg = parsersCall.arguments[0];
+	if (!arg || !typescript.default.isArrayLiteralExpression(arg)) return null;
+	return arg.elements.map((element) => {
+		if (typescript.default.isIdentifier(element)) {
+			const builtin = BUILTIN_PARSER_PLACEHOLDERS[element.text];
+			if (builtin) return builtin;
+			const custom = resolveCustomParserName(element.text, sourceFile);
+			if (custom) return custom;
+		}
+		return "string";
+	});
+}
+/**
+* Find `const <identifier> = { name: "...", ... }` in `sourceFile` and return
+* its `name` — the cucumber placeholder a custom `Parser` registers. Scoped to
+* the file, so a parser imported from elsewhere won't resolve (it falls back to
+* `string`); the common in-file `const colorParser: Parser<Color> = {...}` does.
+*/
+function resolveCustomParserName(identifier, sourceFile) {
+	let found = null;
+	const visit = (node) => {
+		if (found) return;
+		if (typescript.default.isVariableDeclaration(node) && typescript.default.isIdentifier(node.name) && node.name.text === identifier && node.initializer && typescript.default.isObjectLiteralExpression(node.initializer)) {
+			for (const prop of node.initializer.properties) if (typescript.default.isPropertyAssignment(prop) && typescript.default.isIdentifier(prop.name) && prop.name.text === "name" && typescript.default.isStringLiteralLike(prop.initializer)) {
+				found = prop.initializer.text;
+				return;
+			}
+		}
+		typescript.default.forEachChild(node, visit);
+	};
+	visit(sourceFile);
+	return found;
+}
 function extractDependencies(depsCall) {
 	const deps = {
 		given: {},
@@ -233,7 +300,7 @@ function resolveReExportedCall(chain, ctx) {
 		if (typescript.default.isCallExpression(callExpr)) {
 			const callee = callExpr.expression;
 			if (typescript.default.isIdentifier(callee) && BUILDER_NAMES[callee.text]) {
-				const expression = extractExpression(lastCall);
+				const expression = extractExpression(lastCall, null);
 				return {
 					stepType: BUILDER_NAMES[callee.text],
 					expression
@@ -245,13 +312,36 @@ function resolveReExportedCall(chain, ctx) {
 }
 //#endregion
 //#region src/analyzer/stepMatcher.ts
+/** `{name}` tokens in a cucumber expression (empty name is the anonymous `{}`). */
+const PARAM_TOKEN = /\{([^}]*)\}/g;
+/**
+* Compile each definition's cucumber expression with the **same** engine the
+* runtime uses (`@cucumber/cucumber-expressions`), so the analyzer and the
+* runtime agree on what a step matches.
+*
+* A hand-rolled `{param}` → `(.+)` regex used to stand in here, but it treated
+* cucumber-expression alternative (`a/b`) and optional (`text(s)`) syntax as
+* literal characters — so any step definition using them (e.g.
+* `there should be {int} error/errors`) never matched, and every such step was
+* wrongly reported as an undefined step regardless of the real state.
+*
+* Built-in placeholders (`{int}`, `{float}`, `{string}`, `{word}`) keep their
+* real, strict regexes so the analyzer disambiguates the way the runtime does
+* (e.g. `no` isn't an `{int}`). The analyzer has only the expression string, not
+* a custom parser's regexp, so each custom `{name}` is registered as a permissive
+* parameter type (any value) — lenient about the value's exact shape, but still
+* anchored by the surrounding literal text.
+*/
 function compileDefinitions(definitions) {
 	const compiled = [];
 	for (const def of definitions) try {
-		const placeholder = "###PLACEHOLDER###";
-		const regexStr = def.expression.replace(/\{[^}]+\}/g, placeholder).replace(/[.*+?^$()|[\]\\]/g, "\\$&").replace(new RegExp(placeholder, "g"), "(.+)");
+		const registry = new _cucumber_cucumber_expressions.ParameterTypeRegistry();
+		for (const [, name] of def.expression.matchAll(PARAM_TOKEN)) {
+			if (!name || registry.lookupByTypeName(name)) continue;
+			registry.defineParameterType(new _cucumber_cucumber_expressions.ParameterType(name, /.+/, null, (value) => value));
+		}
 		compiled.push({
-			regex: new RegExp(`^${regexStr}$`, "i"),
+			expression: new _cucumber_cucumber_expressions.CucumberExpression(def.expression, registry),
 			definition: def
 		});
 	} catch {}
@@ -277,13 +367,13 @@ function findMatches(text, effectiveKeyword, compiled) {
 		Then: "then"
 	}[effectiveKeyword];
 	const typedMatches = [];
-	for (const { regex, definition } of compiled) {
+	for (const { expression, definition } of compiled) {
 		if (definition.stepType !== expectedStepType) continue;
-		if (regex.test(text)) typedMatches.push(definition);
+		if (expression.match(text) != null) typedMatches.push(definition);
 	}
 	if (typedMatches.length > 0) return typedMatches;
 	const fallbackMatches = [];
-	for (const { regex, definition } of compiled) if (regex.test(text)) fallbackMatches.push(definition);
+	for (const { expression, definition } of compiled) if (expression.match(text) != null) fallbackMatches.push(definition);
 	return fallbackMatches;
 }
 //#endregion
@@ -438,4 +528,4 @@ Object.defineProperty(exports, "matchScenarioSteps", {
 	}
 });
 
-//# sourceMappingURL=analyzer-DIZPMxzN.cjs.map
+//# sourceMappingURL=analyzer-DRudicCk.cjs.map