/**
 * Smoke test: compose grammars with the DSL, parse real input, walk the tree.
 *
 * Exercised paths:
 *   - Scanner primitives: Match (KMP), Any (char class), Not
 *   - Race (parallel matchers)
 *   - Grammar DSL: define, from, after, match, any, not, push, terminate
 *   - Pushdown automaton: nested intervals with parent/child relationships
 *   - Parse tree: Interval + DataToken output with position tracking
 *
 * Exits non-zero on any assertion failure (so `npm run smoke` surfaces it).
 *
 * NOTE: The composed-grammar case here is intentionally simple. Complex
 * real-world grammars (JSON + embedded mlang, HTML, etc.) require careful
 * state-machine design to avoid GOTO deadlocks — see the original source
 * repo's syntaxes/ directory for worked examples.
 */
export {};
//# sourceMappingURL=smoke.d.ts.map