@substrate-ai/factory 0.19.54

package/dist/graph/parser.js

@@ -0,0 +1,370 @@
+/**
+ * DOT source parser for factory graphs.
+ *
+ * Processing pipeline:
+ *  1. `fromDot()` (ts-graphviz model API) extracts graph-level attributes.
+ *  2. `parse()` (@ts-graphviz/ast) traverses AST in declaration order so
+ *     that `node [...]` / `edge [...]` default blocks apply only to nodes/edges
+ *     declared AFTER the block (standard DOT semantics, GE-P5/P6/P7).
+ *
+ * Story 42-1: graph-level attribute extraction
+ * Story 42-2: node and edge attribute extraction
+ * Story 42-3: chained edge expansion (GE-P5), default blocks (GE-P6),
+ *             subgraph flattening (GE-P7), outgoingEdges helper
+ */
+import { parse } from '@ts-graphviz/ast';
+import { fromDot } from 'ts-graphviz';
+// ---------------------------------------------------------------------------
+// Attribute coercion helpers
+// ---------------------------------------------------------------------------
+function attrStr(attrs, key, fallback) {
+    return Object.prototype.hasOwnProperty.call(attrs, key) ? (attrs[key] ?? fallback) : fallback;
+}
+function attrInt(attrs, key, fallback) {
+    if (!Object.prototype.hasOwnProperty.call(attrs, key))
+        return fallback;
+    const n = parseInt(attrs[key] ?? '', 10);
+    return isNaN(n) ? fallback : n;
+}
+function attrBool(attrs, key, fallback) {
+    if (!Object.prototype.hasOwnProperty.call(attrs, key))
+        return fallback;
+    const v = (attrs[key] ?? '').toLowerCase();
+    return v === 'true' || v === '1' || v === 'yes';
+}
+// ---------------------------------------------------------------------------
+// Class derivation algorithm (GE-P7)
+// ---------------------------------------------------------------------------
+/**
+ * Derive a CSS-style class name from a subgraph label.
+ *
+ * Examples:
+ *   "Loop A"        → "loop-a"
+ *   "Phase 1: Init" → "phase-1-init"
+ *
+ * Returns an empty string when `label` is empty (no class assignment).
+ */
+function deriveClass(label) {
+    return label
+        .toLowerCase()
+        .replace(/\s+/g, '-')
+        .replace(/[^a-z0-9-]/g, '');
+}
+// ---------------------------------------------------------------------------
+// AST attribute extraction
+// ---------------------------------------------------------------------------
+/**
+ * Collect Attribute children from an AST node into a plain AttrMap.
+ * CommentASTNode children are skipped.
+ */
+function extractAttrs(children) {
+    const map = {};
+    for (const child of children) {
+        if (child.type === 'Attribute') {
+            map[child.key.value] = child.value.value;
+        }
+    }
+    return map;
+}
+// ---------------------------------------------------------------------------
+// GraphNode builder
+// ---------------------------------------------------------------------------
+/**
+ * Construct a `GraphNode` from a merged attribute map.
+ *
+ * Priority (highest → lowest): explicit attrs > current node defaults.
+ * `subgraphClass` is applied only when the merged attrs have no `class` key;
+ * an explicit `class` attribute always wins.
+ *
+ * `defaultMaxRetries` is the graph-level default — used when node has no
+ * explicit `max_retries` attribute (story 42-2 AC4).
+ */
+function buildGraphNode(id, attrs, subgraphClass, defaultMaxRetries) {
+    // class: explicit attr wins over subgraph derivation
+    const classAttr = Object.prototype.hasOwnProperty.call(attrs, 'class')
+        ? (attrs['class'] ?? '')
+        : subgraphClass;
+    return {
+        id,
+        label: attrStr(attrs, 'label', ''),
+        shape: attrStr(attrs, 'shape', 'box'),
+        type: attrStr(attrs, 'type', ''),
+        prompt: attrStr(attrs, 'prompt', ''),
+        maxRetries: attrInt(attrs, 'max_retries', defaultMaxRetries),
+        goalGate: attrBool(attrs, 'goal_gate', false),
+        retryTarget: attrStr(attrs, 'retry_target', ''),
+        fallbackRetryTarget: attrStr(attrs, 'fallback_retry_target', ''),
+        fidelity: attrStr(attrs, 'fidelity', ''),
+        threadId: attrStr(attrs, 'thread_id', ''),
+        class: classAttr,
+        timeout: attrInt(attrs, 'timeout', 0),
+        llmModel: attrStr(attrs, 'llm_model', ''),
+        llmProvider: attrStr(attrs, 'llm_provider', ''),
+        reasoningEffort: attrStr(attrs, 'reasoning_effort', ''),
+        autoStatus: attrBool(attrs, 'auto_status', true),
+        allowPartial: attrBool(attrs, 'allow_partial', false),
+        toolCommand: attrStr(attrs, 'tool_command', ''),
+        backend: attrStr(attrs, 'backend', ''),
+        maxParallel: attrInt(attrs, 'maxParallel', 0),
+        joinPolicy: attrStr(attrs, 'joinPolicy', ''),
+    };
+}
+// ---------------------------------------------------------------------------
+// GraphEdge builder
+// ---------------------------------------------------------------------------
+function buildGraphEdge(fromNode, toNode, attrs) {
+    return {
+        fromNode,
+        toNode,
+        label: attrStr(attrs, 'label', ''),
+        condition: attrStr(attrs, 'condition', ''),
+        weight: attrInt(attrs, 'weight', 0),
+        fidelity: attrStr(attrs, 'fidelity', ''),
+        threadId: attrStr(attrs, 'thread_id', ''),
+        loopRestart: attrBool(attrs, 'loop_restart', false),
+    };
+}
+// ---------------------------------------------------------------------------
+// Edge target helper
+// ---------------------------------------------------------------------------
+/**
+ * Extract the node ID from an `EdgeTargetASTNode`.
+ *
+ * For `NodeRef` (single node reference), returns `node.id.value`.
+ * For `NodeRefGroup` (curly-brace groups `{A B}`), returns the first
+ * member's ID — groups are rare in factory graphs.
+ */
+function getEdgeTargetId(target) {
+    if (target.type === 'NodeRef') {
+        return target.id.value;
+    }
+    // NodeRefGroup — use first member
+    const group = target;
+    const first = group.children[0];
+    return first ? first.id.value : '';
+}
+// ---------------------------------------------------------------------------
+// AST traversal (GE-P5, GE-P6, GE-P7 implementation)
+// ---------------------------------------------------------------------------
+/**
+ * Traverse child statements of a Graph or Subgraph AST node **in declaration
+ * order**, accumulating nodes and edges into the caller-provided collections.
+ *
+ * @param stmts              Ordered list of child statements.
+ * @param nodeDefaults       Mutable current node defaults — updated in-place on
+ *                           each `node [...]` block (later block overwrites earlier).
+ * @param edgeDefaults       Mutable current edge defaults — updated similarly.
+ * @param nodes              Output map (node id → GraphNode).
+ * @param edges              Output edge array.
+ * @param subgraphClass      Class name inherited from the nearest enclosing
+ *                           subgraph with a `label` attribute; empty string if none.
+ * @param defaultMaxRetries  Graph-level default for `max_retries`.
+ */
+function traverseStatements(stmts, nodeDefaults, edgeDefaults, nodes, edges, subgraphClass, defaultMaxRetries) {
+    for (const stmt of stmts) {
+        switch (stmt.type) {
+            case 'Comment':
+                break;
+            case 'AttributeList': {
+                // `node [...]`, `edge [...]`, or `graph [...]` default block.
+                const listStmt = stmt;
+                const attrs = extractAttrs(listStmt.children);
+                if (listStmt.kind === 'Node') {
+                    // GE-P6: later node default block overwrites earlier for same key.
+                    Object.assign(nodeDefaults, attrs);
+                }
+                else if (listStmt.kind === 'Edge') {
+                    Object.assign(edgeDefaults, attrs);
+                }
+                // Graph-level defaults (kind='Graph') are extracted by fromDot() already.
+                break;
+            }
+            case 'Attribute':
+                // Direct key=value in a graph or subgraph body (e.g. `label="x"`).
+                // These set the containing graph/subgraph's own attributes, not
+                // node/edge defaults. Subgraph labels are handled in the Subgraph case.
+                break;
+            case 'Node': {
+                // GE-P6: explicit node attrs win over current defaults.
+                const nodeStmt = stmt;
+                const id = nodeStmt.id.value;
+                const explicit = extractAttrs(nodeStmt.children);
+                const merged = { ...nodeDefaults, ...explicit };
+                nodes.set(id, buildGraphNode(id, merged, subgraphClass, defaultMaxRetries));
+                break;
+            }
+            case 'Edge': {
+                // GE-P5: edge defaults applied first; explicit attrs override.
+                const edgeStmt = stmt;
+                const explicit = extractAttrs(edgeStmt.children);
+                const merged = { ...edgeDefaults, ...explicit };
+                // GE-P5: expand chained targets — [A, B, C] → A→B edge, B→C edge.
+                // Also materialise implicit nodes (targets referenced only in edges)
+                // with the node defaults active at the time of the edge declaration.
+                const targets = edgeStmt.targets;
+                for (let i = 0; i < targets.length - 1; i++) {
+                    const from = getEdgeTargetId(targets[i]);
+                    const to = getEdgeTargetId(targets[i + 1]);
+                    if (from && to) {
+                        if (!nodes.has(from)) {
+                            nodes.set(from, buildGraphNode(from, { ...nodeDefaults }, subgraphClass, defaultMaxRetries));
+                        }
+                        if (!nodes.has(to)) {
+                            nodes.set(to, buildGraphNode(to, { ...nodeDefaults }, subgraphClass, defaultMaxRetries));
+                        }
+                        edges.push(buildGraphEdge(from, to, merged));
+                    }
+                }
+                break;
+            }
+            case 'Subgraph': {
+                // GE-P7: derive class from subgraph label, then recurse.
+                const sgStmt = stmt;
+                // Collect the subgraph's own `label` attribute from its direct
+                // Attribute children (not from AttributeList blocks inside it).
+                let sgLabel = '';
+                for (const child of sgStmt.children) {
+                    if (child.type === 'Attribute') {
+                        const attrChild = child;
+                        if (attrChild.key.value === 'label') {
+                            sgLabel = attrChild.value.value;
+                        }
+                    }
+                }
+                // Inner subgraph label takes precedence over outer subgraph class.
+                const derivedClass = sgLabel ? deriveClass(sgLabel) : subgraphClass;
+                // node/edge defaults continue into the subgraph scope (DOT semantics).
+                traverseStatements(sgStmt.children, nodeDefaults, edgeDefaults, nodes, edges, derivedClass, defaultMaxRetries);
+                break;
+            }
+        }
+    }
+}
+// ---------------------------------------------------------------------------
+// Concrete Graph implementation
+// ---------------------------------------------------------------------------
+class GraphImpl {
+    id;
+    goal;
+    label;
+    modelStylesheet;
+    defaultMaxRetries;
+    retryTarget;
+    fallbackRetryTarget;
+    defaultFidelity;
+    nodes;
+    edges;
+    constructor(data) {
+        this.id = data.id;
+        this.goal = data.goal;
+        this.label = data.label;
+        this.modelStylesheet = data.modelStylesheet;
+        this.defaultMaxRetries = data.defaultMaxRetries;
+        this.retryTarget = data.retryTarget;
+        this.fallbackRetryTarget = data.fallbackRetryTarget;
+        this.defaultFidelity = data.defaultFidelity;
+        this.nodes = data.nodes;
+        this.edges = data.edges;
+    }
+    /** Return all edges where `edge.fromNode === nodeId`. */
+    outgoingEdges(nodeId) {
+        return this.edges.filter((e) => e.fromNode === nodeId);
+    }
+    startNode() {
+        for (const node of this.nodes.values()) {
+            if (node.shape === 'Mdiamond' || node.type === 'start') {
+                return node;
+            }
+        }
+        throw new Error('Graph has no start node (shape=Mdiamond or type=start)');
+    }
+    exitNode() {
+        for (const node of this.nodes.values()) {
+            if (node.shape === 'Msquare' || node.type === 'exit') {
+                return node;
+            }
+        }
+        throw new Error('Graph has no exit node (shape=Msquare or type=exit)');
+    }
+}
+function getString(attrList, key, defaultValue) {
+    const val = attrList.get(key);
+    if (val === undefined || val === null)
+        return defaultValue;
+    return String(val);
+}
+function getInt(attrList, key, defaultValue) {
+    const val = attrList.get(key);
+    if (val === undefined || val === null)
+        return defaultValue;
+    const n = parseInt(String(val), 10);
+    return isNaN(n) ? defaultValue : n;
+}
+// ---------------------------------------------------------------------------
+// Public API
+// ---------------------------------------------------------------------------
+/**
+ * Parse a DOT source string into a typed `Graph` model.
+ *
+ * Uses two complementary parsers:
+ *  - `fromDot()` (ts-graphviz model API) for graph-level attributes.
+ *  - `parse()` (@ts-graphviz/ast) for ordered AST traversal, enabling
+ *    correct default block scoping, chained edge expansion, and subgraph
+ *    flattening.
+ *
+ * @throws {Error} with prefix `"DOT parse error: "` on invalid DOT syntax.
+ */
+export function parseGraph(dotSource) {
+    // --- Pass 1: graph-level attributes via fromDot() model API ---
+    let modelAst;
+    try {
+        // fromDot() overloads: call without options returns RootGraphModel (first overload).
+        // Cast needed because TypeScript's ReturnType<> resolves to the last overload.
+        modelAst = fromDot(dotSource);
+    }
+    catch (err) {
+        const message = err instanceof Error ? err.message : String(err);
+        throw new Error(`DOT parse error: ${message}`);
+    }
+    const ga = modelAst.attributes.graph;
+    const id = modelAst.id !== undefined ? String(modelAst.id) : '';
+    const goal = getString(ga, 'goal', '');
+    const label = getString(ga, 'label', '');
+    const modelStylesheet = getString(ga, 'model_stylesheet', '');
+    const defaultMaxRetries = getInt(ga, 'default_max_retries', 0);
+    const retryTarget = getString(ga, 'retry_target', '');
+    const fallbackRetryTarget = getString(ga, 'fallback_retry_target', '');
+    const defaultFidelity = getString(ga, 'default_fidelity', '');
+    // --- Pass 2: AST traversal for nodes, edges, defaults, subgraphs ---
+    let dotAst;
+    try {
+        dotAst = parse(dotSource);
+    }
+    catch (err) {
+        const message = err instanceof Error ? err.message : String(err);
+        throw new Error(`DOT parse error: ${message}`);
+    }
+    const nodes = new Map();
+    const edges = [];
+    // The top-level DotASTNode wraps a GraphASTNode as its first non-comment child.
+    const graphAST = dotAst.children.find((c) => c.type === 'Graph');
+    if (graphAST) {
+        traverseStatements(graphAST.children, {}, // nodeDefaults — start empty
+        {}, // edgeDefaults — start empty
+        nodes, edges, '', // no enclosing subgraph class at top level
+        defaultMaxRetries);
+    }
+    return new GraphImpl({
+        id,
+        goal,
+        label,
+        modelStylesheet,
+        defaultMaxRetries,
+        retryTarget,
+        fallbackRetryTarget,
+        defaultFidelity,
+        nodes,
+        edges,
+    });
+}
+//# sourceMappingURL=parser.js.map

package/dist/graph/parser.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"parser.js","sourceRoot":"","sources":["../../src/graph/parser.ts"],"names":[],"mappings":"AAAA;;;;;;;;;;;;;GAaG;AAEH,OAAO,EAAE,KAAK,EAAE,MAAM,kBAAkB,CAAA;AAcxC,OAAO,EAAE,OAAO,EAAE,MAAM,aAAa,CAAA;AAWrC,8EAA8E;AAC9E,6BAA6B;AAC7B,8EAA8E;AAE9E,SAAS,OAAO,CAAC,KAAc,EAAE,GAAW,EAAE,QAAgB;IAC5D,OAAO,MAAM,CAAC,SAAS,CAAC,cAAc,CAAC,IAAI,CAAC,KAAK,EAAE,GAAG,CAAC,CAAC,CAAC,CAAC,CAAC,KAAK,CAAC,GAAG,CAAC,IAAI,QAAQ,CAAC,CAAC,CAAC,CAAC,QAAQ,CAAA;AAC/F,CAAC;AAED,SAAS,OAAO,CAAC,KAAc,EAAE,GAAW,EAAE,QAAgB;IAC5D,IAAI,CAAC,MAAM,CAAC,SAAS,CAAC,cAAc,CAAC,IAAI,CAAC,KAAK,EAAE,GAAG,CAAC;QAAE,OAAO,QAAQ,CAAA;IACtE,MAAM,CAAC,GAAG,QAAQ,CAAC,KAAK,CAAC,GAAG,CAAC,IAAI,EAAE,EAAE,EAAE,CAAC,CAAA;IACxC,OAAO,KAAK,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,QAAQ,CAAC,CAAC,CAAC,CAAC,CAAA;AAChC,CAAC;AAED,SAAS,QAAQ,CAAC,KAAc,EAAE,GAAW,EAAE,QAAiB;IAC9D,IAAI,CAAC,MAAM,CAAC,SAAS,CAAC,cAAc,CAAC,IAAI,CAAC,KAAK,EAAE,GAAG,CAAC;QAAE,OAAO,QAAQ,CAAA;IACtE,MAAM,CAAC,GAAG,CAAC,KAAK,CAAC,GAAG,CAAC,IAAI,EAAE,CAAC,CAAC,WAAW,EAAE,CAAA;IAC1C,OAAO,CAAC,KAAK,MAAM,IAAI,CAAC,KAAK,GAAG,IAAI,CAAC,KAAK,KAAK,CAAA;AACjD,CAAC;AAED,8EAA8E;AAC9E,qCAAqC;AACrC,8EAA8E;AAE9E;;;;;;;;GAQG;AACH,SAAS,WAAW,CAAC,KAAa;IAChC,OAAO,KAAK;SACT,WAAW,EAAE;SACb,OAAO,CAAC,MAAM,EAAE,GAAG,CAAC;SACpB,OAAO,CAAC,aAAa,EAAE,EAAE,CAAC,CAAA;AAC/B,CAAC;AAED,8EAA8E;AAC9E,2BAA2B;AAC3B,8EAA8E;AAE9E;;;GAGG;AACH,SAAS,YAAY,CAAC,QAA0D;IAC9E,MAAM,GAAG,GAAY,EAAE,CAAA;IACvB,KAAK,MAAM,KAAK,IAAI,QAAQ,EAAE,CAAC;QAC7B,IAAI,KAAK,CAAC,IAAI,KAAK,WAAW,EAAE,CAAC;YAC/B,GAAG,CAAC,KAAK,CAAC,GAAG,CAAC,KAAK,CAAC,GAAG,KAAK,CAAC,KAAK,CAAC,KAAK,CAAA;QAC1C,CAAC;IACH,CAAC;IACD,OAAO,GAAG,CAAA;AACZ,CAAC;AAED,8EAA8E;AAC9E,oBAAoB;AACpB,8EAA8E;AAE9E;;;;;;;;;GASG;AACH,SAAS,cAAc,CACrB,EAAU,EACV,KAAc,EACd,aAAqB,EACrB,iBAAyB;IAEzB,qDAAqD;IACrD,MAAM,SAAS,GAAG,MAAM,CAAC,SAAS,CAAC,cAAc,CAAC,IAAI,CAAC,KAAK,EAAE,OAAO,CAAC;QACpE,CAAC,CAAC,CAAC,KAAK,CAAC,OAAO,CAAC,IAAI,EAAE,CAAC;QACxB,CAAC,CAAC,aAAa,CAAA;IAEjB,OAAO;QACL,EAAE;QACF,KAAK,EAAE,OAAO,CAAC,KAAK,EAAE,OAAO,EAAE,EAAE,CAAC;QAClC,KAAK,EAAE,OAAO,CAAC,KAAK,EAAE,OAAO,EAAE,KAAK,CAAC;QACrC,IAAI,EAAE,OAAO,CAAC,KAAK,EAAE,MAAM,EAAE,EAAE,CAAC;QAChC,MAAM,EAAE,OAAO,CAAC,KAAK,EAAE,QAAQ,EAAE,EAAE,CAAC;QACpC,UAAU,EAAE,OAAO,CAAC,KAAK,EAAE,aAAa,EAAE,iBAAiB,CAAC;QAC5D,QAAQ,EAAE,QAAQ,CAAC,KAAK,EAAE,WAAW,EAAE,KAAK,CAAC;QAC7C,WAAW,EAAE,OAAO,CAAC,KAAK,EAAE,cAAc,EAAE,EAAE,CAAC;QAC/C,mBAAmB,EAAE,OAAO,CAAC,KAAK,EAAE,uBAAuB,EAAE,EAAE,CAAC;QAChE,QAAQ,EAAE,OAAO,CAAC,KAAK,EAAE,UAAU,EAAE,EAAE,CAAC;QACxC,QAAQ,EAAE,OAAO,CAAC,KAAK,EAAE,WAAW,EAAE,EAAE,CAAC;QACzC,KAAK,EAAE,SAAS;QAChB,OAAO,EAAE,OAAO,CAAC,KAAK,EAAE,SAAS,EAAE,CAAC,CAAC;QACrC,QAAQ,EAAE,OAAO,CAAC,KAAK,EAAE,WAAW,EAAE,EAAE,CAAC;QACzC,WAAW,EAAE,OAAO,CAAC,KAAK,EAAE,cAAc,EAAE,EAAE,CAAC;QAC/C,eAAe,EAAE,OAAO,CAAC,KAAK,EAAE,kBAAkB,EAAE,EAAE,CAAC;QACvD,UAAU,EAAE,QAAQ,CAAC,KAAK,EAAE,aAAa,EAAE,IAAI,CAAC;QAChD,YAAY,EAAE,QAAQ,CAAC,KAAK,EAAE,eAAe,EAAE,KAAK,CAAC;QACrD,WAAW,EAAE,OAAO,CAAC,KAAK,EAAE,cAAc,EAAE,EAAE,CAAC;QAC/C,OAAO,EAAE,OAAO,CAAC,KAAK,EAAE,SAAS,EAAE,EAAE,CAAC;QACtC,WAAW,EAAE,OAAO,CAAC,KAAK,EAAE,aAAa,EAAE,CAAC,CAAC;QAC7C,UAAU,EAAE,OAAO,CAAC,KAAK,EAAE,YAAY,EAAE,EAAE,CAAC;KAC7C,CAAA;AACH,CAAC;AAED,8EAA8E;AAC9E,oBAAoB;AACpB,8EAA8E;AAE9E,SAAS,cAAc,CAAC,QAAgB,EAAE,MAAc,EAAE,KAAc;IACtE,OAAO;QACL,QAAQ;QACR,MAAM;QACN,KAAK,EAAE,OAAO,CAAC,KAAK,EAAE,OAAO,EAAE,EAAE,CAAC;QAClC,SAAS,EAAE,OAAO,CAAC,KAAK,EAAE,WAAW,EAAE,EAAE,CAAC;QAC1C,MAAM,EAAE,OAAO,CAAC,KAAK,EAAE,QAAQ,EAAE,CAAC,CAAC;QACnC,QAAQ,EAAE,OAAO,CAAC,KAAK,EAAE,UAAU,EAAE,EAAE,CAAC;QACxC,QAAQ,EAAE,OAAO,CAAC,KAAK,EAAE,WAAW,EAAE,EAAE,CAAC;QACzC,WAAW,EAAE,QAAQ,CAAC,KAAK,EAAE,cAAc,EAAE,KAAK,CAAC;KACpD,CAAA;AACH,CAAC;AAED,8EAA8E;AAC9E,qBAAqB;AACrB,8EAA8E;AAE9E;;;;;;GAMG;AACH,SAAS,eAAe,CAAC,MAA4C;IACnE,IAAI,MAAM,CAAC,IAAI,KAAK,SAAS,EAAE,CAAC;QAC9B,OAAQ,MAAyB,CAAC,EAAE,CAAC,KAAK,CAAA;IAC5C,CAAC;IACD,kCAAkC;IAClC,MAAM,KAAK,GAAG,MAA6B,CAAA;IAC3C,MAAM,KAAK,GAAG,KAAK,CAAC,QAAQ,CAAC,CAAC,CAAC,CAAA;IAC/B,OAAO,KAAK,CAAC,CAAC,CAAC,KAAK,CAAC,EAAE,CAAC,KAAK,CAAC,CAAC,CAAC,EAAE,CAAA;AACpC,CAAC;AAED,8EAA8E;AAC9E,qDAAqD;AACrD,8EAA8E;AAE9E;;;;;;;;;;;;;GAaG;AACH,SAAS,kBAAkB,CACzB,KAA6C,EAC7C,YAAqB,EACrB,YAAqB,EACrB,KAA6B,EAC7B,KAAkB,EAClB,aAAqB,EACrB,iBAAyB;IAEzB,KAAK,MAAM,IAAI,IAAI,KAAK,EAAE,CAAC;QACzB,QAAQ,IAAI,CAAC,IAAI,EAAE,CAAC;YAClB,KAAK,SAAS;gBACZ,MAAK;YAEP,KAAK,eAAe,CAAC,CAAC,CAAC;gBACrB,8DAA8D;gBAC9D,MAAM,QAAQ,GAAG,IAA4B,CAAA;gBAC7C,MAAM,KAAK,GAAG,YAAY,CAAC,QAAQ,CAAC,QAAQ,CAAC,CAAA;gBAC7C,IAAI,QAAQ,CAAC,IAAI,KAAK,MAAM,EAAE,CAAC;oBAC7B,mEAAmE;oBACnE,MAAM,CAAC,MAAM,CAAC,YAAY,EAAE,KAAK,CAAC,CAAA;gBACpC,CAAC;qBAAM,IAAI,QAAQ,CAAC,IAAI,KAAK,MAAM,EAAE,CAAC;oBACpC,MAAM,CAAC,MAAM,CAAC,YAAY,EAAE,KAAK,CAAC,CAAA;gBACpC,CAAC;gBACD,0EAA0E;gBAC1E,MAAK;YACP,CAAC;YAED,KAAK,WAAW;gBACd,mEAAmE;gBACnE,gEAAgE;gBAChE,wEAAwE;gBACxE,MAAK;YAEP,KAAK,MAAM,CAAC,CAAC,CAAC;gBACZ,wDAAwD;gBACxD,MAAM,QAAQ,GAAG,IAAmB,CAAA;gBACpC,MAAM,EAAE,GAAG,QAAQ,CAAC,EAAE,CAAC,KAAK,CAAA;gBAC5B,MAAM,QAAQ,GAAG,YAAY,CAAC,QAAQ,CAAC,QAAQ,CAAC,CAAA;gBAChD,MAAM,MAAM,GAAY,EAAE,GAAG,YAAY,EAAE,GAAG,QAAQ,EAAE,CAAA;gBACxD,KAAK,CAAC,GAAG,CAAC,EAAE,EAAE,cAAc,CAAC,EAAE,EAAE,MAAM,EAAE,aAAa,EAAE,iBAAiB,CAAC,CAAC,CAAA;gBAC3E,MAAK;YACP,CAAC;YAED,KAAK,MAAM,CAAC,CAAC,CAAC;gBACZ,+DAA+D;gBAC/D,MAAM,QAAQ,GAAG,IAAmB,CAAA;gBACpC,MAAM,QAAQ,GAAG,YAAY,CAAC,QAAQ,CAAC,QAAQ,CAAC,CAAA;gBAChD,MAAM,MAAM,GAAY,EAAE,GAAG,YAAY,EAAE,GAAG,QAAQ,EAAE,CAAA;gBAExD,kEAAkE;gBAClE,qEAAqE;gBACrE,qEAAqE;gBACrE,MAAM,OAAO,GAAG,QAAQ,CAAC,OAAO,CAAA;gBAChC,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,OAAO,CAAC,MAAM,GAAG,CAAC,EAAE,CAAC,EAAE,EAAE,CAAC;oBAC5C,MAAM,IAAI,GAAG,eAAe,CAAC,OAAO,CAAC,CAAC,CAAE,CAAC,CAAA;oBACzC,MAAM,EAAE,GAAG,eAAe,CAAC,OAAO,CAAC,CAAC,GAAG,CAAC,CAAE,CAAC,CAAA;oBAC3C,IAAI,IAAI,IAAI,EAAE,EAAE,CAAC;wBACf,IAAI,CAAC,KAAK,CAAC,GAAG,CAAC,IAAI,CAAC,EAAE,CAAC;4BACrB,KAAK,CAAC,GAAG,CAAC,IAAI,EAAE,cAAc,CAAC,IAAI,EAAE,EAAE,GAAG,YAAY,EAAE,EAAE,aAAa,EAAE,iBAAiB,CAAC,CAAC,CAAA;wBAC9F,CAAC;wBACD,IAAI,CAAC,KAAK,CAAC,GAAG,CAAC,EAAE,CAAC,EAAE,CAAC;4BACnB,KAAK,CAAC,GAAG,CAAC,EAAE,EAAE,cAAc,CAAC,EAAE,EAAE,EAAE,GAAG,YAAY,EAAE,EAAE,aAAa,EAAE,iBAAiB,CAAC,CAAC,CAAA;wBAC1F,CAAC;wBACD,KAAK,CAAC,IAAI,CAAC,cAAc,CAAC,IAAI,EAAE,EAAE,EAAE,MAAM,CAAC,CAAC,CAAA;oBAC9C,CAAC;gBACH,CAAC;gBACD,MAAK;YACP,CAAC;YAED,KAAK,UAAU,CAAC,CAAC,CAAC;gBAChB,yDAAyD;gBACzD,MAAM,MAAM,GAAG,IAAuB,CAAA;gBAEtC,+DAA+D;gBAC/D,gEAAgE;gBAChE,IAAI,OAAO,GAAG,EAAE,CAAA;gBAChB,KAAK,MAAM,KAAK,IAAI,MAAM,CAAC,QAAQ,EAAE,CAAC;oBACpC,IAAI,KAAK,CAAC,IAAI,KAAK,WAAW,EAAE,CAAC;wBAC/B,MAAM,SAAS,GAAG,KAAyB,CAAA;wBAC3C,IAAI,SAAS,CAAC,GAAG,CAAC,KAAK,KAAK,OAAO,EAAE,CAAC;4BACpC,OAAO,GAAG,SAAS,CAAC,KAAK,CAAC,KAAK,CAAA;wBACjC,CAAC;oBACH,CAAC;gBACH,CAAC;gBAED,mEAAmE;gBACnE,MAAM,YAAY,GAAG,OAAO,CAAC,CAAC,CAAC,WAAW,CAAC,OAAO,CAAC,CAAC,CAAC,CAAC,aAAa,CAAA;gBAEnE,uEAAuE;gBACvE,kBAAkB,CAChB,MAAM,CAAC,QAAQ,EACf,YAAY,EACZ,YAAY,EACZ,KAAK,EACL,KAAK,EACL,YAAY,EACZ,iBAAiB,CAClB,CAAA;gBACD,MAAK;YACP,CAAC;QACH,CAAC;IACH,CAAC;AACH,CAAC;AAED,8EAA8E;AAC9E,gCAAgC;AAChC,8EAA8E;AAE9E,MAAM,SAAS;IACb,EAAE,CAAQ;IACV,IAAI,CAAQ;IACZ,KAAK,CAAQ;IACb,eAAe,CAAQ;IACvB,iBAAiB,CAAQ;IACzB,WAAW,CAAQ;IACnB,mBAAmB,CAAQ;IAC3B,eAAe,CAAmB;IAClC,KAAK,CAAwB;IAC7B,KAAK,CAAa;IAElB,YAAY,IAA6D;QACvE,IAAI,CAAC,EAAE,GAAG,IAAI,CAAC,EAAE,CAAA;QACjB,IAAI,CAAC,IAAI,GAAG,IAAI,CAAC,IAAI,CAAA;QACrB,IAAI,CAAC,KAAK,GAAG,IAAI,CAAC,KAAK,CAAA;QACvB,IAAI,CAAC,eAAe,GAAG,IAAI,CAAC,eAAe,CAAA;QAC3C,IAAI,CAAC,iBAAiB,GAAG,IAAI,CAAC,iBAAiB,CAAA;QAC/C,IAAI,CAAC,WAAW,GAAG,IAAI,CAAC,WAAW,CAAA;QACnC,IAAI,CAAC,mBAAmB,GAAG,IAAI,CAAC,mBAAmB,CAAA;QACnD,IAAI,CAAC,eAAe,GAAG,IAAI,CAAC,eAAe,CAAA;QAC3C,IAAI,CAAC,KAAK,GAAG,IAAI,CAAC,KAAK,CAAA;QACvB,IAAI,CAAC,KAAK,GAAG,IAAI,CAAC,KAAK,CAAA;IACzB,CAAC;IAED,yDAAyD;IACzD,aAAa,CAAC,MAAc;QAC1B,OAAO,IAAI,CAAC,KAAK,CAAC,MAAM,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,QAAQ,KAAK,MAAM,CAAC,CAAA;IACxD,CAAC;IAED,SAAS;QACP,KAAK,MAAM,IAAI,IAAI,IAAI,CAAC,KAAK,CAAC,MAAM,EAAE,EAAE,CAAC;YACvC,IAAI,IAAI,CAAC,KAAK,KAAK,UAAU,IAAI,IAAI,CAAC,IAAI,KAAK,OAAO,EAAE,CAAC;gBACvD,OAAO,IAAI,CAAA;YACb,CAAC;QACH,CAAC;QACD,MAAM,IAAI,KAAK,CAAC,wDAAwD,CAAC,CAAA;IAC3E,CAAC;IAED,QAAQ;QACN,KAAK,MAAM,IAAI,IAAI,IAAI,CAAC,KAAK,CAAC,MAAM,EAAE,EAAE,CAAC;YACvC,IAAI,IAAI,CAAC,KAAK,KAAK,SAAS,IAAI,IAAI,CAAC,IAAI,KAAK,MAAM,EAAE,CAAC;gBACrD,OAAO,IAAI,CAAA;YACb,CAAC;QACH,CAAC;QACD,MAAM,IAAI,KAAK,CAAC,qDAAqD,CAAC,CAAA;IACxE,CAAC;CACF;AAUD,SAAS,SAAS,CAAC,QAAuB,EAAE,GAAW,EAAE,YAAoB;IAC3E,MAAM,GAAG,GAAG,QAAQ,CAAC,GAAG,CAAC,GAAG,CAAC,CAAA;IAC7B,IAAI,GAAG,KAAK,SAAS,IAAI,GAAG,KAAK,IAAI;QAAE,OAAO,YAAY,CAAA;IAC1D,OAAO,MAAM,CAAC,GAAG,CAAC,CAAA;AACpB,CAAC;AAED,SAAS,MAAM,CAAC,QAAuB,EAAE,GAAW,EAAE,YAAoB;IACxE,MAAM,GAAG,GAAG,QAAQ,CAAC,GAAG,CAAC,GAAG,CAAC,CAAA;IAC7B,IAAI,GAAG,KAAK,SAAS,IAAI,GAAG,KAAK,IAAI;QAAE,OAAO,YAAY,CAAA;IAC1D,MAAM,CAAC,GAAG,QAAQ,CAAC,MAAM,CAAC,GAAG,CAAC,EAAE,EAAE,CAAC,CAAA;IACnC,OAAO,KAAK,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,YAAY,CAAC,CAAC,CAAC,CAAC,CAAA;AACpC,CAAC;AAED,8EAA8E;AAC9E,aAAa;AACb,8EAA8E;AAE9E;;;;;;;;;;GAUG;AACH,MAAM,UAAU,UAAU,CAAC,SAAiB;IAC1C,iEAAiE;IACjE,IAAI,QAAwB,CAAA;IAC5B,IAAI,CAAC;QACH,qFAAqF;QACrF,+EAA+E;QAC/E,QAAQ,GAAG,OAAO,CAAC,SAAS,CAAmB,CAAA;IACjD,CAAC;IAAC,OAAO,GAAG,EAAE,CAAC;QACb,MAAM,OAAO,GAAG,GAAG,YAAY,KAAK,CAAC,CAAC,CAAC,GAAG,CAAC,OAAO,CAAC,CAAC,CAAC,MAAM,CAAC,GAAG,CAAC,CAAA;QAChE,MAAM,IAAI,KAAK,CAAC,oBAAoB,OAAO,EAAE,CAAC,CAAA;IAChD,CAAC;IAED,MAAM,EAAE,GAAG,QAAQ,CAAC,UAAU,CAAC,KAAsB,CAAA;IACrD,MAAM,EAAE,GAAG,QAAQ,CAAC,EAAE,KAAK,SAAS,CAAC,CAAC,CAAC,MAAM,CAAC,QAAQ,CAAC,EAAE,CAAC,CAAC,CAAC,CAAC,EAAE,CAAA;IAC/D,MAAM,IAAI,GAAG,SAAS,CAAC,EAAE,EAAE,MAAM,EAAE,EAAE,CAAC,CAAA;IACtC,MAAM,KAAK,GAAG,SAAS,CAAC,EAAE,EAAE,OAAO,EAAE,EAAE,CAAC,CAAA;IACxC,MAAM,eAAe,GAAG,SAAS,CAAC,EAAE,EAAE,kBAAkB,EAAE,EAAE,CAAC,CAAA;IAC7D,MAAM,iBAAiB,GAAG,MAAM,CAAC,EAAE,EAAE,qBAAqB,EAAE,CAAC,CAAC,CAAA;IAC9D,MAAM,WAAW,GAAG,SAAS,CAAC,EAAE,EAAE,cAAc,EAAE,EAAE,CAAC,CAAA;IACrD,MAAM,mBAAmB,GAAG,SAAS,CAAC,EAAE,EAAE,uBAAuB,EAAE,EAAE,CAAC,CAAA;IACtE,MAAM,eAAe,GAAG,SAAS,CAAC,EAAE,EAAE,kBAAkB,EAAE,EAAE,CAAsB,CAAA;IAElF,sEAAsE;IACtE,IAAI,MAAkB,CAAA;IACtB,IAAI,CAAC;QACH,MAAM,GAAG,KAAK,CAAC,SAAS,CAAC,CAAA;IAC3B,CAAC;IAAC,OAAO,GAAG,EAAE,CAAC;QACb,MAAM,OAAO,GAAG,GAAG,YAAY,KAAK,CAAC,CAAC,CAAC,GAAG,CAAC,OAAO,CAAC,CAAC,CAAC,MAAM,CAAC,GAAG,CAAC,CAAA;QAChE,MAAM,IAAI,KAAK,CAAC,oBAAoB,OAAO,EAAE,CAAC,CAAA;IAChD,CAAC;IAED,MAAM,KAAK,GAAG,IAAI,GAAG,EAAqB,CAAA;IAC1C,MAAM,KAAK,GAAgB,EAAE,CAAA;IAE7B,gFAAgF;IAChF,MAAM,QAAQ,GAAG,MAAM,CAAC,QAAQ,CAAC,IAAI,CAAC,CAAC,CAAC,EAAqB,EAAE,CAAC,CAAC,CAAC,IAAI,KAAK,OAAO,CAAC,CAAA;IACnF,IAAI,QAAQ,EAAE,CAAC;QACb,kBAAkB,CAChB,QAAQ,CAAC,QAAQ,EACjB,EAAE,EAAE,6BAA6B;QACjC,EAAE,EAAE,6BAA6B;QACjC,KAAK,EACL,KAAK,EACL,EAAE,EAAE,2CAA2C;QAC/C,iBAAiB,CAClB,CAAA;IACH,CAAC;IAED,OAAO,IAAI,SAAS,CAAC;QACnB,EAAE;QACF,IAAI;QACJ,KAAK;QACL,eAAe;QACf,iBAAiB;QACjB,WAAW;QACX,mBAAmB;QACnB,eAAe;QACf,KAAK;QACL,KAAK;KACN,CAAC,CAAA;AACJ,CAAC"}

package/dist/graph/rules/error-rules.d.ts

@@ -0,0 +1,19 @@
+/**
+ * All 8 error-severity lint rules for the Attractor graph validator.
+ * Story 42-4: Graph Validator — Error Rules
+ */
+import type { GraphNode, LintRule } from '../types.js';
+/**
+ * Returns true if the given node is the graph's start node.
+ * A node is the start node if:
+ *   node.shape === 'Mdiamond'  OR  node.id === 'start'  OR  node.id === 'Start'
+ */
+export declare function isStartNode(node: GraphNode): boolean;
+/**
+ * Returns true if the given node is the graph's exit node.
+ * A node is the exit node if:
+ *   node.shape === 'Msquare'  OR  node.id === 'exit'  OR  node.id === 'end'
+ */
+export declare function isExitNode(node: GraphNode): boolean;
+export declare const errorRules: LintRule[];
+//# sourceMappingURL=error-rules.d.ts.map

package/dist/graph/rules/error-rules.d.ts.map

@@ -0,0 +1 @@
+{"version":3,"file":"error-rules.d.ts","sourceRoot":"","sources":["../../../src/graph/rules/error-rules.ts"],"names":[],"mappings":"AAAA;;;GAGG;AAEH,OAAO,KAAK,EAAS,SAAS,EAAE,QAAQ,EAAwB,MAAM,aAAa,CAAA;AAQnF;;;;GAIG;AACH,wBAAgB,WAAW,CAAC,IAAI,EAAE,SAAS,GAAG,OAAO,CAEpD;AAED;;;;GAIG;AACH,wBAAgB,UAAU,CAAC,IAAI,EAAE,SAAS,GAAG,OAAO,CAEnD;AAgPD,eAAO,MAAM,UAAU,EAAE,QAAQ,EAShC,CAAA"}

package/dist/graph/rules/error-rules.js

@@ -0,0 +1,264 @@
+/**
+ * All 8 error-severity lint rules for the Attractor graph validator.
+ * Story 42-4: Graph Validator — Error Rules
+ */
+import { parseCondition, ConditionParseError } from '../condition-parser.js';
+import { parseStylesheet, StylesheetParseError } from '../../stylesheet/parser.js';
+// ---------------------------------------------------------------------------
+// Start / exit node detection helpers
+// ---------------------------------------------------------------------------
+/**
+ * Returns true if the given node is the graph's start node.
+ * A node is the start node if:
+ *   node.shape === 'Mdiamond'  OR  node.id === 'start'  OR  node.id === 'Start'
+ */
+export function isStartNode(node) {
+    return node.shape === 'Mdiamond' || node.id === 'start' || node.id === 'Start';
+}
+/**
+ * Returns true if the given node is the graph's exit node.
+ * A node is the exit node if:
+ *   node.shape === 'Msquare'  OR  node.id === 'exit'  OR  node.id === 'end'
+ */
+export function isExitNode(node) {
+    return node.shape === 'Msquare' || node.id === 'exit' || node.id === 'end';
+}
+// ---------------------------------------------------------------------------
+// Rule 1: start_node
+// Exactly one start node must exist.
+// ---------------------------------------------------------------------------
+const startNodeRule = {
+    id: 'start_node',
+    severity: 'error',
+    check(graph) {
+        const startNodes = [...graph.nodes.values()].filter(isStartNode);
+        if (startNodes.length === 1)
+            return [];
+        return [
+            {
+                ruleId: 'start_node',
+                severity: 'error',
+                message: `Expected exactly one start node (shape=Mdiamond or id=start/Start), found ${startNodes.length}`,
+            },
+        ];
+    },
+};
+// ---------------------------------------------------------------------------
+// Rule 2: terminal_node
+// Exactly one exit node must exist.
+// ---------------------------------------------------------------------------
+const terminalNodeRule = {
+    id: 'terminal_node',
+    severity: 'error',
+    check(graph) {
+        const exitNodes = [...graph.nodes.values()].filter(isExitNode);
+        if (exitNodes.length === 1)
+            return [];
+        return [
+            {
+                ruleId: 'terminal_node',
+                severity: 'error',
+                message: `Expected exactly one terminal node (shape=Msquare or id=exit/end), found ${exitNodes.length}`,
+            },
+        ];
+    },
+};
+// ---------------------------------------------------------------------------
+// Rule 3: start_no_incoming
+// The start node must not have any incoming edges.
+// ---------------------------------------------------------------------------
+const startNoIncomingRule = {
+    id: 'start_no_incoming',
+    severity: 'error',
+    check(graph) {
+        const startNodes = [...graph.nodes.values()].filter(isStartNode);
+        // Defer to start_node rule if zero or multiple start nodes
+        if (startNodes.length !== 1)
+            return [];
+        const startId = startNodes[0].id;
+        const diagnostics = [];
+        for (let i = 0; i < graph.edges.length; i++) {
+            const edge = graph.edges[i];
+            if (edge.toNode === startId) {
+                diagnostics.push({
+                    ruleId: 'start_no_incoming',
+                    severity: 'error',
+                    message: `Edge at index ${i} targets the start node '${startId}'; start nodes must have no incoming edges`,
+                    edgeIndex: i,
+                });
+            }
+        }
+        return diagnostics;
+    },
+};
+// ---------------------------------------------------------------------------
+// Rule 4: exit_no_outgoing
+// The exit node must not have any outgoing edges.
+// ---------------------------------------------------------------------------
+const exitNoOutgoingRule = {
+    id: 'exit_no_outgoing',
+    severity: 'error',
+    check(graph) {
+        const exitNodes = [...graph.nodes.values()].filter(isExitNode);
+        // Defer to terminal_node rule if zero or multiple exit nodes
+        if (exitNodes.length !== 1)
+            return [];
+        const exitId = exitNodes[0].id;
+        const diagnostics = [];
+        for (let i = 0; i < graph.edges.length; i++) {
+            const edge = graph.edges[i];
+            if (edge.fromNode === exitId) {
+                diagnostics.push({
+                    ruleId: 'exit_no_outgoing',
+                    severity: 'error',
+                    message: `Edge at index ${i} originates from the exit node '${exitId}'; exit nodes must have no outgoing edges`,
+                    edgeIndex: i,
+                });
+            }
+        }
+        return diagnostics;
+    },
+};
+// ---------------------------------------------------------------------------
+// Rule 5: edge_target_exists
+// Every edge target must refer to an existing node.
+// ---------------------------------------------------------------------------
+const edgeTargetExistsRule = {
+    id: 'edge_target_exists',
+    severity: 'error',
+    check(graph) {
+        const diagnostics = [];
+        for (let i = 0; i < graph.edges.length; i++) {
+            const edge = graph.edges[i];
+            if (!graph.nodes.has(edge.toNode)) {
+                diagnostics.push({
+                    ruleId: 'edge_target_exists',
+                    severity: 'error',
+                    message: `Edge at index ${i} targets non-existent node '${edge.toNode}'`,
+                    edgeIndex: i,
+                });
+            }
+        }
+        return diagnostics;
+    },
+};
+// ---------------------------------------------------------------------------
+// Rule 6: reachability
+// Every node must be reachable from the start node via BFS traversal.
+// ---------------------------------------------------------------------------
+const reachabilityRule = {
+    id: 'reachability',
+    severity: 'error',
+    check(graph) {
+        const startNodes = [...graph.nodes.values()].filter(isStartNode);
+        // Defer to start_node rule if there's not exactly one start node
+        if (startNodes.length !== 1)
+            return [];
+        const startId = startNodes[0].id;
+        const visited = new Set();
+        const queue = [startId];
+        while (queue.length > 0) {
+            const nodeId = queue.shift();
+            if (visited.has(nodeId))
+                continue;
+            visited.add(nodeId);
+            for (const edge of graph.outgoingEdges(nodeId)) {
+                if (!visited.has(edge.toNode)) {
+                    queue.push(edge.toNode);
+                }
+            }
+        }
+        const diagnostics = [];
+        for (const [nodeId] of graph.nodes) {
+            if (!visited.has(nodeId)) {
+                diagnostics.push({
+                    ruleId: 'reachability',
+                    severity: 'error',
+                    message: `Node '${nodeId}' is not reachable from start`,
+                    nodeId,
+                });
+            }
+        }
+        return diagnostics;
+    },
+};
+// ---------------------------------------------------------------------------
+// Rule 7: condition_syntax
+// Edge condition expressions must conform to the condition grammar.
+// Uses parseCondition from story 42-6 — catches double-equals and other
+// invalid operators, empty clauses, and malformed expressions.
+// ---------------------------------------------------------------------------
+const conditionSyntaxRule = {
+    id: 'condition_syntax',
+    severity: 'error',
+    check(graph) {
+        const diagnostics = [];
+        for (let i = 0; i < graph.edges.length; i++) {
+            const edge = graph.edges[i];
+            // LLM-prefixed conditions (e.g. "llm:...") are evaluated at runtime via the
+            // edge-selector's LLM evaluator and do not conform to the key=value condition
+            // grammar. Skip syntax validation for them to avoid false-positive errors.
+            if (edge.condition && !edge.condition.trim().startsWith('llm:')) {
+                try {
+                    parseCondition(edge.condition);
+                }
+                catch (err) {
+                    if (err instanceof ConditionParseError) {
+                        diagnostics.push({
+                            ruleId: 'condition_syntax',
+                            severity: 'error',
+                            message: `Edge at index ${i} has invalid condition syntax: '${edge.condition}'`,
+                            edgeIndex: i,
+                        });
+                    }
+                    else {
+                        throw err;
+                    }
+                }
+            }
+        }
+        return diagnostics;
+    },
+};
+// ---------------------------------------------------------------------------
+// Rule 8: stylesheet_syntax
+// Model stylesheet must be parseable by the real stylesheet parser (story 42-7).
+// ---------------------------------------------------------------------------
+const stylesheetSyntaxRule = {
+    id: 'stylesheet_syntax',
+    severity: 'error',
+    check(graph) {
+        if (!graph.modelStylesheet)
+            return [];
+        try {
+            parseStylesheet(graph.modelStylesheet);
+            return [];
+        }
+        catch (err) {
+            if (err instanceof StylesheetParseError) {
+                return [
+                    {
+                        ruleId: 'stylesheet_syntax',
+                        severity: 'error',
+                        message: `Model stylesheet has invalid syntax: ${err.message}`,
+                    },
+                ];
+            }
+            throw err;
+        }
+    },
+};
+// ---------------------------------------------------------------------------
+// Exported rule collection
+// ---------------------------------------------------------------------------
+export const errorRules = [
+    startNodeRule,
+    terminalNodeRule,
+    startNoIncomingRule,
+    exitNoOutgoingRule,
+    edgeTargetExistsRule,
+    reachabilityRule,
+    conditionSyntaxRule,
+    stylesheetSyntaxRule,
+];
+//# sourceMappingURL=error-rules.js.map