grammar-composer 0.1.0

package/dist/Grammar.js

@@ -0,0 +1,376 @@
+import { buildRegExp, inputStart, isPatternOptional } from 'regexp-composer';
+import { isArray, isBoolean, isFunction, isString } from "./utilities/Utilities.js";
+/////////////////////////////////////////////////////////////////////////////////////////////////
+// Grammar builder functions:
+/////////////////////////////////////////////////////////////////////////////////////////////////
+export function buildGrammar(obj, startProductionName) {
+    if (isFunction(obj)) {
+        obj = new obj();
+    }
+    const nameLookup = new Map();
+    const nonterminalLookup = new Map();
+    const optionalNonterminalLookup = new Map();
+    for (const key in obj) {
+        const objectProperty = obj[key];
+        nameLookup.set(objectProperty, key);
+        if (!isFunction(objectProperty)) {
+            continue;
+        }
+        const productionContent = objectProperty();
+        const normalizedProduction = productionToGrammarElement(productionContent);
+        const newNonterminal = nonterminal(key, normalizedProduction);
+        const newOptionalNonterminal = { ...newNonterminal, optional: true };
+        nonterminalLookup.set(objectProperty, newNonterminal);
+        optionalNonterminalLookup.set(objectProperty, newOptionalNonterminal);
+    }
+    let uniqueIdCounter = 0;
+    const uniqueIdSource = () => uniqueIdCounter++;
+    for (const [func, nonterminal] of nonterminalLookup) {
+        const preparedContent = prepareGrammarElement(nonterminal.content, nameLookup, nonterminalLookup, optionalNonterminalLookup, uniqueIdSource);
+        nonterminal.content = preparedContent;
+        const optionalNonterminal = optionalNonterminalLookup.get(func);
+        optionalNonterminal.content = preparedContent;
+    }
+    let startNonterminal = nonterminalLookup.get(obj[startProductionName]);
+    if (!startNonterminal) {
+        throw new Error(`Couldn't find a start production named '${startProductionName}'.`);
+    }
+    detectAndAnnotateOptionalNodes(startNonterminal);
+    detectAndErrorOnLeftRecursion(startNonterminal);
+    const nonterminals = {};
+    for (const [key, nonterminal] of nonterminalLookup) {
+        nonterminals[nameLookup.get(key)] = nonterminal;
+    }
+    return {
+        rootElement: nonterminals[startProductionName],
+        productions: nonterminals,
+        maxElementId: uniqueIdCounter
+    };
+}
+function prepareGrammarElement(rootElement, nameLookup, nonterminalLookup, optionalNonterminalLookup, getUniqueId) {
+    function prepare(element) {
+        switch (element.type) {
+            case 'StringTerminal':
+            case 'Nonterminal': {
+                if (element.uniqueId === undefined) {
+                    element.uniqueId = getUniqueId();
+                }
+                return element;
+            }
+            case 'PatternTerminal': {
+                return {
+                    ...element,
+                    name: nameLookup.get(element) ?? '',
+                    uniqueId: getUniqueId()
+                };
+            }
+            case 'Repetition': {
+                return {
+                    ...element,
+                    content: prepare(element.content),
+                    uniqueId: getUniqueId()
+                };
+            }
+            case 'Sequence':
+            case 'Choice': {
+                return {
+                    ...element,
+                    members: element.members.map(element => prepare(element)),
+                    uniqueId: getUniqueId()
+                };
+            }
+            case 'NonterminalReference': {
+                const reference = element.reference;
+                let nonterminal;
+                if (element.optional) {
+                    nonterminal = optionalNonterminalLookup.get(reference);
+                }
+                else {
+                    nonterminal = nonterminalLookup.get(reference);
+                }
+                if (!nonterminal) {
+                    throw new Error(`Couldn't resolve function reference in grammar element: ${JSON.stringify(element)}`);
+                }
+                if (nonterminal.uniqueId === undefined) {
+                    nonterminal.uniqueId = getUniqueId();
+                }
+                return nonterminal;
+            }
+        }
+    }
+    return prepare(rootElement);
+}
+function detectAndAnnotateOptionalNodes(rootNode) {
+    const visitedNodes = new Set();
+    const resolvedNodes = new Map();
+    const unresolvedNodes = new Map();
+    function processDepthFirst(node) {
+        if (visitedNodes.has(node)) {
+            return resolvedNodes.get(node);
+        }
+        visitedNodes.add(node);
+        switch (node.type) {
+            case 'StringTerminal':
+            case 'PatternTerminal': {
+                resolvedNodes.set(node, node.optional);
+                return node.optional;
+            }
+            case 'Nonterminal':
+            case 'Repetition': {
+                const result = processDepthFirst(node.content);
+                if (node.optional) {
+                    resolvedNodes.set(node, true);
+                    return true;
+                }
+                else if (isBoolean(result)) {
+                    resolvedNodes.set(node, result);
+                    return result;
+                }
+                else {
+                    unresolvedNodes.set(node, new Set([node.content]));
+                    return undefined;
+                }
+            }
+            case 'Sequence':
+            case 'Choice': {
+                const dependencies = new Set();
+                let allResolvedElementsAreOptional = true;
+                for (const element of node.members) {
+                    const result = processDepthFirst(element);
+                    if (isBoolean(result)) {
+                        if (result == false) {
+                            allResolvedElementsAreOptional = false;
+                        }
+                    }
+                    else {
+                        dependencies.add(element);
+                    }
+                }
+                if (node.optional == true) {
+                    resolvedNodes.set(node, true);
+                    return true;
+                }
+                else if (dependencies.size == 0 || !allResolvedElementsAreOptional) {
+                    resolvedNodes.set(node, allResolvedElementsAreOptional);
+                    return allResolvedElementsAreOptional;
+                }
+                else {
+                    unresolvedNodes.set(node, dependencies);
+                    return undefined;
+                }
+            }
+        }
+        return undefined;
+    }
+    // Process depth first to resolve the easy cases, for productions that contain
+    // no cyclic references:
+    processDepthFirst(rootNode);
+    // Now the remainder consists of nodes containing cyclic references that have not yet been resolved.
+    // Use a form of iterative elimination and substitution to resolve them:
+    while (unresolvedNodes.size > 0) {
+        // This variable tracks whether at least one dependency was resolved, in any node.
+        // If it stays false, it means that no improvement was made during the iteration,
+        // and we should exit the loop.
+        let atLastOneDependencyResolvedInAnyNode = false;
+        // Scan the unresolved nodes to locate any new resolved dependencies
+        for (const [node, dependencies] of unresolvedNodes) {
+            let nonOptionalDependencyFound = false;
+            // Iterate over all unresolved dependencies for the node
+            for (const dependency of dependencies) {
+                // Check if the dependency has been resolved
+                const value = resolvedNodes.get(dependency);
+                if (value !== undefined) {
+                    // If it did, record that some dependencies were resolved
+                    atLastOneDependencyResolvedInAnyNode = true;
+                    if (value === false) {
+                        // If the value was false, then the entire target node must not be optional
+                        nonOptionalDependencyFound = true;
+                        break;
+                    }
+                    else {
+                        // If the result was true, remove the dependency from the set
+                        dependencies.delete(dependency);
+                    }
+                }
+            }
+            // If either a non-optional dependency was found, or all dependencies were resolved,
+            // resolve the target node:
+            if (nonOptionalDependencyFound || dependencies.size === 0) {
+                const isOptional = !nonOptionalDependencyFound;
+                resolvedNodes.set(node, isOptional);
+                unresolvedNodes.delete(node);
+            }
+        }
+        // If not even one dependency was eliminated for any node,
+        // it means that only mutually cyclic nodes are left unresolved, so exit the loop.
+        if (!atLastOneDependencyResolvedInAnyNode) {
+            break;
+        }
+    }
+    // All remaining unresolved nodes must now be optional,
+    // since they are all mutually cyclic and all their non-cyclic grammar elements are known to be optional.
+    for (const node of unresolvedNodes.keys()) {
+        resolvedNodes.set(node, true);
+        unresolvedNodes.delete(node);
+    }
+    // Finally set the 'optional' property of all nodes based on the detected values.
+    for (const [node, isOptional] of resolvedNodes) {
+        node.optional = isOptional;
+    }
+}
+export function detectAndErrorOnLeftRecursion(rootNode) {
+    const currentlyIteratedNodes = new Set();
+    function detect(node) {
+        if (currentlyIteratedNodes.has(node)) {
+            if (node.type === 'Nonterminal') {
+                throw new Error(`Detected left recursion for nonterminal '${node.name}'.`);
+            }
+            else {
+                throw new Error(`Detected left recursion for node: ${JSON.stringify(node, undefined, 4)}`);
+            }
+        }
+        currentlyIteratedNodes.add(node);
+        switch (node.type) {
+            case 'Nonterminal':
+            case 'Repetition': {
+                detect(node.content);
+                break;
+            }
+            case 'Sequence': {
+                for (const member of node.members) {
+                    detect(member);
+                    if (!member.optional) {
+                        break;
+                    }
+                }
+                break;
+            }
+            case 'Choice': {
+                for (const member of node.members) {
+                    detect(member);
+                }
+                break;
+            }
+        }
+        currentlyIteratedNodes.delete(node);
+    }
+    detect(rootNode);
+}
+/////////////////////////////////////////////////////////////////////////////////////////////////
+// Builder interface functions:
+/////////////////////////////////////////////////////////////////////////////////////////////////
+export function oneOrMore(content) {
+    return {
+        type: 'Repetition',
+        content: productionToGrammarElement(content),
+        optional: false
+    };
+}
+export function zeroOrMore(content) {
+    return {
+        type: 'Repetition',
+        content: productionToGrammarElement(content),
+        optional: true
+    };
+}
+export function anyOf(...members) {
+    if (members.length == 0) {
+        throw new Error(`'anyOf' requires at least one member.`);
+    }
+    const normalizedMembers = members.map(member => productionToGrammarElement(member));
+    return {
+        type: 'Choice',
+        members: normalizedMembers,
+        optional: false,
+        exhaustive: false
+    };
+}
+export function bestOf(...members) {
+    if (members.length == 0) {
+        throw new Error(`'bestOf' requires at least one member.`);
+    }
+    const normalizedMembers = members.map(member => productionToGrammarElement(member));
+    return {
+        type: 'Choice',
+        members: normalizedMembers,
+        optional: false,
+        exhaustive: true
+    };
+}
+export function possibly(content) {
+    return { ...productionToGrammarElement(content), optional: true };
+}
+export function cached(content) {
+    return { ...productionToGrammarElement(content), cached: true };
+}
+export function uncached(content) {
+    return { ...productionToGrammarElement(content), cached: false };
+}
+export function pattern(pattern) {
+    if (isArray(pattern)) {
+        pattern = [inputStart, ...pattern];
+    }
+    else {
+        pattern = [inputStart, pattern];
+    }
+    const regExp = buildRegExp(pattern);
+    const optional = isPatternOptional(pattern);
+    return {
+        type: 'PatternTerminal',
+        name: '[Pattern]',
+        pattern,
+        regExp,
+        optional,
+    };
+}
+function stringTerminal(content) {
+    if (content.length < 1) {
+        throw new Error(`A string terminal must have a length of at least 1 character`);
+    }
+    return {
+        type: 'StringTerminal',
+        content,
+        optional: false
+    };
+}
+function nonterminal(name, content) {
+    if (name.length < 1) {
+        throw new Error(`A nonterminal name must include at least 1 character.`);
+    }
+    return {
+        type: 'Nonterminal',
+        name,
+        content,
+        optional: false,
+    };
+}
+function sequence(members) {
+    return {
+        type: 'Sequence',
+        members,
+        optional: false
+    };
+}
+function unresolvedReference(reference) {
+    return {
+        type: 'NonterminalReference',
+        reference,
+        optional: false
+    };
+}
+function productionToGrammarElement(production) {
+    if (isString(production)) {
+        return stringTerminal(production);
+    }
+    else if (isArray(production)) {
+        const normalizedMembers = production.map(element => productionToGrammarElement(element));
+        return sequence(normalizedMembers);
+    }
+    else if (isFunction(production)) {
+        return unresolvedReference(production);
+    }
+    else {
+        return production;
+    }
+}
+//# sourceMappingURL=Grammar.js.map

package/dist/Grammar.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"Grammar.js","sourceRoot":"","sources":["../src/Grammar.ts"],"names":[],"mappings":"AAAA,OAAO,EAAW,WAAW,EAAE,UAAU,EAAE,iBAAiB,EAAE,MAAM,iBAAiB,CAAA;AACrF,OAAO,EAAE,OAAO,EAAE,SAAS,EAAE,UAAU,EAAE,QAAQ,EAAE,MAAM,0BAA0B,CAAA;AAEnF,iGAAiG;AACjG,6BAA6B;AAC7B,iGAAiG;AACjG,MAAM,UAAU,YAAY,CAAmC,GAAsB,EAAE,mBAA4B;IAClH,IAAI,UAAU,CAAC,GAAG,CAAC,EAAE,CAAC;QACrB,GAAG,GAAG,IAAI,GAAG,EAAE,CAAA;IAChB,CAAC;IAED,MAAM,UAAU,GAAG,IAAI,GAAG,EAAgB,CAAA;IAC1C,MAAM,iBAAiB,GAAG,IAAI,GAAG,EAAyB,CAAA;IAC1D,MAAM,yBAAyB,GAAG,IAAI,GAAG,EAAyB,CAAA;IAElE,KAAK,MAAM,GAAG,IAAI,GAAG,EAAE,CAAC;QACvB,MAAM,cAAc,GAAG,GAAG,CAAC,GAAG,CAAC,CAAA;QAE/B,UAAU,CAAC,GAAG,CAAC,cAAc,EAAE,GAAG,CAAC,CAAA;QAEnC,IAAI,CAAC,UAAU,CAAC,cAAc,CAAC,EAAE,CAAC;YACjC,SAAQ;QACT,CAAC;QAED,MAAM,iBAAiB,GAAG,cAAc,EAAE,CAAA;QAC1C,MAAM,oBAAoB,GAAG,0BAA0B,CAAC,iBAAiB,CAAC,CAAA;QAE1E,MAAM,cAAc,GAAG,WAAW,CAAC,GAAG,EAAE,oBAAoB,CAAC,CAAA;QAC7D,MAAM,sBAAsB,GAAG,EAAE,GAAG,cAAc,EAAE,QAAQ,EAAE,IAAI,EAAE,CAAA;QAEpE,iBAAiB,CAAC,GAAG,CAAC,cAAc,EAAE,cAAc,CAAC,CAAA;QACrD,yBAAyB,CAAC,GAAG,CAAC,cAAc,EAAE,sBAAsB,CAAC,CAAA;IACtE,CAAC;IAED,IAAI,eAAe,GAAG,CAAC,CAAA;IACvB,MAAM,cAAc,GAAG,GAAG,EAAE,CAAC,eAAe,EAAE,CAAA;IAE9C,KAAK,MAAM,CAAC,IAAI,EAAE,WAAW,CAAC,IAAI,iBAAiB,EAAE,CAAC;QACrD,MAAM,eAAe,GAAG,qBAAqB,CAAC,WAAW,CAAC,OAAO,EAAE,UAA8B,EAAE,iBAAiB,EAAE,yBAAyB,EAAE,cAAc,CAAC,CAAA;QAEhK,WAAW,CAAC,OAAO,GAAG,eAAe,CAAA;QAErC,MAAM,mBAAmB,GAAG,yBAAyB,CAAC,GAAG,CAAC,IAAI,CAAE,CAAA;QAChE,mBAAmB,CAAC,OAAO,GAAG,eAAe,CAAA;IAC9C,CAAC;IAED,IAAI,gBAAgB,GAAG,iBAAiB,CAAC,GAAG,CAAC,GAAG,CAAC,mBAAmB,CAAa,CAAC,CAAA;IAElF,IAAI,CAAC,gBAAgB,EAAE,CAAC;QACvB,MAAM,IAAI,KAAK,CAAC,2CAA2C,mBAA6B,IAAI,CAAC,CAAA;IAC9F,CAAC;IAED,8BAA8B,CAAC,gBAAgB,CAAC,CAAA;IAChD,6BAA6B,CAAC,gBAAgB,CAAC,CAAA;IAE/C,MAAM,YAAY,GAAsC,EAAS,CAAA;IAEjE,KAAK,MAAM,CAAC,GAAG,EAAE,WAAW,CAAC,IAAI,iBAAiB,EAAE,CAAC;QACpD,YAAY,CAAC,UAAU,CAAC,GAAG,CAAC,GAAG,CAAE,CAAC,GAAG,WAAW,CAAA;IACjD,CAAC;IAED,OAAO;QACN,WAAW,EAAE,YAAY,CAAC,mBAAmB,CAAC;QAC9C,WAAW,EAAE,YAAY;QACzB,YAAY,EAAE,eAAe;KACf,CAAA;AAChB,CAAC;AAED,SAAS,qBAAqB,CAC7B,WAA2B,EAC3B,UAA4B,EAC5B,iBAA6C,EAC7C,yBAAqD,EACrD,WAAyB;IAGzB,SAAS,OAAO,CAAC,OAAuB;QACvC,QAAQ,OAAO,CAAC,IAAI,EAAE,CAAC;YACtB,KAAK,gBAAgB,CAAC;YACtB,KAAK,aAAa,CAAC,CAAC,CAAC;gBACpB,IAAI,OAAO,CAAC,QAAQ,KAAK,SAAS,EAAE,CAAC;oBACpC,OAAO,CAAC,QAAQ,GAAG,WAAW,EAAE,CAAA;gBACjC,CAAC;gBAED,OAAO,OAAO,CAAA;YACf,CAAC;YAED,KAAK,iBAAiB,CAAC,CAAC,CAAC;gBACxB,OAAO;oBACN,GAAG,OAAO;oBACV,IAAI,EAAE,UAAU,CAAC,GAAG,CAAC,OAAO,CAAC,IAAI,EAAE;oBACnC,QAAQ,EAAE,WAAW,EAAE;iBACvB,CAAA;YACF,CAAC;YAED,KAAK,YAAY,CAAC,CAAC,CAAC;gBACnB,OAAO;oBACN,GAAG,OAAO;oBACV,OAAO,EAAE,OAAO,CAAC,OAAO,CAAC,OAAO,CAAC;oBACjC,QAAQ,EAAE,WAAW,EAAE;iBACvB,CAAA;YACF,CAAC;YAED,KAAK,UAAU,CAAC;YAChB,KAAK,QAAQ,CAAC,CAAC,CAAC;gBACf,OAAO;oBACN,GAAG,OAAO;oBACV,OAAO,EAAE,OAAO,CAAC,OAAO,CAAC,GAAG,CAAC,OAAO,CAAC,EAAE,CAAC,OAAO,CAAC,OAAO,CAAC,CAAC;oBACzD,QAAQ,EAAE,WAAW,EAAE;iBACvB,CAAA;YACF,CAAC;YAED,KAAK,sBAAsB,CAAC,CAAC,CAAC;gBAC7B,MAAM,SAAS,GAAG,OAAO,CAAC,SAAS,CAAA;gBAEnC,IAAI,WAAoC,CAAA;gBAExC,IAAI,OAAO,CAAC,QAAQ,EAAE,CAAC;oBACtB,WAAW,GAAG,yBAAyB,CAAC,GAAG,CAAC,SAAS,CAAC,CAAA;gBACvD,CAAC;qBAAM,CAAC;oBACP,WAAW,GAAG,iBAAiB,CAAC,GAAG,CAAC,SAAS,CAAC,CAAA;gBAC/C,CAAC;gBAED,IAAI,CAAC,WAAW,EAAE,CAAC;oBAClB,MAAM,IAAI,KAAK,CAAC,2DAA2D,IAAI,CAAC,SAAS,CAAC,OAAO,CAAC,EAAE,CAAC,CAAA;gBACtG,CAAC;gBAED,IAAI,WAAW,CAAC,QAAQ,KAAK,SAAS,EAAE,CAAC;oBACxC,WAAW,CAAC,QAAQ,GAAG,WAAW,EAAE,CAAA;gBACrC,CAAC;gBAED,OAAO,WAAW,CAAA;YACnB,CAAC;QACF,CAAC;IACF,CAAC;IAED,OAAO,OAAO,CAAC,WAAW,CAAC,CAAA;AAC5B,CAAC;AAED,SAAS,8BAA8B,CAAC,QAAwB;IAC/D,MAAM,YAAY,GAAG,IAAI,GAAG,EAAkB,CAAA;IAE9C,MAAM,aAAa,GAAG,IAAI,GAAG,EAA2B,CAAA;IACxD,MAAM,eAAe,GAAG,IAAI,GAAG,EAAuC,CAAA;IAEtE,SAAS,iBAAiB,CAAC,IAAoB;QAC9C,IAAI,YAAY,CAAC,GAAG,CAAC,IAAI,CAAC,EAAE,CAAC;YAC5B,OAAO,aAAa,CAAC,GAAG,CAAC,IAAI,CAAC,CAAA;QAC/B,CAAC;QAED,YAAY,CAAC,GAAG,CAAC,IAAI,CAAC,CAAA;QAEtB,QAAQ,IAAI,CAAC,IAAI,EAAE,CAAC;YACnB,KAAK,gBAAgB,CAAC;YACtB,KAAK,iBAAiB,CAAC,CAAC,CAAC;gBACxB,aAAa,CAAC,GAAG,CAAC,IAAI,EAAE,IAAI,CAAC,QAAQ,CAAC,CAAA;gBAEtC,OAAO,IAAI,CAAC,QAAQ,CAAA;YACrB,CAAC;YAED,KAAK,aAAa,CAAC;YACnB,KAAK,YAAY,CAAC,CAAC,CAAC;gBACnB,MAAM,MAAM,GAAG,iBAAiB,CAAC,IAAI,CAAC,OAAO,CAAC,CAAA;gBAE9C,IAAI,IAAI,CAAC,QAAQ,EAAE,CAAC;oBACnB,aAAa,CAAC,GAAG,CAAC,IAAI,EAAE,IAAI,CAAC,CAAA;oBAE7B,OAAO,IAAI,CAAA;gBACZ,CAAC;qBAAM,IAAI,SAAS,CAAC,MAAM,CAAC,EAAE,CAAC;oBAC9B,aAAa,CAAC,GAAG,CAAC,IAAI,EAAE,MAAM,CAAC,CAAA;oBAE/B,OAAO,MAAM,CAAA;gBACd,CAAC;qBAAM,CAAC;oBACP,eAAe,CAAC,GAAG,CAAC,IAAI,EAAE,IAAI,GAAG,CAAC,CAAC,IAAI,CAAC,OAAO,CAAC,CAAC,CAAC,CAAA;oBAElD,OAAO,SAAS,CAAA;gBACjB,CAAC;YACF,CAAC;YAED,KAAK,UAAU,CAAC;YAChB,KAAK,QAAQ,CAAC,CAAC,CAAC;gBACf,MAAM,YAAY,GAAG,IAAI,GAAG,EAAkB,CAAA;gBAE9C,IAAI,8BAA8B,GAAG,IAAI,CAAA;gBAEzC,KAAK,MAAM,OAAO,IAAI,IAAI,CAAC,OAAO,EAAE,CAAC;oBACpC,MAAM,MAAM,GAAG,iBAAiB,CAAC,OAAO,CAAC,CAAA;oBAEzC,IAAI,SAAS,CAAC,MAAM,CAAC,EAAE,CAAC;wBACvB,IAAI,MAAM,IAAI,KAAK,EAAE,CAAC;4BACrB,8BAA8B,GAAG,KAAK,CAAA;wBACvC,CAAC;oBACF,CAAC;yBAAM,CAAC;wBACP,YAAY,CAAC,GAAG,CAAC,OAAO,CAAC,CAAA;oBAC1B,CAAC;gBACF,CAAC;gBAED,IAAI,IAAI,CAAC,QAAQ,IAAI,IAAI,EAAE,CAAC;oBAC3B,aAAa,CAAC,GAAG,CAAC,IAAI,EAAE,IAAI,CAAC,CAAA;oBAE7B,OAAO,IAAI,CAAA;gBACZ,CAAC;qBAAM,IAAI,YAAY,CAAC,IAAI,IAAI,CAAC,IAAI,CAAC,8BAA8B,EAAE,CAAC;oBACtE,aAAa,CAAC,GAAG,CAAC,IAAI,EAAE,8BAA8B,CAAC,CAAA;oBAEvD,OAAO,8BAA8B,CAAA;gBACtC,CAAC;qBAAM,CAAC;oBACP,eAAe,CAAC,GAAG,CAAC,IAAI,EAAE,YAAY,CAAC,CAAA;oBAEvC,OAAO,SAAS,CAAA;gBACjB,CAAC;YACF,CAAC;QACF,CAAC;QAED,OAAO,SAAS,CAAA;IACjB,CAAC;IAED,8EAA8E;IAC9E,wBAAwB;IACxB,iBAAiB,CAAC,QAAQ,CAAC,CAAA;IAE3B,oGAAoG;IACpG,wEAAwE;IACxE,OAAO,eAAe,CAAC,IAAI,GAAG,CAAC,EAAE,CAAC;QACjC,kFAAkF;QAClF,iFAAiF;QACjF,+BAA+B;QAC/B,IAAI,oCAAoC,GAAG,KAAK,CAAA;QAEhD,oEAAoE;QACpE,KAAK,MAAM,CAAC,IAAI,EAAE,YAAY,CAAC,IAAI,eAAe,EAAE,CAAC;YACpD,IAAI,0BAA0B,GAAG,KAAK,CAAA;YAEtC,wDAAwD;YACxD,KAAK,MAAM,UAAU,IAAI,YAAY,EAAE,CAAC;gBACvC,4CAA4C;gBAC5C,MAAM,KAAK,GAAG,aAAa,CAAC,GAAG,CAAC,UAAU,CAAC,CAAA;gBAE3C,IAAI,KAAK,KAAK,SAAS,EAAE,CAAC;oBACzB,yDAAyD;oBACzD,oCAAoC,GAAG,IAAI,CAAA;oBAE3C,IAAI,KAAK,KAAK,KAAK,EAAE,CAAC;wBACrB,2EAA2E;wBAC3E,0BAA0B,GAAG,IAAI,CAAA;wBAEjC,MAAK;oBACN,CAAC;yBAAM,CAAC;wBACP,6DAA6D;wBAC7D,YAAY,CAAC,MAAM,CAAC,UAAU,CAAC,CAAA;oBAChC,CAAC;gBACF,CAAC;YACF,CAAC;YAED,oFAAoF;YACpF,2BAA2B;YAC3B,IAAI,0BAA0B,IAAI,YAAY,CAAC,IAAI,KAAK,CAAC,EAAE,CAAC;gBAC3D,MAAM,UAAU,GAAG,CAAC,0BAA0B,CAAA;gBAE9C,aAAa,CAAC,GAAG,CAAC,IAAI,EAAE,UAAU,CAAC,CAAA;gBACnC,eAAe,CAAC,MAAM,CAAC,IAAI,CAAC,CAAA;YAC7B,CAAC;QACF,CAAC;QAED,0DAA0D;QAC1D,kFAAkF;QAClF,IAAI,CAAC,oCAAoC,EAAE,CAAC;YAC3C,MAAK;QACN,CAAC;IACF,CAAC;IAED,uDAAuD;IACvD,yGAAyG;IACzG,KAAK,MAAM,IAAI,IAAI,eAAe,CAAC,IAAI,EAAE,EAAE,CAAC;QAC3C,aAAa,CAAC,GAAG,CAAC,IAAI,EAAE,IAAI,CAAC,CAAA;QAC7B,eAAe,CAAC,MAAM,CAAC,IAAI,CAAC,CAAA;IAC7B,CAAC;IAED,iFAAiF;IACjF,KAAK,MAAM,CAAC,IAAI,EAAE,UAAU,CAAC,IAAI,aAAa,EAAE,CAAC;QAChD,IAAI,CAAC,QAAQ,GAAG,UAAU,CAAA;IAC3B,CAAC;AACF,CAAC;AAED,MAAM,UAAU,6BAA6B,CAAC,QAAwB;IACrE,MAAM,sBAAsB,GAAG,IAAI,GAAG,EAAkB,CAAA;IAExD,SAAS,MAAM,CAAC,IAAoB;QACnC,IAAI,sBAAsB,CAAC,GAAG,CAAC,IAAI,CAAC,EAAE,CAAC;YACtC,IAAI,IAAI,CAAC,IAAI,KAAK,aAAa,EAAE,CAAC;gBACjC,MAAM,IAAI,KAAK,CAAC,4CAA4C,IAAI,CAAC,IAAI,IAAI,CAAC,CAAA;YAC3E,CAAC;iBAAM,CAAC;gBACP,MAAM,IAAI,KAAK,CAAC,qCAAqC,IAAI,CAAC,SAAS,CAAC,IAAI,EAAE,SAAS,EAAE,CAAC,CAAC,EAAE,CAAC,CAAA;YAC3F,CAAC;QACF,CAAC;QAED,sBAAsB,CAAC,GAAG,CAAC,IAAI,CAAC,CAAA;QAEhC,QAAQ,IAAI,CAAC,IAAI,EAAE,CAAC;YACnB,KAAK,aAAa,CAAC;YACnB,KAAK,YAAY,CAAC,CAAC,CAAC;gBACnB,MAAM,CAAC,IAAI,CAAC,OAAO,CAAC,CAAA;gBAEpB,MAAK;YACN,CAAC;YAED,KAAK,UAAU,CAAC,CAAC,CAAC;gBACjB,KAAK,MAAM,MAAM,IAAI,IAAI,CAAC,OAAO,EAAE,CAAC;oBACnC,MAAM,CAAC,MAAM,CAAC,CAAA;oBAEd,IAAI,CAAC,MAAM,CAAC,QAAQ,EAAE,CAAC;wBACtB,MAAK;oBACN,CAAC;gBACF,CAAC;gBAED,MAAK;YACN,CAAC;YAED,KAAK,QAAQ,CAAC,CAAC,CAAC;gBACf,KAAK,MAAM,MAAM,IAAI,IAAI,CAAC,OAAO,EAAE,CAAC;oBACnC,MAAM,CAAC,MAAM,CAAC,CAAA;gBACf,CAAC;gBAED,MAAK;YACN,CAAC;QACF,CAAC;QAED,sBAAsB,CAAC,MAAM,CAAC,IAAI,CAAC,CAAA;IACpC,CAAC;IAED,MAAM,CAAC,QAAQ,CAAC,CAAA;AACjB,CAAC;AAED,iGAAiG;AACjG,+BAA+B;AAC/B,iGAAiG;AACjG,MAAM,UAAU,SAAS,CAAC,OAAmB;IAC5C,OAAO;QACN,IAAI,EAAE,YAAY;QAClB,OAAO,EAAE,0BAA0B,CAAC,OAAO,CAAC;QAC5C,QAAQ,EAAE,KAAK;KACf,CAAA;AACF,CAAC;AAED,MAAM,UAAU,UAAU,CAAC,OAAmB;IAC7C,OAAO;QACN,IAAI,EAAE,YAAY;QAClB,OAAO,EAAE,0BAA0B,CAAC,OAAO,CAAC;QAC5C,QAAQ,EAAE,IAAI;KACd,CAAA;AACF,CAAC;AAED,MAAM,UAAU,KAAK,CAAC,GAAG,OAAqB;IAC7C,IAAI,OAAO,CAAC,MAAM,IAAI,CAAC,EAAE,CAAC;QACzB,MAAM,IAAI,KAAK,CAAC,uCAAuC,CAAC,CAAA;IACzD,CAAC;IAED,MAAM,iBAAiB,GAAG,OAAO,CAAC,GAAG,CAAC,MAAM,CAAC,EAAE,CAAC,0BAA0B,CAAC,MAAM,CAAC,CAAC,CAAA;IAEnF,OAAO;QACN,IAAI,EAAE,QAAQ;QACd,OAAO,EAAE,iBAAiB;QAC1B,QAAQ,EAAE,KAAK;QACf,UAAU,EAAE,KAAK;KACjB,CAAA;AACF,CAAC;AAED,MAAM,UAAU,MAAM,CAAC,GAAG,OAAqB;IAC9C,IAAI,OAAO,CAAC,MAAM,IAAI,CAAC,EAAE,CAAC;QACzB,MAAM,IAAI,KAAK,CAAC,wCAAwC,CAAC,CAAA;IAC1D,CAAC;IAED,MAAM,iBAAiB,GAAG,OAAO,CAAC,GAAG,CAAC,MAAM,CAAC,EAAE,CAAC,0BAA0B,CAAC,MAAM,CAAC,CAAC,CAAA;IAEnF,OAAO;QACN,IAAI,EAAE,QAAQ;QACd,OAAO,EAAE,iBAAiB;QAC1B,QAAQ,EAAE,KAAK;QACf,UAAU,EAAE,IAAI;KAChB,CAAA;AACF,CAAC;AAED,MAAM,UAAU,QAAQ,CAAuB,OAAmB;IACjE,OAAO,EAAE,GAAG,0BAA0B,CAAC,OAAO,CAAC,EAAE,QAAQ,EAAE,IAAI,EAAO,CAAA;AACvE,CAAC;AAED,MAAM,UAAU,MAAM,CAAuB,OAAmB;IAC/D,OAAO,EAAE,GAAG,0BAA0B,CAAC,OAAO,CAAC,EAAE,MAAM,EAAE,IAAI,EAAO,CAAA;AACrE,CAAC;AAED,MAAM,UAAU,QAAQ,CAAuB,OAAmB;IACjE,OAAO,EAAE,GAAG,0BAA0B,CAAC,OAAO,CAAC,EAAE,MAAM,EAAE,KAAK,EAAO,CAAA;AACtE,CAAC;AAED,MAAM,UAAU,OAAO,CAAC,OAAgB;IACvC,IAAI,OAAO,CAAC,OAAO,CAAC,EAAE,CAAC;QACtB,OAAO,GAAG,CAAC,UAAU,EAAE,GAAG,OAAO,CAAC,CAAA;IACnC,CAAC;SAAM,CAAC;QACP,OAAO,GAAG,CAAC,UAAU,EAAE,OAAO,CAAC,CAAA;IAChC,CAAC;IAED,MAAM,MAAM,GAAG,WAAW,CAAC,OAAO,CAAC,CAAA;IACnC,MAAM,QAAQ,GAAG,iBAAiB,CAAC,OAAO,CAAC,CAAA;IAE3C,OAAO;QACN,IAAI,EAAE,iBAAiB;QACvB,IAAI,EAAE,WAAW;QACjB,OAAO;QACP,MAAM;QACN,QAAQ;KACR,CAAA;AACF,CAAC;AAED,SAAS,cAAc,CAAC,OAAe;IACtC,IAAI,OAAO,CAAC,MAAM,GAAG,CAAC,EAAE,CAAC;QACxB,MAAM,IAAI,KAAK,CAAC,8DAA8D,CAAC,CAAA;IAChF,CAAC;IAED,OAAO;QACN,IAAI,EAAE,gBAAgB;QACtB,OAAO;QACP,QAAQ,EAAE,KAAK;KACf,CAAA;AACF,CAAC;AAED,SAAS,WAAW,CAAC,IAAY,EAAE,OAAuB;IACzD,IAAI,IAAI,CAAC,MAAM,GAAG,CAAC,EAAE,CAAC;QACrB,MAAM,IAAI,KAAK,CAAC,uDAAuD,CAAC,CAAA;IACzE,CAAC;IAED,OAAO;QACN,IAAI,EAAE,aAAa;QACnB,IAAI;QACJ,OAAO;QACP,QAAQ,EAAE,KAAK;KACf,CAAA;AACF,CAAC;AAED,SAAS,QAAQ,CAAC,OAAyB;IAC1C,OAAO;QACN,IAAI,EAAE,UAAU;QAChB,OAAO;QACP,QAAQ,EAAE,KAAK;KACf,CAAA;AACF,CAAC;AAED,SAAS,mBAAmB,CAAC,SAAmB;IAC/C,OAAO;QACN,IAAI,EAAE,sBAAsB;QAC5B,SAAS;QACT,QAAQ,EAAE,KAAK;KACf,CAAA;AACF,CAAC;AAED,SAAS,0BAA0B,CAAC,UAAsB;IACzD,IAAI,QAAQ,CAAC,UAAU,CAAC,EAAE,CAAC;QAC1B,OAAO,cAAc,CAAC,UAAU,CAAC,CAAA;IAClC,CAAC;SAAM,IAAI,OAAO,CAAC,UAAU,CAAC,EAAE,CAAC;QAChC,MAAM,iBAAiB,GAAG,UAAU,CAAC,GAAG,CAAC,OAAO,CAAC,EAAE,CAAC,0BAA0B,CAAC,OAAO,CAAC,CAAC,CAAA;QAExF,OAAO,QAAQ,CAAC,iBAAiB,CAAC,CAAA;IACnC,CAAC;SAAM,IAAI,UAAU,CAAC,UAAU,CAAC,EAAE,CAAC;QACnC,OAAO,mBAAmB,CAAC,UAAU,CAAC,CAAA;IACvC,CAAC;SAAM,CAAC;QACP,OAAO,UAAU,CAAA;IAClB,CAAC;AACF,CAAC"}

package/dist/GrammarComposer.d.ts

@@ -0,0 +1,61 @@
+import { Pattern } from 'regexp-composer';
+export * from './TopDownParser.js';
+export declare function buildGrammar<T extends {
+    [key: string]: any;
+}>(obj: T | (new () => T), startProductionName: keyof T): Grammar<T>;
+export declare function zeroOrMore(content: Production): Repetition;
+export declare function oneOrMore(content: Production): Repetition;
+export declare function anyOf(...members: Production[]): Choice;
+export declare function bestOf(...members: Production[]): Choice;
+export declare function possibly<T extends Production>(content: Production): T;
+export declare function pattern(pattern: Pattern): PatternTerminal;
+export declare function cached<T extends Production>(content: Production): T;
+export declare function uncached<T extends Production>(content: Production): T;
+export interface Grammar<T> {
+    rootElement: Nonterminal;
+    productions: {
+        [key in keyof T]: any;
+    };
+    maxElementId: number;
+}
+export type Production = string | GrammarElement | (() => Production) | Production[];
+export type GrammarElement = StringTerminal | PatternTerminal | Nonterminal | Sequence | Repetition | Choice | NonterminalReference;
+interface GrammarElementBase {
+    type: string;
+    optional: boolean;
+    uniqueId?: number;
+    cached?: boolean;
+}
+export type Terminal = StringTerminal | PatternTerminal;
+export interface StringTerminal extends GrammarElementBase {
+    type: 'StringTerminal';
+    content: string;
+}
+export interface PatternTerminal extends GrammarElementBase {
+    type: 'PatternTerminal';
+    name: string;
+    pattern: Pattern | Pattern[];
+    regExp: RegExp;
+}
+export interface Nonterminal extends GrammarElementBase {
+    type: 'Nonterminal';
+    name: string;
+    content: GrammarElement;
+}
+export interface Sequence extends GrammarElementBase {
+    type: 'Sequence';
+    members: GrammarElement[];
+}
+export interface Repetition extends GrammarElementBase {
+    type: 'Repetition';
+    content: GrammarElement;
+}
+export interface Choice extends GrammarElementBase {
+    type: 'Choice';
+    members: GrammarElement[];
+    exhaustive: boolean;
+}
+export interface NonterminalReference extends GrammarElementBase {
+    type: 'NonterminalReference';
+    reference: Function;
+}