lxa
Version:
A lexical analysis / regular expression engine written in TypeScript
25 lines (24 loc) • 894 B
JavaScript
;
function __export(m) {
for (var p in m) if (!exports.hasOwnProperty(p)) exports[p] = m[p];
}
var __importStar = (this && this.__importStar) || function (mod) {
if (mod && mod.__esModule) return mod;
var result = {};
if (mod != null) for (var k in mod) if (Object.hasOwnProperty.call(mod, k)) result[k] = mod[k];
result["default"] = mod;
return result;
};
Object.defineProperty(exports, "__esModule", { value: true });
var stateOps = __importStar(require("./fas/stateOps"));
exports.stateOps = stateOps;
__export(require("./fas/combineStateOps"));
var state_1 = require("./fas/state");
exports.State = state_1.State;
var epsilon_1 = require("./fas/epsilon");
exports.epsilon = epsilon_1.default;
var nfa_1 = require("./fas/nfa");
exports.NFA = nfa_1.NFA;
var dfa_1 = require("./fas/dfa");
exports.DFA = dfa_1.DFA;
exports.DFAStatesSet = dfa_1.DFAStatesSet;