namespaceSqlFaker\Generation\Derivation
Namespaces 1§
| Completion | SqlFaker\Generation\Derivation\Completion |
Classes 13§
| CompletionCosts @visibility root | Computes minimum expansion costs separately for empty and non-empty output. |
| CompletionFrontier | Orders pending completions by their admissible lower bound and prunes equivalent more expensive states. |
| CompletionMemo | Reuses exact minima, affordable witnesses and exhausted-budget proofs within one immutable plan. |
| CompletionReduction | Eliminates independent subtrees using exact empty/non-empty costs instead of enumerating their derivations. |
| CompletionState | A leftmost derivation frontier with capped occurrence counters and an output obligation. |
| ConstrainedCompletion | Finds the cheapest completion respecting occurrence-specific patterns and pending siblings.
Unconstrained grammar costs are an admissible lower bound, never a claimed constrained minimum. |
| ConstraintDependencies | Finds exactly which grammar rules can reach a still-constrained occurrence. |
| Derivation @visibility root | Derives terminals from a common grammar while reserving enough steps to finish the remaining form. |
| DerivationNode @visibility root | Identifies an occurrence in a derivation rather than an object in the grammar. |
| DerivationTrace | Tracks occurrence identity alongside the sentential form without selecting productions. |
| TerminationAnalyzer @visibility root | Answers what it still costs to finish a rule or a production. |
| TerminationCost @visibility namespace | Answers the least a rule can cost to finish. |
| TokenGenerator | Derives grammar terminals without choosing spellings or pruning unsupported lexemes. |