@stevenvo780/st-lang 4.8.0 → 4.10.0

package/dist/reasoning/automata/languages.js

@@ -0,0 +1,78 @@
+"use strict";
+// ============================================================
+// ST Automata — Lenguajes estándar de fábrica
+// ============================================================
+//
+// DFAs / regex de ejemplo, útiles para tests y demos:
+//   · dfaEvenZeros()   — palabras sobre {0,1} con número par de '0'.
+//   · dfaContainsAB()  — palabras sobre {a,b,c} que contienen "ab".
+//   · regexEmail()     — regex simplificada de email.
+// ============================================================
+Object.defineProperty(exports, "__esModule", { value: true });
+exports.dfaEvenZeros = dfaEvenZeros;
+exports.dfaContainsAB = dfaContainsAB;
+exports.regexEmail = regexEmail;
+const regex_1 = require("./regex");
+/** Palabras sobre {0,1} con un número par de ceros. */
+function dfaEvenZeros() {
+    const states = new Set(['even', 'odd']);
+    const alphabet = new Set(['0', '1']);
+    const transitions = new Map();
+    transitions.set('even', new Map([
+        ['0', 'odd'],
+        ['1', 'even'],
+    ]));
+    transitions.set('odd', new Map([
+        ['0', 'even'],
+        ['1', 'odd'],
+    ]));
+    return {
+        states,
+        alphabet,
+        transitions,
+        initial: 'even',
+        accept: new Set(['even']),
+    };
+}
+/** Palabras sobre {a,b,c} que contienen "ab" como subcadena. */
+function dfaContainsAB() {
+    const states = new Set(['q0', 'q1', 'q2']);
+    const alphabet = new Set(['a', 'b', 'c']);
+    const transitions = new Map();
+    transitions.set('q0', new Map([
+        ['a', 'q1'],
+        ['b', 'q0'],
+        ['c', 'q0'],
+    ]));
+    transitions.set('q1', new Map([
+        ['a', 'q1'],
+        ['b', 'q2'],
+        ['c', 'q0'],
+    ]));
+    transitions.set('q2', new Map([
+        ['a', 'q2'],
+        ['b', 'q2'],
+        ['c', 'q2'],
+    ]));
+    return {
+        states,
+        alphabet,
+        transitions,
+        initial: 'q0',
+        accept: new Set(['q2']),
+    };
+}
+/** Regex simplificada de email: letras+ '@' letras+ '.' letras+
+ *  (ASCII inferior, sin números / símbolos). Es deliberadamente
+ *  pedagógica; no aspira a RFC 5322. */
+function regexEmail() {
+    // (a|b|...|z)+ @ (a|...|z)+ . (a|...|z)+
+    const letters = [];
+    for (let c = 'a'.charCodeAt(0); c <= 'z'.charCodeAt(0); c++) {
+        letters.push(String.fromCharCode(c));
+    }
+    const alt = letters.join('|');
+    const src = `(${alt})+@(${alt})+\\.(${alt})+`;
+    return (0, regex_1.parseRegex)(src);
+}
+//# sourceMappingURL=languages.js.map

package/dist/reasoning/automata/languages.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"languages.js","sourceRoot":"","sources":["../../../src/reasoning/automata/languages.ts"],"names":[],"mappings":";AAAA,+DAA+D;AAC/D,8CAA8C;AAC9C,+DAA+D;AAC/D,EAAE;AACF,sDAAsD;AACtD,qEAAqE;AACrE,oEAAoE;AACpE,sDAAsD;AACtD,+DAA+D;;AAM/D,oCAyBC;AAGD,sCAmCC;AAKD,gCASC;AAhFD,mCAAqC;AAErC,uDAAuD;AACvD,SAAgB,YAAY;IAC1B,MAAM,MAAM,GAAG,IAAI,GAAG,CAAS,CAAC,MAAM,EAAE,KAAK,CAAC,CAAC,CAAC;IAChD,MAAM,QAAQ,GAAG,IAAI,GAAG,CAAS,CAAC,GAAG,EAAE,GAAG,CAAC,CAAC,CAAC;IAC7C,MAAM,WAAW,GAAG,IAAI,GAAG,EAA+B,CAAC;IAC3D,WAAW,CAAC,GAAG,CACb,MAAM,EACN,IAAI,GAAG,CAAiB;QACtB,CAAC,GAAG,EAAE,KAAK,CAAC;QACZ,CAAC,GAAG,EAAE,MAAM,CAAC;KACd,CAAC,CACH,CAAC;IACF,WAAW,CAAC,GAAG,CACb,KAAK,EACL,IAAI,GAAG,CAAiB;QACtB,CAAC,GAAG,EAAE,MAAM,CAAC;QACb,CAAC,GAAG,EAAE,KAAK,CAAC;KACb,CAAC,CACH,CAAC;IACF,OAAO;QACL,MAAM;QACN,QAAQ;QACR,WAAW;QACX,OAAO,EAAE,MAAM;QACf,MAAM,EAAE,IAAI,GAAG,CAAC,CAAC,MAAM,CAAC,CAAC;KAC1B,CAAC;AACJ,CAAC;AAED,gEAAgE;AAChE,SAAgB,aAAa;IAC3B,MAAM,MAAM,GAAG,IAAI,GAAG,CAAS,CAAC,IAAI,EAAE,IAAI,EAAE,IAAI,CAAC,CAAC,CAAC;IACnD,MAAM,QAAQ,GAAG,IAAI,GAAG,CAAS,CAAC,GAAG,EAAE,GAAG,EAAE,GAAG,CAAC,CAAC,CAAC;IAClD,MAAM,WAAW,GAAG,IAAI,GAAG,EAA+B,CAAC;IAC3D,WAAW,CAAC,GAAG,CACb,IAAI,EACJ,IAAI,GAAG,CAAiB;QACtB,CAAC,GAAG,EAAE,IAAI,CAAC;QACX,CAAC,GAAG,EAAE,IAAI,CAAC;QACX,CAAC,GAAG,EAAE,IAAI,CAAC;KACZ,CAAC,CACH,CAAC;IACF,WAAW,CAAC,GAAG,CACb,IAAI,EACJ,IAAI,GAAG,CAAiB;QACtB,CAAC,GAAG,EAAE,IAAI,CAAC;QACX,CAAC,GAAG,EAAE,IAAI,CAAC;QACX,CAAC,GAAG,EAAE,IAAI,CAAC;KACZ,CAAC,CACH,CAAC;IACF,WAAW,CAAC,GAAG,CACb,IAAI,EACJ,IAAI,GAAG,CAAiB;QACtB,CAAC,GAAG,EAAE,IAAI,CAAC;QACX,CAAC,GAAG,EAAE,IAAI,CAAC;QACX,CAAC,GAAG,EAAE,IAAI,CAAC;KACZ,CAAC,CACH,CAAC;IACF,OAAO;QACL,MAAM;QACN,QAAQ;QACR,WAAW;QACX,OAAO,EAAE,IAAI;QACb,MAAM,EAAE,IAAI,GAAG,CAAC,CAAC,IAAI,CAAC,CAAC;KACxB,CAAC;AACJ,CAAC;AAED;;wCAEwC;AACxC,SAAgB,UAAU;IACxB,yCAAyC;IACzC,MAAM,OAAO,GAAa,EAAE,CAAC;IAC7B,KAAK,IAAI,CAAC,GAAG,GAAG,CAAC,UAAU,CAAC,CAAC,CAAC,EAAE,CAAC,IAAI,GAAG,CAAC,UAAU,CAAC,CAAC,CAAC,EAAE,CAAC,EAAE,EAAE,CAAC;QAC5D,OAAO,CAAC,IAAI,CAAC,MAAM,CAAC,YAAY,CAAC,CAAC,CAAC,CAAC,CAAC;IACvC,CAAC;IACD,MAAM,GAAG,GAAG,OAAO,CAAC,IAAI,CAAC,GAAG,CAAC,CAAC;IAC9B,MAAM,GAAG,GAAG,IAAI,GAAG,OAAO,GAAG,SAAS,GAAG,IAAI,CAAC;IAC9C,OAAO,IAAA,kBAAU,EAAC,GAAG,CAAC,CAAC;AACzB,CAAC"}

package/dist/reasoning/automata/nfa.d.ts

@@ -0,0 +1,8 @@
+import type { DFA, NFA } from './types';
+/** Cierre-ε: el menor conjunto T ⊇ S cerrado bajo transiciones ε. */
+export declare function epsilonClosure(M: NFA, states: ReadonlySet<string>): Set<string>;
+export declare function nfaAccepts(M: NFA, input: string): boolean;
+/** Subset construction: cada estado del DFA = subconjunto cerrado por ε
+ *  de estados del NFA. Sólo se generan estados alcanzables. */
+export declare function nfaToDfa(M: NFA): DFA;
+//# sourceMappingURL=nfa.d.ts.map

package/dist/reasoning/automata/nfa.d.ts.map

@@ -0,0 +1 @@
+{"version":3,"file":"nfa.d.ts","sourceRoot":"","sources":["../../../src/reasoning/automata/nfa.ts"],"names":[],"mappings":"AASA,OAAO,KAAK,EAAE,GAAG,EAAE,GAAG,EAAU,MAAM,SAAS,CAAC;AAKhD,qEAAqE;AACrE,wBAAgB,cAAc,CAAC,CAAC,EAAE,GAAG,EAAE,MAAM,EAAE,WAAW,CAAC,MAAM,CAAC,GAAG,GAAG,CAAC,MAAM,CAAC,CAmB/E;AAgBD,wBAAgB,UAAU,CAAC,CAAC,EAAE,GAAG,EAAE,KAAK,EAAE,MAAM,GAAG,OAAO,CAQzD;AAED;+DAC+D;AAC/D,wBAAgB,QAAQ,CAAC,CAAC,EAAE,GAAG,GAAG,GAAG,CAkDpC"}

package/dist/reasoning/automata/nfa.js

@@ -0,0 +1,122 @@
+"use strict";
+// ============================================================
+// ST Automata — NFA + subset construction
+// ============================================================
+//
+//   · epsilonClosure(M, S)   — cierre-ε de un set de estados.
+//   · nfaAccepts(M, w)       — simulación BFS sobre el frontier.
+//   · nfaToDfa(M)            — subset construction.
+// ============================================================
+Object.defineProperty(exports, "__esModule", { value: true });
+exports.epsilonClosure = epsilonClosure;
+exports.nfaAccepts = nfaAccepts;
+exports.nfaToDfa = nfaToDfa;
+const types_1 = require("./types");
+const epsOf = (M) => M.epsilon ?? types_1.EPSILON;
+/** Cierre-ε: el menor conjunto T ⊇ S cerrado bajo transiciones ε. */
+function epsilonClosure(M, states) {
+    const eps = epsOf(M);
+    const closure = new Set(states);
+    const stack = [...states];
+    while (stack.length > 0) {
+        const s = stack.pop();
+        if (s === undefined)
+            break;
+        const row = M.transitions.get(s);
+        if (!row)
+            continue;
+        const nextSet = row.get(eps);
+        if (!nextSet)
+            continue;
+        for (const n of nextSet) {
+            if (!closure.has(n)) {
+                closure.add(n);
+                stack.push(n);
+            }
+        }
+    }
+    return closure;
+}
+/** Step de la simulación: a partir de un set de estados, consumir un
+ *  símbolo y luego cerrar bajo ε. */
+function nfaStep(M, states, sym) {
+    const out = new Set();
+    for (const s of states) {
+        const row = M.transitions.get(s);
+        if (!row)
+            continue;
+        const nextSet = row.get(sym);
+        if (!nextSet)
+            continue;
+        for (const n of nextSet)
+            out.add(n);
+    }
+    return epsilonClosure(M, out);
+}
+function nfaAccepts(M, input) {
+    let current = epsilonClosure(M, new Set([M.initial]));
+    for (const ch of input) {
+        current = nfaStep(M, current, ch);
+        if (current.size === 0)
+            return false;
+    }
+    for (const s of current)
+        if (M.accept.has(s))
+            return true;
+    return false;
+}
+/** Subset construction: cada estado del DFA = subconjunto cerrado por ε
+ *  de estados del NFA. Sólo se generan estados alcanzables. */
+function nfaToDfa(M) {
+    const eps = epsOf(M);
+    const encode = (set) => {
+        return '{' + [...set].sort().join(',') + '}';
+    };
+    // Alfabeto del DFA = alfabeto del NFA sin ε.
+    const alphabet = new Set();
+    for (const a of M.alphabet)
+        if (a !== eps)
+            alphabet.add(a);
+    const startSet = epsilonClosure(M, new Set([M.initial]));
+    const startKey = encode(startSet);
+    const states = new Set([startKey]);
+    const transitions = new Map();
+    const accept = new Set();
+    const subsetOf = new Map();
+    subsetOf.set(startKey, startSet);
+    if ([...startSet].some((s) => M.accept.has(s)))
+        accept.add(startKey);
+    const queue = [startKey];
+    while (queue.length > 0) {
+        const key = queue.shift();
+        if (key === undefined)
+            break;
+        const subset = subsetOf.get(key);
+        if (!subset)
+            continue;
+        const row = new Map();
+        transitions.set(key, row);
+        for (const a of alphabet) {
+            const next = nfaStep(M, subset, a);
+            if (next.size === 0)
+                continue;
+            const nextKey = encode(next);
+            row.set(a, nextKey);
+            if (!states.has(nextKey)) {
+                states.add(nextKey);
+                subsetOf.set(nextKey, next);
+                if ([...next].some((s) => M.accept.has(s)))
+                    accept.add(nextKey);
+                queue.push(nextKey);
+            }
+        }
+    }
+    return {
+        states,
+        alphabet,
+        transitions,
+        initial: startKey,
+        accept,
+    };
+}
+//# sourceMappingURL=nfa.js.map

package/dist/reasoning/automata/nfa.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"nfa.js","sourceRoot":"","sources":["../../../src/reasoning/automata/nfa.ts"],"names":[],"mappings":";AAAA,+DAA+D;AAC/D,0CAA0C;AAC1C,+DAA+D;AAC/D,EAAE;AACF,8DAA8D;AAC9D,iEAAiE;AACjE,oDAAoD;AACpD,+DAA+D;;AAQ/D,wCAmBC;AAgBD,gCAQC;AAID,4BAkDC;AAtGD,mCAAkC;AAElC,MAAM,KAAK,GAAG,CAAC,CAAM,EAAU,EAAE,CAAC,CAAC,CAAC,OAAO,IAAI,eAAO,CAAC;AAEvD,qEAAqE;AACrE,SAAgB,cAAc,CAAC,CAAM,EAAE,MAA2B;IAChE,MAAM,GAAG,GAAG,KAAK,CAAC,CAAC,CAAC,CAAC;IACrB,MAAM,OAAO,GAAG,IAAI,GAAG,CAAS,MAAM,CAAC,CAAC;IACxC,MAAM,KAAK,GAAa,CAAC,GAAG,MAAM,CAAC,CAAC;IACpC,OAAO,KAAK,CAAC,MAAM,GAAG,CAAC,EAAE,CAAC;QACxB,MAAM,CAAC,GAAG,KAAK,CAAC,GAAG,EAAE,CAAC;QACtB,IAAI,CAAC,KAAK,SAAS;YAAE,MAAM;QAC3B,MAAM,GAAG,GAAG,CAAC,CAAC,WAAW,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC;QACjC,IAAI,CAAC,GAAG;YAAE,SAAS;QACnB,MAAM,OAAO,GAAG,GAAG,CAAC,GAAG,CAAC,GAAG,CAAC,CAAC;QAC7B,IAAI,CAAC,OAAO;YAAE,SAAS;QACvB,KAAK,MAAM,CAAC,IAAI,OAAO,EAAE,CAAC;YACxB,IAAI,CAAC,OAAO,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,CAAC;gBACpB,OAAO,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC;gBACf,KAAK,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC;YAChB,CAAC;QACH,CAAC;IACH,CAAC;IACD,OAAO,OAAO,CAAC;AACjB,CAAC;AAED;qCACqC;AACrC,SAAS,OAAO,CAAC,CAAM,EAAE,MAA2B,EAAE,GAAW;IAC/D,MAAM,GAAG,GAAG,IAAI,GAAG,EAAU,CAAC;IAC9B,KAAK,MAAM,CAAC,IAAI,MAAM,EAAE,CAAC;QACvB,MAAM,GAAG,GAAG,CAAC,CAAC,WAAW,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC;QACjC,IAAI,CAAC,GAAG;YAAE,SAAS;QACnB,MAAM,OAAO,GAAG,GAAG,CAAC,GAAG,CAAC,GAAG,CAAC,CAAC;QAC7B,IAAI,CAAC,OAAO;YAAE,SAAS;QACvB,KAAK,MAAM,CAAC,IAAI,OAAO;YAAE,GAAG,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC;IACtC,CAAC;IACD,OAAO,cAAc,CAAC,CAAC,EAAE,GAAG,CAAC,CAAC;AAChC,CAAC;AAED,SAAgB,UAAU,CAAC,CAAM,EAAE,KAAa;IAC9C,IAAI,OAAO,GAAG,cAAc,CAAC,CAAC,EAAE,IAAI,GAAG,CAAC,CAAC,CAAC,CAAC,OAAO,CAAC,CAAC,CAAC,CAAC;IACtD,KAAK,MAAM,EAAE,IAAI,KAAK,EAAE,CAAC;QACvB,OAAO,GAAG,OAAO,CAAC,CAAC,EAAE,OAAO,EAAE,EAAE,CAAC,CAAC;QAClC,IAAI,OAAO,CAAC,IAAI,KAAK,CAAC;YAAE,OAAO,KAAK,CAAC;IACvC,CAAC;IACD,KAAK,MAAM,CAAC,IAAI,OAAO;QAAE,IAAI,CAAC,CAAC,MAAM,CAAC,GAAG,CAAC,CAAC,CAAC;YAAE,OAAO,IAAI,CAAC;IAC1D,OAAO,KAAK,CAAC;AACf,CAAC;AAED;+DAC+D;AAC/D,SAAgB,QAAQ,CAAC,CAAM;IAC7B,MAAM,GAAG,GAAG,KAAK,CAAC,CAAC,CAAC,CAAC;IAErB,MAAM,MAAM,GAAG,CAAC,GAAwB,EAAU,EAAE;QAClD,OAAO,GAAG,GAAG,CAAC,GAAG,GAAG,CAAC,CAAC,IAAI,EAAE,CAAC,IAAI,CAAC,GAAG,CAAC,GAAG,GAAG,CAAC;IAC/C,CAAC,CAAC;IAEF,6CAA6C;IAC7C,MAAM,QAAQ,GAAG,IAAI,GAAG,EAAU,CAAC;IACnC,KAAK,MAAM,CAAC,IAAI,CAAC,CAAC,QAAQ;QAAE,IAAI,CAAC,KAAK,GAAG;YAAE,QAAQ,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC;IAE3D,MAAM,QAAQ,GAAG,cAAc,CAAC,CAAC,EAAE,IAAI,GAAG,CAAC,CAAC,CAAC,CAAC,OAAO,CAAC,CAAC,CAAC,CAAC;IACzD,MAAM,QAAQ,GAAG,MAAM,CAAC,QAAQ,CAAC,CAAC;IAElC,MAAM,MAAM,GAAG,IAAI,GAAG,CAAS,CAAC,QAAQ,CAAC,CAAC,CAAC;IAC3C,MAAM,WAAW,GAAG,IAAI,GAAG,EAA+B,CAAC;IAC3D,MAAM,MAAM,GAAG,IAAI,GAAG,EAAU,CAAC;IACjC,MAAM,QAAQ,GAAG,IAAI,GAAG,EAAuB,CAAC;IAChD,QAAQ,CAAC,GAAG,CAAC,QAAQ,EAAE,QAAQ,CAAC,CAAC;IACjC,IAAI,CAAC,GAAG,QAAQ,CAAC,CAAC,IAAI,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,MAAM,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC;QAAE,MAAM,CAAC,GAAG,CAAC,QAAQ,CAAC,CAAC;IAErE,MAAM,KAAK,GAAa,CAAC,QAAQ,CAAC,CAAC;IACnC,OAAO,KAAK,CAAC,MAAM,GAAG,CAAC,EAAE,CAAC;QACxB,MAAM,GAAG,GAAG,KAAK,CAAC,KAAK,EAAE,CAAC;QAC1B,IAAI,GAAG,KAAK,SAAS;YAAE,MAAM;QAC7B,MAAM,MAAM,GAAG,QAAQ,CAAC,GAAG,CAAC,GAAG,CAAC,CAAC;QACjC,IAAI,CAAC,MAAM;YAAE,SAAS;QACtB,MAAM,GAAG,GAAG,IAAI,GAAG,EAAkB,CAAC;QACtC,WAAW,CAAC,GAAG,CAAC,GAAG,EAAE,GAAG,CAAC,CAAC;QAC1B,KAAK,MAAM,CAAC,IAAI,QAAQ,EAAE,CAAC;YACzB,MAAM,IAAI,GAAG,OAAO,CAAC,CAAC,EAAE,MAAM,EAAE,CAAC,CAAC,CAAC;YACnC,IAAI,IAAI,CAAC,IAAI,KAAK,CAAC;gBAAE,SAAS;YAC9B,MAAM,OAAO,GAAG,MAAM,CAAC,IAAI,CAAC,CAAC;YAC7B,GAAG,CAAC,GAAG,CAAC,CAAC,EAAE,OAAO,CAAC,CAAC;YACpB,IAAI,CAAC,MAAM,CAAC,GAAG,CAAC,OAAO,CAAC,EAAE,CAAC;gBACzB,MAAM,CAAC,GAAG,CAAC,OAAO,CAAC,CAAC;gBACpB,QAAQ,CAAC,GAAG,CAAC,OAAO,EAAE,IAAI,CAAC,CAAC;gBAC5B,IAAI,CAAC,GAAG,IAAI,CAAC,CAAC,IAAI,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,MAAM,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC;oBAAE,MAAM,CAAC,GAAG,CAAC,OAAO,CAAC,CAAC;gBAChE,KAAK,CAAC,IAAI,CAAC,OAAO,CAAC,CAAC;YACtB,CAAC;QACH,CAAC;IACH,CAAC;IAED,OAAO;QACL,MAAM;QACN,QAAQ;QACR,WAAW;QACX,OAAO,EAAE,QAAQ;QACjB,MAAM;KACP,CAAC;AACJ,CAAC"}

package/dist/reasoning/automata/pda.d.ts

@@ -0,0 +1,10 @@
+import type { PDA, Symbol } from './types';
+/** ¿`M` acepta `input`?
+ *  `maxSteps` cota el número de configuraciones expandidas. */
+export declare function pdaAccepts(M: PDA, input: string, maxSteps?: number): boolean;
+/** PDA que acepta palíndromes pares e impares sobre {a, b} usando un
+ *  marcador no determinista (transición ε al "espejo"). */
+export declare function pdaPalindromes(alphabet?: ReadonlyArray<Symbol>): PDA;
+/** PDA que acepta paréntesis balanceados (alfabeto '(' ')'). */
+export declare function pdaBalancedParens(): PDA;
+//# sourceMappingURL=pda.d.ts.map

package/dist/reasoning/automata/pda.d.ts.map

@@ -0,0 +1 @@
+{"version":3,"file":"pda.d.ts","sourceRoot":"","sources":["../../../src/reasoning/automata/pda.ts"],"names":[],"mappings":"AAWA,OAAO,KAAK,EAAE,GAAG,EAAiB,MAAM,EAAE,MAAM,SAAS,CAAC;AAW1D;+DAC+D;AAC/D,wBAAgB,UAAU,CAAC,CAAC,EAAE,GAAG,EAAE,KAAK,EAAE,MAAM,EAAE,QAAQ,SAAU,GAAG,OAAO,CAmD7E;AAID;2DAC2D;AAC3D,wBAAgB,cAAc,CAAC,QAAQ,GAAE,aAAa,CAAC,MAAM,CAAc,GAAG,GAAG,CAmEhF;AAED,gEAAgE;AAChE,wBAAgB,iBAAiB,IAAI,GAAG,CAsBvC"}

package/dist/reasoning/automata/pda.js

@@ -0,0 +1,169 @@
+"use strict";
+// ============================================================
+// ST Automata — PDA (Pushdown Automaton)
+// ============================================================
+//
+// Aceptación por estado final, con simulación no determinista.
+//
+// Una configuración es (state, posición de entrada, pila como string).
+// Se exploran con BFS pero con memoización de configuraciones vistas
+// para evitar bucles ε. Si la búsqueda explota, `maxDepth` corta.
+// ============================================================
+Object.defineProperty(exports, "__esModule", { value: true });
+exports.pdaAccepts = pdaAccepts;
+exports.pdaPalindromes = pdaPalindromes;
+exports.pdaBalancedParens = pdaBalancedParens;
+const types_1 = require("./types");
+const configKey = (c) => `${c.state}|${c.pos}|${c.stack}`;
+/** ¿`M` acepta `input`?
+ *  `maxSteps` cota el número de configuraciones expandidas. */
+function pdaAccepts(M, input, maxSteps = 100_000) {
+    const start = {
+        state: M.initial,
+        pos: 0,
+        stack: M.initialStack,
+    };
+    const queue = [start];
+    const seen = new Set([configKey(start)]);
+    let steps = 0;
+    while (queue.length > 0) {
+        if (steps++ > maxSteps)
+            return false;
+        const cfg = queue.shift();
+        if (!cfg)
+            break;
+        // Aceptación por estado final con input consumido.
+        if (cfg.pos === input.length && M.accept.has(cfg.state))
+            return true;
+        const top = cfg.stack.length > 0 ? cfg.stack[cfg.stack.length - 1] : undefined;
+        for (const t of M.transitions) {
+            if (t.state !== cfg.state)
+                continue;
+            // Symbol de entrada.
+            if (t.read !== types_1.EPSILON) {
+                if (cfg.pos >= input.length)
+                    continue;
+                if (input[cfg.pos] !== t.read)
+                    continue;
+            }
+            // Pop.
+            if (t.popTop !== types_1.EPSILON) {
+                if (top === undefined)
+                    continue;
+                if (top !== t.popTop)
+                    continue;
+            }
+            const newStack = t.popTop !== types_1.EPSILON ? cfg.stack.slice(0, -1) : cfg.stack;
+            // pushTop: el último elemento queda en la cima → simplemente
+            // concatenar la string en orden.
+            const pushed = t.pushTop.join('');
+            const finalStack = newStack + pushed;
+            const newPos = t.read !== types_1.EPSILON ? cfg.pos + 1 : cfg.pos;
+            const next = {
+                state: t.nextState,
+                pos: newPos,
+                stack: finalStack,
+            };
+            const key = configKey(next);
+            if (seen.has(key))
+                continue;
+            seen.add(key);
+            queue.push(next);
+        }
+    }
+    return false;
+}
+// ── Lenguajes estándar libres de contexto ────────────────────
+/** PDA que acepta palíndromes pares e impares sobre {a, b} usando un
+ *  marcador no determinista (transición ε al "espejo"). */
+function pdaPalindromes(alphabet = ['a', 'b']) {
+    const Z = '$';
+    // Estados:
+    //   q0: empujando la primera mitad.
+    //   q1: comparando contra la segunda mitad.
+    //   q2: accept.
+    const states = new Set(['q0', 'q1', 'q2']);
+    const stackAlphabet = new Set([Z, ...alphabet]);
+    const alpha = new Set(alphabet);
+    const transitions = [];
+    // q0 → q0, leer x, push x  (apilar)
+    for (const x of alphabet) {
+        transitions.push({
+            state: 'q0',
+            read: x,
+            popTop: types_1.EPSILON,
+            nextState: 'q0',
+            pushTop: [x],
+        });
+    }
+    // q0 → q1, ε, ε, []  (cambio al modo comparar, palíndrome par)
+    transitions.push({
+        state: 'q0',
+        read: types_1.EPSILON,
+        popTop: types_1.EPSILON,
+        nextState: 'q1',
+        pushTop: [],
+    });
+    // q0 → q1, leer x, ε, []  (skip carácter central, palíndrome impar)
+    for (const x of alphabet) {
+        transitions.push({
+            state: 'q0',
+            read: x,
+            popTop: types_1.EPSILON,
+            nextState: 'q1',
+            pushTop: [],
+        });
+    }
+    // q1 → q1, leer x, pop x, []  (matchear segunda mitad)
+    for (const x of alphabet) {
+        transitions.push({
+            state: 'q1',
+            read: x,
+            popTop: x,
+            nextState: 'q1',
+            pushTop: [],
+        });
+    }
+    // q1 → q2, ε, pop Z, [Z]  (stack vuelve a $)
+    transitions.push({
+        state: 'q1',
+        read: types_1.EPSILON,
+        popTop: Z,
+        nextState: 'q2',
+        pushTop: [Z],
+    });
+    return {
+        states,
+        alphabet: alpha,
+        stackAlphabet,
+        transitions,
+        initial: 'q0',
+        initialStack: Z,
+        accept: new Set(['q2']),
+    };
+}
+/** PDA que acepta paréntesis balanceados (alfabeto '(' ')'). */
+function pdaBalancedParens() {
+    const Z = '$';
+    const states = new Set(['q0', 'q1']);
+    const alpha = new Set(['(', ')']);
+    const stackAlphabet = new Set([Z, '(']);
+    const transitions = [
+        // Abrir paréntesis: push '('.
+        { state: 'q0', read: '(', popTop: types_1.EPSILON, nextState: 'q0', pushTop: ['('] },
+        // Cerrar paréntesis: pop '('.
+        { state: 'q0', read: ')', popTop: '(', nextState: 'q0', pushTop: [] },
+        // Aceptar al ver $ en la cima (todo balanceado) — sin tocar pila.
+        { state: 'q0', read: types_1.EPSILON, popTop: Z, nextState: 'q1', pushTop: [Z] },
+    ];
+    return {
+        states,
+        alphabet: alpha,
+        stackAlphabet,
+        transitions,
+        initial: 'q0',
+        initialStack: Z,
+        accept: new Set(['q1']),
+    };
+}
+//# sourceMappingURL=pda.js.map

package/dist/reasoning/automata/pda.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"pda.js","sourceRoot":"","sources":["../../../src/reasoning/automata/pda.ts"],"names":[],"mappings":";AAAA,+DAA+D;AAC/D,yCAAyC;AACzC,+DAA+D;AAC/D,EAAE;AACF,+DAA+D;AAC/D,EAAE;AACF,uEAAuE;AACvE,qEAAqE;AACrE,kEAAkE;AAClE,+DAA+D;;AAe/D,gCAmDC;AAMD,wCAmEC;AAGD,8CAsBC;AAjKD,mCAAkC;AAQlC,MAAM,SAAS,GAAG,CAAC,CAAS,EAAU,EAAE,CAAC,GAAG,CAAC,CAAC,KAAK,IAAI,CAAC,CAAC,GAAG,IAAI,CAAC,CAAC,KAAK,EAAE,CAAC;AAE1E;+DAC+D;AAC/D,SAAgB,UAAU,CAAC,CAAM,EAAE,KAAa,EAAE,QAAQ,GAAG,OAAO;IAClE,MAAM,KAAK,GAAW;QACpB,KAAK,EAAE,CAAC,CAAC,OAAO;QAChB,GAAG,EAAE,CAAC;QACN,KAAK,EAAE,CAAC,CAAC,YAAY;KACtB,CAAC;IACF,MAAM,KAAK,GAAa,CAAC,KAAK,CAAC,CAAC;IAChC,MAAM,IAAI,GAAG,IAAI,GAAG,CAAS,CAAC,SAAS,CAAC,KAAK,CAAC,CAAC,CAAC,CAAC;IACjD,IAAI,KAAK,GAAG,CAAC,CAAC;IAEd,OAAO,KAAK,CAAC,MAAM,GAAG,CAAC,EAAE,CAAC;QACxB,IAAI,KAAK,EAAE,GAAG,QAAQ;YAAE,OAAO,KAAK,CAAC;QACrC,MAAM,GAAG,GAAG,KAAK,CAAC,KAAK,EAAE,CAAC;QAC1B,IAAI,CAAC,GAAG;YAAE,MAAM;QAEhB,mDAAmD;QACnD,IAAI,GAAG,CAAC,GAAG,KAAK,KAAK,CAAC,MAAM,IAAI,CAAC,CAAC,MAAM,CAAC,GAAG,CAAC,GAAG,CAAC,KAAK,CAAC;YAAE,OAAO,IAAI,CAAC;QAErE,MAAM,GAAG,GAAG,GAAG,CAAC,KAAK,CAAC,MAAM,GAAG,CAAC,CAAC,CAAC,CAAC,GAAG,CAAC,KAAK,CAAC,GAAG,CAAC,KAAK,CAAC,MAAM,GAAG,CAAC,CAAC,CAAC,CAAC,CAAC,SAAS,CAAC;QAE/E,KAAK,MAAM,CAAC,IAAI,CAAC,CAAC,WAAW,EAAE,CAAC;YAC9B,IAAI,CAAC,CAAC,KAAK,KAAK,GAAG,CAAC,KAAK;gBAAE,SAAS;YACpC,qBAAqB;YACrB,IAAI,CAAC,CAAC,IAAI,KAAK,eAAO,EAAE,CAAC;gBACvB,IAAI,GAAG,CAAC,GAAG,IAAI,KAAK,CAAC,MAAM;oBAAE,SAAS;gBACtC,IAAI,KAAK,CAAC,GAAG,CAAC,GAAG,CAAC,KAAK,CAAC,CAAC,IAAI;oBAAE,SAAS;YAC1C,CAAC;YACD,OAAO;YACP,IAAI,CAAC,CAAC,MAAM,KAAK,eAAO,EAAE,CAAC;gBACzB,IAAI,GAAG,KAAK,SAAS;oBAAE,SAAS;gBAChC,IAAI,GAAG,KAAK,CAAC,CAAC,MAAM;oBAAE,SAAS;YACjC,CAAC;YAED,MAAM,QAAQ,GAAG,CAAC,CAAC,MAAM,KAAK,eAAO,CAAC,CAAC,CAAC,GAAG,CAAC,KAAK,CAAC,KAAK,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,GAAG,CAAC,KAAK,CAAC;YAC3E,6DAA6D;YAC7D,iCAAiC;YACjC,MAAM,MAAM,GAAG,CAAC,CAAC,OAAO,CAAC,IAAI,CAAC,EAAE,CAAC,CAAC;YAClC,MAAM,UAAU,GAAG,QAAQ,GAAG,MAAM,CAAC;YACrC,MAAM,MAAM,GAAG,CAAC,CAAC,IAAI,KAAK,eAAO,CAAC,CAAC,CAAC,GAAG,CAAC,GAAG,GAAG,CAAC,CAAC,CAAC,CAAC,GAAG,CAAC,GAAG,CAAC;YAC1D,MAAM,IAAI,GAAW;gBACnB,KAAK,EAAE,CAAC,CAAC,SAAS;gBAClB,GAAG,EAAE,MAAM;gBACX,KAAK,EAAE,UAAU;aAClB,CAAC;YACF,MAAM,GAAG,GAAG,SAAS,CAAC,IAAI,CAAC,CAAC;YAC5B,IAAI,IAAI,CAAC,GAAG,CAAC,GAAG,CAAC;gBAAE,SAAS;YAC5B,IAAI,CAAC,GAAG,CAAC,GAAG,CAAC,CAAC;YACd,KAAK,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC;QACnB,CAAC;IACH,CAAC;IACD,OAAO,KAAK,CAAC;AACf,CAAC;AAED,gEAAgE;AAEhE;2DAC2D;AAC3D,SAAgB,cAAc,CAAC,WAAkC,CAAC,GAAG,EAAE,GAAG,CAAC;IACzE,MAAM,CAAC,GAAG,GAAG,CAAC;IACd,WAAW;IACX,oCAAoC;IACpC,4CAA4C;IAC5C,gBAAgB;IAChB,MAAM,MAAM,GAAG,IAAI,GAAG,CAAS,CAAC,IAAI,EAAE,IAAI,EAAE,IAAI,CAAC,CAAC,CAAC;IACnD,MAAM,aAAa,GAAG,IAAI,GAAG,CAAS,CAAC,CAAC,EAAE,GAAG,QAAQ,CAAC,CAAC,CAAC;IACxD,MAAM,KAAK,GAAG,IAAI,GAAG,CAAS,QAAQ,CAAC,CAAC;IACxC,MAAM,WAAW,GAAoB,EAAE,CAAC;IAExC,oCAAoC;IACpC,KAAK,MAAM,CAAC,IAAI,QAAQ,EAAE,CAAC;QACzB,WAAW,CAAC,IAAI,CAAC;YACf,KAAK,EAAE,IAAI;YACX,IAAI,EAAE,CAAC;YACP,MAAM,EAAE,eAAO;YACf,SAAS,EAAE,IAAI;YACf,OAAO,EAAE,CAAC,CAAC,CAAC;SACb,CAAC,CAAC;IACL,CAAC;IACD,+DAA+D;IAC/D,WAAW,CAAC,IAAI,CAAC;QACf,KAAK,EAAE,IAAI;QACX,IAAI,EAAE,eAAO;QACb,MAAM,EAAE,eAAO;QACf,SAAS,EAAE,IAAI;QACf,OAAO,EAAE,EAAE;KACZ,CAAC,CAAC;IACH,oEAAoE;IACpE,KAAK,MAAM,CAAC,IAAI,QAAQ,EAAE,CAAC;QACzB,WAAW,CAAC,IAAI,CAAC;YACf,KAAK,EAAE,IAAI;YACX,IAAI,EAAE,CAAC;YACP,MAAM,EAAE,eAAO;YACf,SAAS,EAAE,IAAI;YACf,OAAO,EAAE,EAAE;SACZ,CAAC,CAAC;IACL,CAAC;IACD,uDAAuD;IACvD,KAAK,MAAM,CAAC,IAAI,QAAQ,EAAE,CAAC;QACzB,WAAW,CAAC,IAAI,CAAC;YACf,KAAK,EAAE,IAAI;YACX,IAAI,EAAE,CAAC;YACP,MAAM,EAAE,CAAC;YACT,SAAS,EAAE,IAAI;YACf,OAAO,EAAE,EAAE;SACZ,CAAC,CAAC;IACL,CAAC;IACD,6CAA6C;IAC7C,WAAW,CAAC,IAAI,CAAC;QACf,KAAK,EAAE,IAAI;QACX,IAAI,EAAE,eAAO;QACb,MAAM,EAAE,CAAC;QACT,SAAS,EAAE,IAAI;QACf,OAAO,EAAE,CAAC,CAAC,CAAC;KACb,CAAC,CAAC;IAEH,OAAO;QACL,MAAM;QACN,QAAQ,EAAE,KAAK;QACf,aAAa;QACb,WAAW;QACX,OAAO,EAAE,IAAI;QACb,YAAY,EAAE,CAAC;QACf,MAAM,EAAE,IAAI,GAAG,CAAC,CAAC,IAAI,CAAC,CAAC;KACxB,CAAC;AACJ,CAAC;AAED,gEAAgE;AAChE,SAAgB,iBAAiB;IAC/B,MAAM,CAAC,GAAG,GAAG,CAAC;IACd,MAAM,MAAM,GAAG,IAAI,GAAG,CAAS,CAAC,IAAI,EAAE,IAAI,CAAC,CAAC,CAAC;IAC7C,MAAM,KAAK,GAAG,IAAI,GAAG,CAAS,CAAC,GAAG,EAAE,GAAG,CAAC,CAAC,CAAC;IAC1C,MAAM,aAAa,GAAG,IAAI,GAAG,CAAS,CAAC,CAAC,EAAE,GAAG,CAAC,CAAC,CAAC;IAChD,MAAM,WAAW,GAAuB;QACtC,8BAA8B;QAC9B,EAAE,KAAK,EAAE,IAAI,EAAE,IAAI,EAAE,GAAG,EAAE,MAAM,EAAE,eAAO,EAAE,SAAS,EAAE,IAAI,EAAE,OAAO,EAAE,CAAC,GAAG,CAAC,EAAE;QAC5E,8BAA8B;QAC9B,EAAE,KAAK,EAAE,IAAI,EAAE,IAAI,EAAE,GAAG,EAAE,MAAM,EAAE,GAAG,EAAE,SAAS,EAAE,IAAI,EAAE,OAAO,EAAE,EAAE,EAAE;QACrE,kEAAkE;QAClE,EAAE,KAAK,EAAE,IAAI,EAAE,IAAI,EAAE,eAAO,EAAE,MAAM,EAAE,CAAC,EAAE,SAAS,EAAE,IAAI,EAAE,OAAO,EAAE,CAAC,CAAC,CAAC,EAAE;KACzE,CAAC;IACF,OAAO;QACL,MAAM;QACN,QAAQ,EAAE,KAAK;QACf,aAAa;QACb,WAAW;QACX,OAAO,EAAE,IAAI;QACb,YAAY,EAAE,CAAC;QACf,MAAM,EAAE,IAAI,GAAG,CAAC,CAAC,IAAI,CAAC,CAAC;KACxB,CAAC;AACJ,CAAC"}

package/dist/reasoning/automata/regex.d.ts

@@ -0,0 +1,6 @@
+import type { NFA, Regex } from './types';
+export declare function parseRegex(s: string): Regex;
+export declare function regexToNfa(r: Regex): NFA;
+/** Atajo: ¿la expresión regular `r` matchea exactamente `s`? */
+export declare function regexMatches(r: Regex, s: string): boolean;
+//# sourceMappingURL=regex.d.ts.map

package/dist/reasoning/automata/regex.d.ts.map

@@ -0,0 +1 @@
+{"version":3,"file":"regex.d.ts","sourceRoot":"","sources":["../../../src/reasoning/automata/regex.ts"],"names":[],"mappings":"AAkBA,OAAO,KAAK,EAAE,GAAG,EAAE,KAAK,EAAU,MAAM,SAAS,CAAC;AA+FlD,wBAAgB,UAAU,CAAC,CAAC,EAAE,MAAM,GAAG,KAAK,CAO3C;AAoHD,wBAAgB,UAAU,CAAC,CAAC,EAAE,KAAK,GAAG,GAAG,CAwCxC;AAED,gEAAgE;AAChE,wBAAgB,YAAY,CAAC,CAAC,EAAE,KAAK,EAAE,CAAC,EAAE,MAAM,GAAG,OAAO,CAGzD"}