clarity-pattern-parser 6.0.0 → 7.0.0

package/dist/index.js

@@ -3,6 +3,16 @@
 Object.defineProperty(exports, '__esModule', { value: true });
 
 class Node {
+    constructor(type, name, firstIndex, lastIndex, children = [], value = "") {
+        this._type = type;
+        this._name = name;
+        this._firstIndex = firstIndex;
+        this._lastIndex = lastIndex;
+        this._parent = null;
+        this._children = children;
+        this._value = value;
+        this._children.forEach(c => c._parent = this);
+    }
     get type() {
         return this._type;
     }
@@ -33,16 +43,6 @@ class Node {
     get value() {
         return this.toString();
     }
-    constructor(type, name, firstIndex, lastIndex, children = [], value = "") {
-        this._type = type;
-        this._name = name;
-        this._firstIndex = firstIndex;
-        this._lastIndex = lastIndex;
-        this._parent = null;
-        this._children = children;
-        this._value = value;
-        this._children.forEach(c => c._parent = this);
-    }
     removeChild(node) {
         const index = this._children.indexOf(node);
         if (index > -1) {
@@ -149,6 +149,11 @@ class Node {
         this.removeAllChildren();
         this._value = value;
     }
+    remove() {
+        if (this._parent != null) {
+            this._parent.removeChild(this);
+        }
+    }
     clone() {
         return new Node(this._type, this._name, this._firstIndex, this._lastIndex, this._children.map((c) => c.clone()), this._value);
     }
@@ -185,7 +190,7 @@ class ParseError {
 class CursorHistory {
     constructor() {
         this._isRecording = false;
-        this._leafMatch = { pattern: null, node: null };
+        this._leafMatches = [{ pattern: null, node: null }];
         this._furthestError = null;
         this._currentError = null;
         this._rootMatch = { pattern: null, node: null };
@@ -200,7 +205,10 @@ class CursorHistory {
         return this._rootMatch;
     }
     get leafMatch() {
-        return this._leafMatch;
+        return this._leafMatches[this._leafMatches.length - 1];
+    }
+    get leafMatches() {
+        return this._leafMatches;
     }
     get furthestError() {
         return this._furthestError;
@@ -224,10 +232,32 @@ class CursorHistory {
         }
         this._rootMatch.pattern = pattern;
         this._rootMatch.node = node;
-        const isFurthestMatch = this._leafMatch.node === null || node.lastIndex > this._leafMatch.node.lastIndex;
+        const leafMatch = this._leafMatches[this._leafMatches.length - 1];
+        const isFurthestMatch = leafMatch.node === null || node.lastIndex > leafMatch.node.lastIndex;
+        const isSameIndexMatch = leafMatch.node === null || node.lastIndex === leafMatch.node.lastIndex;
         if (isFurthestMatch) {
-            this._leafMatch.pattern = pattern;
-            this._leafMatch.node = node;
+            // This is to save on GC churn.
+            const match = this._leafMatches.pop();
+            match.pattern = pattern;
+            match.node = node;
+            this._leafMatches.length = 0;
+            this._leafMatches.push(match);
+        }
+        else if (isSameIndexMatch) {
+            const isAncestor = this._leafMatches.some((m) => {
+                var _a;
+                let parent = (_a = m.pattern) === null || _a === void 0 ? void 0 : _a.parent;
+                while (parent != null) {
+                    if (parent == pattern.parent) {
+                        return true;
+                    }
+                    parent = parent.parent;
+                }
+                return false;
+            });
+            if (!isAncestor) {
+                this._leafMatches.unshift({ pattern, node });
+            }
         }
     }
     recordErrorAt(index, pattern) {
@@ -252,6 +282,15 @@ class CursorHistory {
 }
 
 class Cursor {
+    constructor(text) {
+        if (text.length === 0) {
+            throw new Error("Cannot have a empty string.");
+        }
+        this._text = text;
+        this._index = 0;
+        this._length = text.length;
+        this._history = new CursorHistory();
+    }
     get text() {
         return this._text;
     }
@@ -270,6 +309,9 @@ class Cursor {
     get leafMatch() {
         return this._history.leafMatch;
     }
+    get leafMatches() {
+        return this._history.leafMatches;
+    }
     get furthestError() {
         return this._history.furthestError;
     }
@@ -288,15 +330,6 @@ class Cursor {
     get currentChar() {
         return this._text[this._index];
     }
-    constructor(text) {
-        if (text.length === 0) {
-            throw new Error("Cannot have a empty string.");
-        }
-        this._text = text;
-        this._index = 0;
-        this._length = text.length;
-        this._history = new CursorHistory();
-    }
     hasNext() {
         return this._index + 1 < this._length;
     }
@@ -347,7 +380,20 @@ class Cursor {
     }
 }
 
-class Regex {
+class Literal {
+    constructor(name, value, isOptional = false) {
+        if (value.length === 0) {
+            throw new Error("Value Cannot be empty.");
+        }
+        this._type = "literal";
+        this._name = name;
+        this._literal = value;
+        this._runes = Array.from(value);
+        this._isOptional = isOptional;
+        this._parent = null;
+        this._firstIndex = 0;
+        this._lastIndex = 0;
+    }
     get type() {
         return this._type;
     }
@@ -366,6 +412,94 @@ class Regex {
     get isOptional() {
         return this._isOptional;
     }
+    test(text) {
+        const cursor = new Cursor(text);
+        const ast = this.parse(cursor);
+        return (ast === null || ast === void 0 ? void 0 : ast.value) === text;
+    }
+    exec(text) {
+        const cursor = new Cursor(text);
+        const ast = this.parse(cursor);
+        return {
+            ast: (ast === null || ast === void 0 ? void 0 : ast.value) === text ? ast : null,
+            cursor
+        };
+    }
+    parse(cursor) {
+        this._firstIndex = cursor.index;
+        const passed = this._tryToParse(cursor);
+        if (passed) {
+            cursor.resolveError();
+            const node = this._createNode();
+            cursor.recordMatch(this, node);
+            return node;
+        }
+        if (!this._isOptional) {
+            cursor.recordErrorAt(cursor.index, this);
+            return null;
+        }
+        cursor.resolveError();
+        cursor.moveTo(this._firstIndex);
+        return null;
+    }
+    _tryToParse(cursor) {
+        let passed = false;
+        const literalRuneLength = this._runes.length;
+        for (let i = 0; i < literalRuneLength; i++) {
+            const literalRune = this._runes[i];
+            const cursorRune = cursor.currentChar;
+            if (literalRune !== cursorRune) {
+                break;
+            }
+            if (i + 1 === literalRuneLength) {
+                this._lastIndex = this._firstIndex + this._literal.length - 1;
+                passed = true;
+                break;
+            }
+            if (!cursor.hasNext()) {
+                break;
+            }
+            cursor.next();
+        }
+        return passed;
+    }
+    _createNode() {
+        return new Node("literal", this._name, this._firstIndex, this._lastIndex, undefined, this._literal);
+    }
+    clone(name = this._name, isOptional = this._isOptional) {
+        const clone = new Literal(name, this._literal, isOptional);
+        return clone;
+    }
+    getTokens() {
+        return [this._literal];
+    }
+    getTokensAfter(_lastMatched) {
+        return [];
+    }
+    getNextTokens() {
+        if (this.parent == null) {
+            return [];
+        }
+        return this.parent.getTokensAfter(this);
+    }
+    getPatterns() {
+        return [this];
+    }
+    getPatternsAfter() {
+        return [];
+    }
+    getNextPatterns() {
+        if (this.parent == null) {
+            return [];
+        }
+        return this.parent.getPatternsAfter(this);
+    }
+    find(_predicate) {
+        return null;
+    }
+}
+
+class Regex {
     constructor(name, regex, isOptional = false) {
         this._node = null;
         this._cursor = null;
@@ -379,6 +513,24 @@ class Regex {
         this._regex = new RegExp(`^${regex}`, "g");
         this.assertArguments();
     }
+    get type() {
+        return this._type;
+    }
+    get name() {
+        return this._name;
+    }
+    get parent() {
+        return this._parent;
+    }
+    set parent(pattern) {
+        this._parent = pattern;
+    }
+    get children() {
+        return [];
+    }
+    get isOptional() {
+        return this._isOptional;
+    }
     assertArguments() {
         if (this._originalRegexString.length < 1) {
             throw new Error("Invalid Arguments: The regex string argument needs to be at least one character long.");
@@ -453,6 +605,9 @@ class Regex {
         }
         return this.parent.getTokensAfter(this);
     }
+    getPatterns() {
+        return [this];
+    }
     getPatternsAfter(_childReference) {
         return [];
     }
@@ -462,7 +617,7 @@ class Regex {
         }
         return this.parent.getPatternsAfter(this);
     }
-    findPattern(_predicate) {
+    find(_predicate) {
         return null;
     }
     setTokens(tokens) {
@@ -470,20 +625,6 @@ class Regex {
     }
 }
 
-function clonePatterns(patterns, isOptional) {
-    return patterns.map(p => p.clone(p.name, isOptional));
-}
-
-function filterOutNull(nodes) {
-    const filteredNodes = [];
-    for (const node of nodes) {
-        if (node !== null) {
-            filteredNodes.push(node);
-        }
-    }
-    return filteredNodes;
-}
-
 function findPattern(pattern, predicate) {
     let children = [];
     if (pattern.type === "reference") {
@@ -506,7 +647,15 @@ function findPattern(pattern, predicate) {
     }
 }
 
-class And {
+class Reference {
+    constructor(name, isOptional = false) {
+        this._type = "reference";
+        this._name = name;
+        this._parent = null;
+        this._isOptional = isOptional;
+        this._pattern = null;
+        this._children = [];
+    }
     get type() {
         return this._type;
     }
@@ -525,25 +674,6 @@ class And {
     get isOptional() {
         return this._isOptional;
     }
-    constructor(name, sequence, isOptional = false) {
-        if (sequence.length === 0) {
-            throw new Error("Need at least one pattern with an 'and' pattern.");
-        }
-        const children = clonePatterns(sequence);
-        this._assignChildrenToParent(children);
-        this._type = "and";
-        this._name = name;
-        this._isOptional = isOptional;
-        this._parent = null;
-        this._children = children;
-        this._firstIndex = -1;
-        this._nodes = [];
-    }
-    _assignChildrenToParent(children) {
-        for (const child of children) {
-            child.parent = this;
-        }
-    }
     test(text) {
         const cursor = new Cursor(text);
         const ast = this.parse(cursor);
@@ -558,118 +688,48 @@ class And {
         };
     }
     parse(cursor) {
-        this._firstIndex = cursor.index;
-        this._nodes = [];
-        const passed = this.tryToParse(cursor);
-        if (passed) {
-            const node = this.createNode(cursor);
-            if (node !== null) {
-                cursor.recordMatch(this, node);
+        return this._getPatternSafely().parse(cursor);
+    }
+    _getPatternSafely() {
+        if (this._pattern === null) {
+            const pattern = this._findPattern();
+            if (pattern === null) {
+                throw new Error(`Couldn't find '${this._name}' pattern within tree.`);
             }
-            return node;
+            const clonedPattern = pattern.clone(this._name, this._isOptional);
+            clonedPattern.parent = this;
+            this._pattern = clonedPattern;
+            this._children = [this._pattern];
         }
-        if (this._isOptional) {
-            cursor.resolveError();
+        return this._pattern;
+    }
+    _findPattern() {
+        const root = this._getRoot();
+        return findPattern(root, (pattern) => {
+            return pattern.name === this._name && pattern.type !== "reference";
+        });
+    }
+    _getRoot() {
+        let node = this;
+        while (true) {
+            const parent = node.parent;
+            if (parent == null) {
+                break;
+            }
+            else {
+                node = parent;
+            }
         }
-        return null;
-    }
-    tryToParse(cursor) {
-        let passed = false;
-        for (let i = 0; i < this._children.length; i++) {
-            const runningCursorIndex = cursor.index;
-            const nextPatternIndex = i + 1;
-            const hasMorePatterns = nextPatternIndex < this._children.length;
-            const node = this._children[i].parse(cursor);
-            const hasNoError = !cursor.hasError;
-            const hadMatch = node !== null;
-            if (hasNoError) {
-                this._nodes.push(node);
-                if (hasMorePatterns) {
-                    if (hadMatch) {
-                        if (cursor.hasNext()) {
-                            // We had a match. Increment the cursor and use the next pattern.
-                            cursor.next();
-                            continue;
-                        }
-                        else {
-                            // We are at the end of the text, it may still be valid, if all the
-                            // following patterns are optional.
-                            if (this.areRemainingPatternsOptional(i)) {
-                                passed = true;
-                                break;
-                            }
-                            // We didn't finish the parsing sequence.
-                            cursor.recordErrorAt(cursor.index + 1, this);
-                            break;
-                        }
-                    }
-                    else {
-                        // An optional pattern did not matched, try from the same spot on the next
-                        // pattern.
-                        cursor.moveTo(runningCursorIndex);
-                        continue;
-                    }
-                }
-                else {
-                    // If we don't have any results from what we parsed then record error.
-                    const lastNode = this.getLastValidNode();
-                    if (lastNode === null) {
-                        cursor.recordErrorAt(cursor.index, this);
-                        break;
-                    }
-                    // The sequence was parsed fully.
-                    passed = true;
-                    break;
-                }
-            }
-            else {
-                // The pattern failed.
-                cursor.moveTo(this._firstIndex);
-                break;
-            }
-        }
-        return passed;
-    }
-    getLastValidNode() {
-        const nodes = filterOutNull(this._nodes);
-        if (nodes.length === 0) {
-            return null;
-        }
-        return nodes[nodes.length - 1];
-    }
-    areRemainingPatternsOptional(fromIndex) {
-        const startOnIndex = fromIndex + 1;
-        const length = this._children.length;
-        for (let i = startOnIndex; i < length; i++) {
-            const pattern = this._children[i];
-            if (!pattern.isOptional) {
-                return false;
-            }
-        }
-        return true;
-    }
-    createNode(cursor) {
-        const children = filterOutNull(this._nodes);
-        const lastIndex = children[children.length - 1].lastIndex;
-        cursor.getChars(this._firstIndex, lastIndex);
-        cursor.moveTo(lastIndex);
-        return new Node("and", this._name, this._firstIndex, lastIndex, children);
+        return node;
     }
     getTokens() {
-        const tokens = [];
-        for (const child of this._children) {
-            tokens.push(...child.getTokens());
-            if (!child.isOptional) {
-                break;
-            }
-        }
-        return tokens;
+        return this._getPatternSafely().getTokens();
     }
-    getTokensAfter(childReference) {
-        const patterns = this.getPatternsAfter(childReference);
-        const tokens = [];
-        patterns.forEach(p => tokens.push(...p.getTokens()));
-        return tokens;
+    getTokensAfter(_lastMatched) {
+        if (this._parent == null) {
+            return [];
+        }
+        return this._parent.getTokensAfter(this);
     }
     getNextTokens() {
         if (this.parent == null) {
@@ -677,47 +737,14 @@ class And {
         }
         return this.parent.getTokensAfter(this);
     }
-    getPatternsAfter(childReference) {
-        let nextSibling = null;
-        let nextSiblingIndex = -1;
-        let index = -1;
-        const patterns = [];
-        for (let i = 0; i < this._children.length; i++) {
-            if (this._children[i] === childReference) {
-                if (i + 1 < this._children.length) {
-                    nextSibling = this._children[i + 1];
-                }
-                nextSiblingIndex = i + 1;
-                index = i;
-                break;
-            }
-        }
-        // The child reference isn't one of the child patterns.
-        if (index === -1) {
+    getPatterns() {
+        return this._getPatternSafely().getPatterns();
+    }
+    getPatternsAfter(_childReference) {
+        if (this._parent == null) {
             return [];
         }
-        // The reference pattern is the last child. So ask the parent for the next pattern.
-        if (nextSiblingIndex === this._children.length && this._parent !== null) {
-            return this._parent.getPatternsAfter(this);
-        }
-        // Next pattern isn't optional so send it back as the next patterns.
-        if (nextSibling !== null && !nextSibling.isOptional) {
-            return [nextSibling];
-        }
-        // Send back as many optional patterns as possible.
-        if (nextSibling !== null && nextSibling.isOptional) {
-            for (let i = nextSiblingIndex; i < this._children.length; i++) {
-                const child = this._children[i];
-                patterns.push(child);
-                if (!child.isOptional) {
-                    break;
-                }
-                if (i === this._children.length - 1 && this._parent !== null) {
-                    patterns.push(...this._parent.getPatternsAfter(this));
-                }
-            }
-        }
-        return patterns;
+        return this._parent.getPatternsAfter(this);
     }
     getNextPatterns() {
         if (this.parent == null) {
@@ -725,15 +752,32 @@ class And {
         }
         return this.parent.getPatternsAfter(this);
     }
-    findPattern(predicate) {
-        return findPattern(this, predicate);
+    find(_predicate) {
+        return null;
     }
     clone(name = this._name, isOptional = this._isOptional) {
-        return new And(name, this._children, isOptional);
+        return new Reference(name, isOptional);
     }
 }
 
-class Literal {
+function clonePatterns(patterns, isOptional) {
+    return patterns.map(p => p.clone(p.name, isOptional));
+}
+
+class Or {
+    constructor(name, options, isOptional = false) {
+        if (options.length === 0) {
+            throw new Error("Need at least one pattern with an 'or' pattern.");
+        }
+        const children = clonePatterns(options, false);
+        this._assignChildrenToParent(children);
+        this._type = "or";
+        this._name = name;
+        this._parent = null;
+        this._children = children;
+        this._isOptional = isOptional;
+        this._firstIndex = 0;
+    }
     get type() {
         return this._type;
     }
@@ -747,23 +791,15 @@ class Literal {
         this._parent = pattern;
     }
     get children() {
-        return [];
+        return this._children;
     }
     get isOptional() {
         return this._isOptional;
     }
-    constructor(name, value, isOptional = false) {
-        if (value.length === 0) {
-            throw new Error("Value Cannot be empty.");
+    _assignChildrenToParent(children) {
+        for (const child of children) {
+            child.parent = this;
         }
-        this._type = "literal";
-        this._name = name;
-        this._literal = value;
-        this._runes = Array.from(value);
-        this._isOptional = isOptional;
-        this._parent = null;
-        this._firstIndex = 0;
-        this._lastIndex = 0;
     }
     test(text) {
         const cursor = new Cursor(text);
@@ -780,15 +816,13 @@ class Literal {
     }
     parse(cursor) {
         this._firstIndex = cursor.index;
-        const passed = this._tryToParse(cursor);
-        if (passed) {
+        const node = this._tryToParse(cursor);
+        if (node != null) {
             cursor.resolveError();
-            const node = this._createNode();
-            cursor.recordMatch(this, node);
             return node;
         }
         if (!this._isOptional) {
-            cursor.recordErrorAt(cursor.index, this);
+            cursor.recordErrorAt(this._firstIndex, this);
             return null;
         }
         cursor.resolveError();
@@ -796,60 +830,250 @@ class Literal {
         return null;
     }
     _tryToParse(cursor) {
-        let passed = false;
-        const literalRuneLength = this._runes.length;
-        for (let i = 0; i < literalRuneLength; i++) {
-            const literalRune = this._runes[i];
-            const cursorRune = cursor.currentChar;
-            if (literalRune !== cursorRune) {
-                break;
+        for (const pattern of this._children) {
+            cursor.moveTo(this._firstIndex);
+            const result = pattern.parse(cursor);
+            if (!cursor.hasError) {
+                return result;
             }
-            if (i + 1 === literalRuneLength) {
-                this._lastIndex = this._firstIndex + this._literal.length - 1;
-                passed = true;
-                break;
+            cursor.resolveError();
+        }
+        return null;
+    }
+    getTokens() {
+        const tokens = [];
+        for (const child of this._children) {
+            tokens.push(...child.getTokens());
+        }
+        return tokens;
+    }
+    getTokensAfter(_childReference) {
+        if (this._parent === null) {
+            return [];
+        }
+        return this._parent.getTokensAfter(this);
+    }
+    getNextTokens() {
+        if (this._parent == null) {
+            return [];
+        }
+        return this._parent.getTokensAfter(this);
+    }
+    getPatterns() {
+        const patterns = [];
+        for (const pattern of this._children) {
+            patterns.push(...pattern.getPatterns());
+        }
+        return patterns;
+    }
+    getPatternsAfter(_childReference) {
+        if (this._parent === null) {
+            return [];
+        }
+        return this._parent.getPatternsAfter(this);
+    }
+    getNextPatterns() {
+        if (this.parent == null) {
+            return [];
+        }
+        return this.parent.getPatternsAfter(this);
+    }
+    find(predicate) {
+        return findPattern(this, predicate);
+    }
+    clone(name = this._name, isOptional = this._isOptional) {
+        const or = new Or(name, this._children, isOptional);
+        return or;
+    }
+}
+
+class FiniteRepeat {
+    constructor(name, pattern, repeatAmount, options = {}) {
+        this._type = "finite-repeat";
+        this._name = name;
+        this._parent = null;
+        this._children = [];
+        this._hasDivider = options.divider != null;
+        this._min = options.min != null ? options.min : 1;
+        this._max = repeatAmount;
+        this._trimDivider = options.trimDivider == null ? false : options.trimDivider;
+        for (let i = 0; i < repeatAmount; i++) {
+            this._children.push(pattern.clone(pattern.name));
+            if (options.divider != null && (i < repeatAmount - 1 || !this._trimDivider)) {
+                this._children.push(options.divider.clone(options.divider.name, false));
             }
-            if (!cursor.hasNext()) {
+        }
+    }
+    get type() {
+        return this._type;
+    }
+    get name() {
+        return this._name;
+    }
+    get parent() {
+        return this._parent;
+    }
+    set parent(value) {
+        this._parent = value;
+    }
+    get children() {
+        return this._children;
+    }
+    get isOptional() {
+        return this._min === 0;
+    }
+    get min() {
+        return this._min;
+    }
+    get max() {
+        return this._max;
+    }
+    parse(cursor) {
+        const startIndex = cursor.index;
+        const nodes = [];
+        const modulo = this._hasDivider ? 2 : 1;
+        let matchCount = 0;
+        for (let i = 0; i < this._children.length; i++) {
+            const childPattern = this._children[i];
+            const node = childPattern.parse(cursor);
+            if (i % modulo === 0 && !cursor.hasError) {
+                matchCount++;
+            }
+            if (cursor.hasError) {
+                cursor.resolveError();
                 break;
             }
-            cursor.next();
+            if (node != null) {
+                nodes.push(node);
+                if (cursor.hasNext()) {
+                    cursor.next();
+                }
+                else {
+                    break;
+                }
+            }
         }
-        return passed;
+        if (this._trimDivider && this._hasDivider) {
+            if (cursor.leafMatch.pattern === this.children[1]) {
+                const node = nodes.pop();
+                cursor.moveTo(node.firstIndex);
+            }
+        }
+        if (matchCount < this._min) {
+            cursor.moveTo(startIndex);
+            cursor.recordErrorAt(startIndex, this);
+            return null;
+        }
+        else if (nodes.length === 0) {
+            cursor.resolveError();
+            cursor.moveTo(startIndex);
+            return null;
+        }
+        const firstIndex = nodes[0].firstIndex;
+        const lastIndex = nodes[nodes.length - 1].lastIndex;
+        cursor.moveTo(lastIndex);
+        return new Node(this._type, this.name, firstIndex, lastIndex, nodes);
     }
-    _createNode() {
-        return new Node("literal", this._name, this._firstIndex, this._lastIndex, undefined, this._literal);
+    test(text) {
+        const cursor = new Cursor(text);
+        const ast = this.parse(cursor);
+        return (ast === null || ast === void 0 ? void 0 : ast.value) === text;
     }
-    clone(name = this._name, isOptional = this._isOptional) {
-        const clone = new Literal(name, this._literal, isOptional);
-        return clone;
+    exec(text) {
+        const cursor = new Cursor(text);
+        const ast = this.parse(cursor);
+        return {
+            ast: (ast === null || ast === void 0 ? void 0 : ast.value) === text ? ast : null,
+            cursor
+        };
+    }
+    clone(name = this._name, isOptional) {
+        let min = this._min;
+        if (isOptional != null) {
+            if (isOptional) {
+                min = 0;
+            }
+            else {
+                min = Math.max(this._min, 1);
+            }
+        }
+        return new FiniteRepeat(name, this._children[0], this._max, {
+            divider: this._hasDivider ? this._children[1] : undefined,
+            min,
+            trimDivider: this._trimDivider
+        });
     }
     getTokens() {
-        return [this._literal];
+        return this._children[0].getTokens();
     }
-    getTokensAfter(_lastMatched) {
-        return [];
+    getTokensAfter(childReference) {
+        const patterns = this.getPatternsAfter(childReference);
+        const tokens = [];
+        patterns.forEach(p => tokens.push(...p.getTokens()));
+        return tokens;
     }
     getNextTokens() {
-        if (this.parent == null) {
+        if (this._parent == null) {
             return [];
         }
-        return this.parent.getTokensAfter(this);
+        return this._parent.getTokensAfter(this);
     }
-    getPatternsAfter() {
-        return [];
+    getPatterns() {
+        return this._children[0].getPatterns();
+    }
+    getPatternsAfter(childReference) {
+        const childIndex = this._children.indexOf(childReference);
+        // If Reference Pattern isn't a child.
+        if (childIndex == -1) {
+            return [];
+        }
+        // If Reference Pattern is the last pattern. Ask for the parents next patterns 
+        if (childIndex === this._children.length - 1) {
+            if (this._parent == null) {
+                return [];
+            }
+            else {
+                return this._parent.getPatternsAfter(this);
+            }
+        }
+        // Get the next childs patterns.
+        const nextChild = this._children[childIndex + 1];
+        return nextChild.getPatterns();
     }
     getNextPatterns() {
-        if (this.parent == null) {
+        if (this._parent == null) {
             return [];
         }
-        return this.parent.getPatternsAfter(this);
+        return this._parent.getPatternsAfter(this);
     }
-    findPattern(_predicate) {
-        return null;
+    find(predicate) {
+        return findPattern(this, predicate);
     }
 }
 
-class Not {
+class InfiniteRepeat {
+    constructor(name, pattern, options = {}) {
+        const min = options.min != null ? options.min : 1;
+        const divider = options.divider;
+        let children;
+        if (divider != null) {
+            children = [pattern.clone(), divider.clone(divider.name, false)];
+        }
+        else {
+            children = [pattern.clone()];
+        }
+        this._assignChildrenToParent(children);
+        this._type = "infinite-repeat";
+        this._name = name;
+        this._min = min;
+        this._parent = null;
+        this._children = children;
+        this._pattern = children[0];
+        this._divider = children[1];
+        this._firstIndex = -1;
+        this._nodes = [];
+        this._trimDivider = options.trimDivider == null ? false : options.trimDivider;
+    }
     get type() {
         return this._type;
     }
@@ -866,169 +1090,260 @@ class Not {
         return this._children;
     }
     get isOptional() {
-        return false;
+        return this._min === 0;
     }
-    constructor(name, pattern) {
-        this._type = "not";
-        this._name = name;
-        this._parent = null;
-        this._children = [pattern.clone(pattern.name, false)];
-        this._children[0].parent = this;
+    get min() {
+        return this._min;
+    }
+    _assignChildrenToParent(children) {
+        for (const child of children) {
+            child.parent = this;
+        }
     }
     test(text) {
         const cursor = new Cursor(text);
-        this.parse(cursor);
-        return !cursor.hasError;
+        const ast = this.parse(cursor);
+        return (ast === null || ast === void 0 ? void 0 : ast.value) === text;
     }
     exec(text) {
         const cursor = new Cursor(text);
         const ast = this.parse(cursor);
         return {
-            ast,
+            ast: (ast === null || ast === void 0 ? void 0 : ast.value) === text ? ast : null,
             cursor
         };
     }
     parse(cursor) {
-        const firstIndex = cursor.index;
-        this._children[0].parse(cursor);
-        if (cursor.hasError) {
+        this._firstIndex = cursor.index;
+        this._nodes = [];
+        const passed = this._tryToParse(cursor);
+        if (passed) {
             cursor.resolveError();
-            cursor.moveTo(firstIndex);
+            const node = this._createNode(cursor);
+            if (node != null) {
+                cursor.moveTo(node.lastIndex);
+                cursor.recordMatch(this, node);
+            }
+            return node;
+        }
+        if (this._min > 0) {
+            return null;
+        }
+        cursor.resolveError();
+        return null;
+    }
+    _meetsMin() {
+        if (this._divider != null) {
+            return Math.ceil(this._nodes.length / 2) >= this._min;
+        }
+        return this._nodes.length >= this._min;
+    }
+    _tryToParse(cursor) {
+        let passed = false;
+        while (true) {
+            const runningCursorIndex = cursor.index;
+            const repeatedNode = this._pattern.parse(cursor);
+            if (cursor.hasError) {
+                const lastValidNode = this._getLastValidNode();
+                if (lastValidNode != null) {
+                    passed = true;
+                }
+                else {
+                    cursor.moveTo(runningCursorIndex);
+                    cursor.recordErrorAt(runningCursorIndex, this._pattern);
+                    passed = false;
+                }
+                break;
+            }
+            else {
+                if (repeatedNode != null) {
+                    this._nodes.push(repeatedNode);
+                    if (!cursor.hasNext()) {
+                        passed = true;
+                        break;
+                    }
+                    cursor.next();
+                }
+                if (this._divider != null) {
+                    const dividerNode = this._divider.parse(cursor);
+                    if (cursor.hasError) {
+                        passed = true;
+                        break;
+                    }
+                    else if (dividerNode != null) {
+                        this._nodes.push(dividerNode);
+                        if (!cursor.hasNext()) {
+                            passed = true;
+                            break;
+                        }
+                        cursor.next();
+                    }
+                }
+            }
+        }
+        const hasMinimum = this._meetsMin();
+        if (hasMinimum) {
+            return passed;
+        }
+        else if (!hasMinimum && passed) {
+            cursor.recordErrorAt(cursor.index, this);
+            cursor.moveTo(this._firstIndex);
+            return false;
         }
-        else {
-            cursor.moveTo(firstIndex);
-            cursor.resolveError();
-            cursor.recordErrorAt(firstIndex, this);
+        return passed;
+    }
+    _createNode(cursor) {
+        const hasDivider = this._divider != null;
+        if (hasDivider &&
+            this._trimDivider &&
+            cursor.leafMatch.pattern === this._divider) {
+            const dividerNode = this._nodes.pop();
+            cursor.moveTo(dividerNode.firstIndex);
         }
-        return null;
+        const lastIndex = this._nodes[this._nodes.length - 1].lastIndex;
+        cursor.moveTo(lastIndex);
+        return new Node(this._type, this._name, this._firstIndex, lastIndex, this._nodes);
     }
-    clone(name = this._name) {
-        const not = new Not(name, this._children[0]);
-        return not;
+    _getLastValidNode() {
+        const nodes = this._nodes.filter((node) => node !== null);
+        if (nodes.length === 0) {
+            return null;
+        }
+        return nodes[nodes.length - 1];
     }
     getTokens() {
-        const parent = this._parent;
-        if (parent != null) {
-            return parent.getTokensAfter(this);
-        }
-        return [];
+        return this._pattern.getTokens();
     }
-    getTokensAfter(_childReference) {
-        const parent = this._parent;
-        if (parent != null) {
-            return parent.getTokensAfter(this);
-        }
-        return [];
+    getTokensAfter(childReference) {
+        const patterns = this.getPatternsAfter(childReference);
+        const tokens = [];
+        patterns.forEach(p => tokens.push(...p.getTokens()));
+        return tokens;
     }
     getNextTokens() {
-        if (this.parent == null) {
+        if (this._parent == null) {
             return [];
         }
-        return this.parent.getTokensAfter(this);
+        return this._parent.getTokensAfter(this);
     }
-    getPatternsAfter(_childReference) {
-        const parent = this._parent;
-        if (parent != null) {
-            return parent.getPatternsAfter(this);
+    getPatterns() {
+        return this._pattern.getPatterns();
+    }
+    getPatternsAfter(childReference) {
+        let index = -1;
+        const patterns = [];
+        for (let i = 0; i < this._children.length; i++) {
+            if (this._children[i] === childReference) {
+                index = i;
+            }
         }
-        return [];
+        // If the last match isn't a child of this pattern.
+        if (index === -1) {
+            return [];
+        }
+        // If the last match was the repeated patterns, then suggest the divider.
+        if (index === 0 && this._divider) {
+            patterns.push(this._children[1]);
+            if (this._parent) {
+                patterns.push(...this._parent.getPatternsAfter(this));
+            }
+        }
+        // Suggest the pattern because the divider was the last match.
+        if (index === 1) {
+            patterns.push(this._children[0]);
+        }
+        // If there is no divider then suggest the repeating pattern and the next pattern after.
+        if (index === 0 && !this._divider && this._parent) {
+            patterns.push(this._children[0]);
+            patterns.push(...this._parent.getPatternsAfter(this));
+        }
+        return patterns;
     }
     getNextPatterns() {
-        if (this.parent == null) {
+        if (this._parent == null) {
             return [];
         }
-        return this.parent.getPatternsAfter(this);
+        return this._parent.getPatternsAfter(this);
     }
-    findPattern(predicate) {
-        return predicate(this._children[0]) ? this._children[0] : null;
+    find(predicate) {
+        return findPattern(this, predicate);
+    }
+    clone(name = this._name, isOptional) {
+        let min = this._min;
+        if (isOptional != null) {
+            if (isOptional) {
+                min = 0;
+            }
+            else {
+                min = Math.max(this._min, 1);
+            }
+        }
+        return new InfiniteRepeat(name, this._pattern, {
+            divider: this._divider == null ? undefined : this._divider,
+            min: min,
+            trimDivider: this._trimDivider
+        });
     }
 }
 
-class Or {
+class Repeat {
+    constructor(name, pattern, options = {}) {
+        this._pattern = pattern;
+        this._parent = null;
+        this._options = Object.assign(Object.assign({}, options), { min: options.min == null ? 1 : options.min, max: options.max == null ? Infinity : options.max });
+        if (this._options.max != Infinity) {
+            this._repeatPattern = new FiniteRepeat(name, pattern, this._options.max, this._options);
+        }
+        else {
+            this._repeatPattern = new InfiniteRepeat(name, pattern, this._options);
+        }
+        this._children = [this._repeatPattern];
+        this._repeatPattern.parent = this;
+    }
     get type() {
-        return this._type;
+        return this._repeatPattern.type;
     }
     get name() {
-        return this._name;
+        return this._repeatPattern.name;
     }
     get parent() {
         return this._parent;
     }
-    set parent(pattern) {
-        this._parent = pattern;
+    set parent(value) {
+        this._parent = value;
     }
     get children() {
         return this._children;
     }
     get isOptional() {
-        return this._isOptional;
+        return this._repeatPattern.isOptional;
     }
-    constructor(name, options, isOptional = false) {
-        if (options.length === 0) {
-            throw new Error("Need at least one pattern with an 'or' pattern.");
-        }
-        const children = clonePatterns(options, false);
-        this._assignChildrenToParent(children);
-        this._type = "or";
-        this._name = name;
-        this._parent = null;
-        this._children = children;
-        this._isOptional = isOptional;
-        this._firstIndex = 0;
-    }
-    _assignChildrenToParent(children) {
-        for (const child of children) {
-            child.parent = this;
-        }
-    }
-    test(text) {
-        const cursor = new Cursor(text);
-        const ast = this.parse(cursor);
-        return (ast === null || ast === void 0 ? void 0 : ast.value) === text;
+    parse(cursor) {
+        return this._repeatPattern.parse(cursor);
     }
     exec(text) {
-        const cursor = new Cursor(text);
-        const ast = this.parse(cursor);
-        return {
-            ast: (ast === null || ast === void 0 ? void 0 : ast.value) === text ? ast : null,
-            cursor
-        };
+        return this._repeatPattern.exec(text);
     }
-    parse(cursor) {
-        this._firstIndex = cursor.index;
-        const node = this._tryToParse(cursor);
-        if (node != null) {
-            cursor.resolveError();
-            return node;
-        }
-        if (!this._isOptional) {
-            cursor.recordErrorAt(this._firstIndex, this);
-            return null;
-        }
-        cursor.resolveError();
-        cursor.moveTo(this._firstIndex);
-        return null;
+    test(text) {
+        return this._repeatPattern.test(text);
     }
-    _tryToParse(cursor) {
-        for (const pattern of this._children) {
-            cursor.moveTo(this._firstIndex);
-            const result = pattern.parse(cursor);
-            if (!cursor.hasError) {
-                return result;
+    clone(name = this.name, isOptional) {
+        let min = this._options.min;
+        if (isOptional != null) {
+            if (isOptional) {
+                min = 0;
+            }
+            else {
+                min = Math.max(this._options.min, 1);
             }
-            cursor.resolveError();
         }
-        return null;
+        return new Repeat(name, this._pattern, Object.assign(Object.assign({}, this._options), { min }));
     }
     getTokens() {
-        const tokens = [];
-        for (const child of this._children) {
-            tokens.push(...child.getTokens());
-        }
-        return tokens;
+        return this._repeatPattern.getTokens();
     }
     getTokensAfter(_childReference) {
-        if (this._parent === null) {
+        if (this._parent == null) {
             return [];
         }
         return this._parent.getTokensAfter(this);
@@ -1039,28 +1354,53 @@ class Or {
         }
         return this._parent.getTokensAfter(this);
     }
+    getPatterns() {
+        return this._repeatPattern.getPatterns();
+    }
     getPatternsAfter(_childReference) {
-        if (this._parent === null) {
+        if (this._parent == null) {
             return [];
         }
         return this._parent.getPatternsAfter(this);
     }
     getNextPatterns() {
-        if (this.parent == null) {
+        if (this._parent == null) {
             return [];
         }
-        return this.parent.getPatternsAfter(this);
+        return this._parent.getPatternsAfter(this);
     }
-    findPattern(predicate) {
-        return findPattern(this, predicate);
+    find(predicate) {
+        return this._repeatPattern.find(predicate);
     }
-    clone(name = this._name, isOptional = this._isOptional) {
-        const or = new Or(name, this._children, isOptional);
-        return or;
+}
+
+const comment = new Regex("comment", "#[^\r\n]+");
+
+function filterOutNull(nodes) {
+    const filteredNodes = [];
+    for (const node of nodes) {
+        if (node !== null) {
+            filteredNodes.push(node);
+        }
     }
+    return filteredNodes;
 }
 
-class Repeat {
+class And {
+    constructor(name, sequence, isOptional = false) {
+        if (sequence.length === 0) {
+            throw new Error("Need at least one pattern with an 'and' pattern.");
+        }
+        const children = clonePatterns(sequence);
+        this._assignChildrenToParent(children);
+        this._type = "and";
+        this._name = name;
+        this._isOptional = isOptional;
+        this._parent = null;
+        this._children = children;
+        this._firstIndex = -1;
+        this._nodes = [];
+    }
     get type() {
         return this._type;
     }
@@ -1079,20 +1419,6 @@ class Repeat {
     get isOptional() {
         return this._isOptional;
     }
-    constructor(name, pattern, divider, isOptional = false) {
-        const patterns = divider != null ? [pattern, divider] : [pattern];
-        const children = clonePatterns(patterns, false);
-        this._assignChildrenToParent(children);
-        this._type = "repeat";
-        this._name = name;
-        this._isOptional = isOptional;
-        this._parent = null;
-        this._children = children;
-        this._pattern = children[0];
-        this._divider = children[1];
-        this._firstIndex = -1;
-        this._nodes = [];
-    }
     _assignChildrenToParent(children) {
         for (const child of children) {
             child.parent = this;
@@ -1116,92 +1442,108 @@ class Repeat {
         this._nodes = [];
         const passed = this.tryToParse(cursor);
         if (passed) {
-            cursor.resolveError();
             const node = this.createNode(cursor);
-            if (node != null) {
+            if (node !== null) {
                 cursor.recordMatch(this, node);
             }
             return node;
         }
-        if (!this._isOptional) {
-            return null;
+        if (this._isOptional) {
+            cursor.resolveError();
         }
-        cursor.resolveError();
-        cursor.moveTo(this._firstIndex);
         return null;
     }
     tryToParse(cursor) {
         let passed = false;
-        while (true) {
+        for (let i = 0; i < this._children.length; i++) {
             const runningCursorIndex = cursor.index;
-            const repeatedNode = this._pattern.parse(cursor);
-            if (cursor.hasError) {
-                const lastValidNode = this.getLastValidNode();
-                if (lastValidNode != null) {
-                    passed = true;
-                }
-                else {
-                    cursor.moveTo(runningCursorIndex);
-                    cursor.recordErrorAt(runningCursorIndex, this._pattern);
-                    passed = false;
-                }
-                break;
-            }
-            else if (repeatedNode) {
-                this._nodes.push(repeatedNode);
-                if (!cursor.hasNext()) {
-                    passed = true;
-                    break;
-                }
-                cursor.next();
-                if (this._divider != null) {
-                    const dividerNode = this._divider.parse(cursor);
-                    if (cursor.hasError) {
-                        passed = true;
-                        break;
-                    }
-                    else if (dividerNode != null) {
-                        this._nodes.push(dividerNode);
-                        if (!cursor.hasNext()) {
-                            passed = true;
+            const nextPatternIndex = i + 1;
+            const hasMorePatterns = nextPatternIndex < this._children.length;
+            const node = this._children[i].parse(cursor);
+            const hasNoError = !cursor.hasError;
+            const hadMatch = node !== null;
+            if (hasNoError) {
+                this._nodes.push(node);
+                if (hasMorePatterns) {
+                    if (hadMatch) {
+                        if (cursor.hasNext()) {
+                            // We had a match. Increment the cursor and use the next pattern.
+                            cursor.next();
+                            continue;
+                        }
+                        else {
+                            // We are at the end of the text, it may still be valid, if all the
+                            // following patterns are optional.
+                            if (this.areRemainingPatternsOptional(i)) {
+                                passed = true;
+                                break;
+                            }
+                            // We didn't finish the parsing sequence.
+                            cursor.recordErrorAt(cursor.index + 1, this);
                             break;
                         }
-                        cursor.next();
+                    }
+                    else {
+                        // An optional pattern did not matched, try from the same spot on the next
+                        // pattern.
+                        cursor.moveTo(runningCursorIndex);
+                        continue;
                     }
                 }
-            }
-        }
-        return passed;
-    }
-    createNode(cursor) {
-        let children = [];
-        if (!this._divider) {
-            children = this._nodes;
-        }
-        else {
-            if (this._nodes.length % 2 !== 1) {
-                const dividerNode = this._nodes[this._nodes.length - 1];
-                cursor.moveTo(dividerNode.firstIndex);
-                children = this._nodes.slice(0, this._nodes.length - 1);
+                else {
+                    // If we don't have any results from what we parsed then record error.
+                    const lastNode = this.getLastValidNode();
+                    if (lastNode === null) {
+                        cursor.recordErrorAt(cursor.index, this);
+                        break;
+                    }
+                    // The sequence was parsed fully.
+                    passed = true;
+                    break;
+                }
             }
             else {
-                children = this._nodes;
+                // The pattern failed.
+                cursor.moveTo(this._firstIndex);
+                break;
             }
         }
-        const lastIndex = children[children.length - 1].lastIndex;
-        cursor.getChars(this._firstIndex, lastIndex);
-        cursor.moveTo(lastIndex);
-        return new Node("repeat", this._name, this._firstIndex, lastIndex, children, undefined);
+        return passed;
     }
     getLastValidNode() {
-        const nodes = this._nodes.filter((node) => node !== null);
+        const nodes = filterOutNull(this._nodes);
         if (nodes.length === 0) {
             return null;
         }
         return nodes[nodes.length - 1];
     }
+    areRemainingPatternsOptional(fromIndex) {
+        const startOnIndex = fromIndex + 1;
+        const length = this._children.length;
+        for (let i = startOnIndex; i < length; i++) {
+            const pattern = this._children[i];
+            if (!pattern.isOptional) {
+                return false;
+            }
+        }
+        return true;
+    }
+    createNode(cursor) {
+        const children = filterOutNull(this._nodes);
+        const lastIndex = children[children.length - 1].lastIndex;
+        cursor.getChars(this._firstIndex, lastIndex);
+        cursor.moveTo(lastIndex);
+        return new Node("and", this._name, this._firstIndex, lastIndex, children);
+    }
     getTokens() {
-        return this._pattern.getTokens();
+        const tokens = [];
+        for (const child of this._children) {
+            tokens.push(...child.getTokens());
+            if (!child.isOptional) {
+                break;
+            }
+        }
+        return tokens;
     }
     getTokensAfter(childReference) {
         const patterns = this.getPatternsAfter(childReference);
@@ -1215,33 +1557,50 @@ class Repeat {
         }
         return this.parent.getTokensAfter(this);
     }
+    getPatterns() {
+        const patterns = [];
+        for (const pattern of this._children) {
+            patterns.push(...pattern.getPatterns());
+            if (!pattern.isOptional) {
+                break;
+            }
+        }
+        return patterns;
+    }
     getPatternsAfter(childReference) {
-        let index = -1;
         const patterns = [];
+        let nextSiblingIndex = -1;
+        let index = -1;
         for (let i = 0; i < this._children.length; i++) {
             if (this._children[i] === childReference) {
+                if (i + 1 < this._children.length) {
+                    this._children[i + 1];
+                }
+                nextSiblingIndex = i + 1;
                 index = i;
+                break;
             }
         }
-        // If the last match isn't a child of this pattern.
+        // The child reference isn't one of the child patterns.
         if (index === -1) {
             return [];
         }
-        // If the last match was the repeated patterns, then suggest the divider.
-        if (index === 0 && this._divider) {
-            patterns.push(this._children[1]);
-            if (this._parent) {
+        // The reference pattern is the last child. So ask the parent for the next pattern.
+        if (nextSiblingIndex === this._children.length && this._parent !== null) {
+            return this._parent.getPatternsAfter(this);
+        }
+        // Send back as many optional patterns as possible.
+        for (let i = nextSiblingIndex; i < this._children.length; i++) {
+            const child = this._children[i];
+            patterns.push(child);
+            if (!child.isOptional) {
+                break;
+            }
+            // If we are on the last child and its options then ask for the next pattern from the parent.
+            if (i === this._children.length - 1 && this._parent !== null) {
                 patterns.push(...this._parent.getPatternsAfter(this));
             }
         }
-        // Suggest the pattern because the divider was the last match.
-        if (index === 1) {
-            patterns.push(this._children[0]);
-        }
-        if (index === 0 && !this._divider && this._parent) {
-            patterns.push(this._children[0]);
-            patterns.push(...this._parent.getPatternsAfter(this));
-        }
         return patterns;
     }
     getNextPatterns() {
@@ -1250,15 +1609,138 @@ class Repeat {
         }
         return this.parent.getPatternsAfter(this);
     }
-    findPattern(predicate) {
+    find(predicate) {
         return findPattern(this, predicate);
     }
     clone(name = this._name, isOptional = this._isOptional) {
-        return new Repeat(name, this._pattern, this._divider, isOptional);
+        return new And(name, this._children, isOptional);
     }
 }
 
-class Reference {
+const name = new Regex("name", "[a-zA-Z_-]+[a-zA-Z0-9_-]*");
+
+const optionalNot = new Literal("not", "!", true);
+const optionalIsOptional$1 = new Literal("is-optional", "?", true);
+const patternName$1 = name.clone("pattern-name");
+const pattern$1 = new And("pattern", [
+    optionalNot,
+    patternName$1,
+    optionalIsOptional$1,
+]);
+
+const divider$1 = new Regex("and-divider", "\\s*[&]\\s*");
+divider$1.setTokens([" & "]);
+const andLiteral = new Repeat("and-literal", pattern$1, { divider: divider$1, min: 2 });
+
+const divider = new Regex("or-divider", "\\s*[|]\\s*");
+divider.setTokens([" | "]);
+const orLiteral = new Repeat("or-literal", name.clone("pattern-name"), { divider, min: 2 });
+
+const regexLiteral = new Regex("regex-literal", "/(\\\\/|[^/\\n\\r])*/");
+
+const spaces = new Regex("spaces", "[ \\t]+");
+spaces.setTokens([" "]);
+
+const optionalIsOptional = new Literal("is-optional", "?", true);
+const patternName = name.clone("pattern-name");
+const pattern = new And("pattern", [
+    patternName,
+    optionalIsOptional,
+]);
+const optionalSpaces$1 = spaces.clone("optional-spaces", true);
+const dividerPattern = name.clone("divider-pattern");
+const openBracket = new Literal("open-bracket", "{");
+const closeBracket = new Literal("close-bracket", "}");
+const comma = new Literal("comma", ",");
+const integer = new Regex("integer", "([1-9][0-9]*)|0");
+integer.setTokens(["0", "1", "2", "3", "4", "5", "6", "7", "8", "9"]);
+const optionalInteger = integer.clone("integer", true);
+const bounds = new And("bounds", [
+    openBracket,
+    optionalSpaces$1,
+    optionalInteger.clone("min"),
+    optionalSpaces$1,
+    comma,
+    optionalSpaces$1,
+    optionalInteger.clone("max"),
+    optionalSpaces$1,
+    closeBracket
+]);
+const exactCount = new And("exact-count", [
+    openBracket,
+    optionalSpaces$1,
+    integer,
+    optionalSpaces$1,
+    closeBracket,
+]);
+const quantifierShorthand = new Regex("quantifier-shorthand", "\\*|\\+");
+quantifierShorthand.setTokens(["*", "+"]);
+const quantifier = new Or("quantifier", [
+    quantifierShorthand,
+    exactCount,
+    bounds
+]);
+const optional = new Literal("is-optional", "?", true);
+const trimDivider = new Literal("trim-divider", "-t");
+const openParen = new Literal("open-paren", "(");
+const closeParen = new Literal("close-paren", ")");
+const dividerComma = new Regex("divider-comma", "\\s*,\\s*");
+dividerComma.setTokens([", "]);
+const repeatLiteral = new And("repeat-literal", [
+    openParen,
+    optionalSpaces$1,
+    pattern,
+    optional,
+    new And("optional-divider-section", [dividerComma, dividerPattern], true),
+    optionalSpaces$1,
+    closeParen,
+    new And("quantifier-section", [optionalSpaces$1, quantifier]),
+    new And("optional-trim-divider-section", [spaces, trimDivider], true)
+]);
+
+const literal = new Regex("literal", "\"(?:\\\\[\"\\\\]|[^\n\"\\\\])*\"");
+
+const optionalSpaces = spaces.clone("optional-spaces", true);
+const assignOperator = new Literal("assign-operator", "=");
+const optionalComment = comment.clone("inline-comment", true);
+const statements = new Or("statements", [
+    literal,
+    regexLiteral,
+    orLiteral,
+    andLiteral,
+    repeatLiteral,
+]);
+const statement = new And("statement", [
+    optionalSpaces,
+    name,
+    optionalSpaces,
+    assignOperator,
+    optionalSpaces,
+    statements,
+    optionalSpaces,
+    optionalComment,
+    optionalSpaces,
+]);
+
+const whitespace = new Regex("whitespace", "[ \\t]+");
+const newLine = new Regex("new-line", "(\\r?\\n)+");
+whitespace.setTokens([" "]);
+newLine.setTokens(["\n"]);
+const line = new Or("line", [
+    comment,
+    statement,
+    whitespace
+], true);
+const grammar = new Repeat("grammar", line, { divider: newLine });
+
+class Not {
+    constructor(name, pattern) {
+        this._type = "not";
+        this._name = name;
+        this._parent = null;
+        this._children = [pattern.clone(pattern.name, false)];
+        this._children[0].parent = this;
+    }
     get type() {
         return this._type;
     }
@@ -1275,72 +1757,52 @@ class Reference {
         return this._children;
     }
     get isOptional() {
-        return this._isOptional;
-    }
-    constructor(name, isOptional = false) {
-        this._type = "reference";
-        this._name = name;
-        this._parent = null;
-        this._isOptional = isOptional;
-        this._pattern = null;
-        this._children = [];
+        return false;
     }
     test(text) {
         const cursor = new Cursor(text);
-        const ast = this.parse(cursor);
-        return (ast === null || ast === void 0 ? void 0 : ast.value) === text;
+        this.parse(cursor);
+        return !cursor.hasError;
     }
     exec(text) {
         const cursor = new Cursor(text);
         const ast = this.parse(cursor);
         return {
-            ast: (ast === null || ast === void 0 ? void 0 : ast.value) === text ? ast : null,
+            ast,
             cursor
         };
     }
     parse(cursor) {
-        return this._getPatternSafely().parse(cursor);
-    }
-    _getPatternSafely() {
-        if (this._pattern === null) {
-            const pattern = this._findPattern();
-            if (pattern === null) {
-                throw new Error(`Couldn't find '${this._name}' pattern within tree.`);
-            }
-            const clonedPattern = pattern.clone(this._name, this._isOptional);
-            clonedPattern.parent = this;
-            this._pattern = clonedPattern;
-            this._children = [this._pattern];
+        const firstIndex = cursor.index;
+        this._children[0].parse(cursor);
+        if (cursor.hasError) {
+            cursor.resolveError();
+            cursor.moveTo(firstIndex);
         }
-        return this._pattern;
-    }
-    _findPattern() {
-        const root = this._getRoot();
-        return findPattern(root, (pattern) => {
-            return pattern.name === this._name && pattern.type !== "reference";
-        });
-    }
-    _getRoot() {
-        let node = this;
-        while (true) {
-            const parent = node.parent;
-            if (parent == null) {
-                break;
-            }
-            else {
-                node = parent;
-            }
+        else {
+            cursor.moveTo(firstIndex);
+            cursor.resolveError();
+            cursor.recordErrorAt(firstIndex, this);
         }
-        return node;
+        return null;
+    }
+    clone(name = this._name) {
+        const not = new Not(name, this._children[0]);
+        return not;
     }
     getTokens() {
-        return this._getPatternSafely().getTokens();
+        const parent = this._parent;
+        if (parent != null) {
+            return parent.getTokensAfter(this);
+        }
+        return [];
     }
-    getTokensAfter(_lastMatched) {
-        if (this._parent == null) {
-            return [];
+    getTokensAfter(_childReference) {
+        const parent = this._parent;
+        if (parent != null) {
+            return parent.getTokensAfter(this);
         }
-        return this._parent.getTokensAfter(this);
+        return [];
     }
     getNextTokens() {
         if (this.parent == null) {
@@ -1348,11 +1810,15 @@ class Reference {
         }
         return this.parent.getTokensAfter(this);
     }
+    getPatterns() {
+        return [...this.getNextPatterns().map(p => p.getPatterns()).flat()];
+    }
     getPatternsAfter(_childReference) {
-        if (this._parent == null) {
-            return [];
+        const parent = this._parent;
+        if (parent != null) {
+            return parent.getPatternsAfter(this);
         }
-        return this._parent.getPatternsAfter(this);
+        return [];
     }
     getNextPatterns() {
         if (this.parent == null) {
@@ -1360,11 +1826,8 @@ class Reference {
         }
         return this.parent.getPatternsAfter(this);
     }
-    findPattern(_predicate) {
-        return null;
-    }
-    clone(name = this._name, isOptional = this._isOptional) {
-        return new Reference(name, isOptional);
+    find(predicate) {
+        return predicate(this._children[0]) ? this._children[0] : null;
     }
 }
 
@@ -1375,72 +1838,73 @@ class AutoComplete {
         this._options = options;
         this._text = "";
     }
-    suggest(text) {
+    suggestFor(text) {
         if (text.length === 0) {
             return {
                 isComplete: false,
-                options: this.createSuggestionsFromRoot(),
-                nextPatterns: [this._pattern],
+                options: this._createSuggestionsFromRoot(),
+                errorAtIndex: 0,
                 cursor: null,
                 ast: null
             };
         }
         this._text = text;
         this._cursor = new Cursor(text);
+        let errorAtIndex = null;
         const ast = this._pattern.parse(this._cursor);
-        const leafPattern = this._cursor.leafMatch.pattern;
         const isComplete = (ast === null || ast === void 0 ? void 0 : ast.value) === text;
-        const options = this.createSuggestionsFromTokens();
-        let nextPatterns = [this._pattern];
-        if (leafPattern != null) {
-            nextPatterns = leafPattern.getNextPatterns();
+        const options = this._getAllOptions();
+        if (this._cursor.hasError && this._cursor.furthestError != null) {
+            errorAtIndex = this._cursor.furthestError.index;
+            errorAtIndex = options.reduce((errorAtIndex, option) => Math.max(errorAtIndex, option.startIndex), errorAtIndex);
         }
         return {
             isComplete: isComplete,
             options: options,
-            nextPatterns,
+            errorAtIndex,
             cursor: this._cursor,
             ast,
         };
     }
-    createSuggestionsFromRoot() {
+    _getAllOptions() {
+        return this._cursor.leafMatches.map((m) => this._createSuggestionsFromMatch(m)).flat();
+    }
+    _createSuggestionsFromRoot() {
         const suggestions = [];
         const tokens = this._pattern.getTokens();
         for (const token of tokens) {
-            suggestions.push(this.createSuggestion("", token));
+            suggestions.push(this._createSuggestion("", token));
         }
         return suggestions;
     }
-    createSuggestionsFromTokens() {
-        const leafMatch = this._cursor.leafMatch;
-        if (!leafMatch.pattern) {
-            return this.createSuggestions(-1, this._getTokensForPattern(this._pattern));
+    _createSuggestionsFromMatch(match) {
+        if (!match.pattern) {
+            return this._createSuggestions(-1, this._getTokensForPattern(this._pattern));
         }
-        const leafPattern = leafMatch.pattern;
-        leafMatch.node;
-        const parent = leafMatch.pattern.parent;
-        if (parent !== null && leafMatch.node != null) {
+        const leafPattern = match.pattern;
+        const parent = match.pattern.parent;
+        if (parent !== null && match.node != null) {
             const patterns = leafPattern.getNextPatterns();
             const tokens = patterns.reduce((acc, pattern) => {
                 acc.push(...this._getTokensForPattern(pattern));
                 return acc;
             }, []);
-            return this.createSuggestions(leafMatch.node.lastIndex, tokens);
+            return this._createSuggestions(match.node.lastIndex, tokens);
         }
         else {
             return [];
         }
     }
     _getTokensForPattern(pattern) {
-        if (this._options.greedyPatternNames.includes(pattern.name)) {
-            const greedyTokens = pattern.getTokens();
+        const augmentedTokens = this._getAugmentedTokens(pattern);
+        if (this._options.greedyPatternNames != null && this._options.greedyPatternNames.includes(pattern.name)) {
             const nextPatterns = pattern.getNextPatterns();
             const tokens = [];
             const nextPatternTokens = nextPatterns.reduce((acc, pattern) => {
                 acc.push(...this._getTokensForPattern(pattern));
                 return acc;
             }, []);
-            for (let token of greedyTokens) {
+            for (let token of augmentedTokens) {
                 for (let nextPatternToken of nextPatternTokens) {
                     tokens.push(token + nextPatternToken);
                 }
@@ -1448,13 +1912,20 @@ class AutoComplete {
             return tokens;
         }
         else {
-            const tokens = pattern.getTokens();
-            const customTokens = this._options.customTokens[pattern.name] || [];
-            tokens.push(...customTokens);
-            return tokens;
+            return augmentedTokens;
         }
     }
-    createSuggestions(lastIndex, tokens) {
+    _getAugmentedTokens(pattern) {
+        const customTokensMap = this._options.customTokens || {};
+        const leafPatterns = pattern.getPatterns();
+        const tokens = customTokensMap[pattern.name] || [];
+        leafPatterns.forEach(p => {
+            const augmentedTokens = customTokensMap[p.name] || [];
+            tokens.push(...p.getTokens(), ...augmentedTokens);
+        });
+        return tokens;
+    }
+    _createSuggestions(lastIndex, tokens) {
         let substring = lastIndex === -1 ? "" : this._cursor.getChars(0, lastIndex);
         const suggestionStrings = [];
         const options = [];
@@ -1465,14 +1936,14 @@ class AutoComplete {
             const isSameAsText = suggestion === this._text;
             if (startsWith && !alreadyExist && !isSameAsText) {
                 suggestionStrings.push(suggestion);
-                options.push(this.createSuggestion(this._cursor.text, suggestion));
+                options.push(this._createSuggestion(this._cursor.text, suggestion));
             }
         }
         const reducedOptions = getFurthestOptions(options);
         reducedOptions.sort((a, b) => a.text.localeCompare(b.text));
         return reducedOptions;
     }
-    createSuggestion(fullText, suggestion) {
+    _createSuggestion(fullText, suggestion) {
         const furthestMatch = findMatchIndex(suggestion, fullText);
         const text = suggestion.slice(furthestMatch);
         return {
@@ -1512,10 +1983,194 @@ function getFurthestOptions(options) {
     return furthestOptions;
 }
 
+class ParseContext {
+    constructor() {
+        this.patternsByName = new Map();
+    }
+}
+class Grammar {
+    constructor() {
+        this._parseContext = new ParseContext();
+        this._autoComplete = new AutoComplete(grammar, {
+            greedyPatternNames: ["spaces", "optional-spaces", "whitespace", "new-line"],
+            customTokens: {
+                "regex-literal": ["[Regular Expression]"],
+                "literal": ["[String]"],
+                "name": ["[Pattern Name]"],
+                "pattern-name": ["[Pattern Name]"]
+            }
+        });
+    }
+    parse(expression) {
+        this._parseContext = new ParseContext();
+        this._tryToParse(expression);
+        return this._parseContext.patternsByName;
+    }
+    _tryToParse(expression) {
+        const { ast, cursor, options, isComplete } = this._autoComplete.suggestFor(expression);
+        if (!isComplete) {
+            const text = (cursor === null || cursor === void 0 ? void 0 : cursor.text) || "";
+            const index = options.reduce((num, o) => Math.max(o.startIndex, num), 0);
+            const foundText = text.slice(Math.max(index - 10, 0), index + 10);
+            const expectedTexts = "'" + options.map(o => {
+                const startText = text.slice(Math.max(o.startIndex - 10), o.startIndex);
+                return startText + o.text;
+            }).join("' or '") + "'";
+            const message = `[Parse Error] Found: '${foundText}', expected: ${expectedTexts}.`;
+            throw new Error(message);
+        }
+        // If it is complete it will always have a node. So we have to cast it.
+        this._cleanAst(ast);
+        this._buildPatterns(ast);
+    }
+    _cleanAst(ast) {
+        ast.findAll(n => n.name === "spaces" ||
+            n.name === "optional-spaces" ||
+            n.name === "new-line" ||
+            n.name.includes("whitespace") ||
+            n.name.includes("comment")).forEach(n => n.remove());
+    }
+    _buildPatterns(ast) {
+        ast.children.forEach((n) => {
+            const typeNode = n.find(n => n.name.includes("literal"));
+            const type = (typeNode === null || typeNode === void 0 ? void 0 : typeNode.name) || "unknown";
+            switch (type) {
+                case "literal": {
+                    this._buildLiteral(n);
+                    break;
+                }
+                case "regex-literal": {
+                    this._buildRegex(n);
+                    break;
+                }
+                case "or-literal": {
+                    this._buildOr(n);
+                    break;
+                }
+                case "and-literal": {
+                    this._buildAnd(n);
+                    break;
+                }
+                case "repeat-literal": {
+                    this._buildRepeat(n);
+                    break;
+                }
+            }
+        });
+    }
+    _buildLiteral(statementNode) {
+        const nameNode = statementNode.find(n => n.name === "name");
+        const literalNode = statementNode.find(n => n.name === "literal");
+        const value = literalNode.value.slice(1, literalNode.value.length - 1);
+        const name = nameNode.value;
+        const literal = new Literal(name, value);
+        this._parseContext.patternsByName.set(name, literal);
+    }
+    _buildRegex(statementNode) {
+        const nameNode = statementNode.find(n => n.name === "name");
+        const regexNode = statementNode.find(n => n.name === "regex-literal");
+        const value = regexNode.value.slice(1, regexNode.value.length - 1);
+        const name = nameNode.value;
+        const regex = new Regex(name, value);
+        this._parseContext.patternsByName.set(name, regex);
+    }
+    _buildOr(statementNode) {
+        const nameNode = statementNode.find(n => n.name === "name");
+        const orNode = statementNode.find(n => n.name === "or-literal");
+        const patternNodes = orNode.children.filter(n => n.name == "pattern-name");
+        const name = nameNode.value;
+        const patterns = patternNodes.map(n => this._getPattern(n.value));
+        const or = new Or(name, patterns);
+        this._parseContext.patternsByName.set(name, or);
+    }
+    _getPattern(name) {
+        const pattern = this._parseContext.patternsByName.get(name);
+        if (pattern == null) {
+            return new Reference(name);
+        }
+        return pattern;
+    }
+    _buildAnd(statementNode) {
+        const nameNode = statementNode.find(n => n.name === "name");
+        const andNode = statementNode.find(n => n.name === "and-literal");
+        const patternNodes = andNode.children.filter(n => n.name == "pattern");
+        const name = nameNode.value;
+        const patterns = patternNodes.map(n => {
+            const nameNode = n.find(n => n.name === "pattern-name");
+            const isNot = n.find(n => n.name === "not") != null;
+            const isOptional = n.find(n => n.name === "is-optional") != null;
+            const name = nameNode.value;
+            const pattern = this._getPattern(name);
+            if (isNot) {
+                return new Not(`not-${name}`, pattern.clone(name, isOptional));
+            }
+            return pattern.clone(name, isOptional);
+        });
+        const and = new And(name, patterns);
+        this._parseContext.patternsByName.set(name, and);
+    }
+    _buildRepeat(statementNode) {
+        const nameNode = statementNode.find(n => n.name === "name");
+        const repeatNode = statementNode.find(n => n.name === "repeat-literal");
+        const patternNode = repeatNode.find(n => n.name == "pattern");
+        const patternNameNode = patternNode.find(n => n.name === "pattern-name");
+        const dividerNode = repeatNode.find(n => n.name === "divider-pattern");
+        const bounds = repeatNode.find(n => n.name === "bounds");
+        const exactCount = repeatNode.find(n => n.name === "exact-count");
+        const quantifier = repeatNode.find(n => n.name === "quantifier-shorthand");
+        const isPatternOptional = repeatNode.find(n => n.name === "is-optional") != null;
+        const trimDivider = repeatNode.find(n => n.name === "trim-divider") != null;
+        const name = nameNode.value;
+        const pattern = this._getPattern(patternNameNode.value);
+        const options = {
+            min: 1,
+            max: Infinity
+        };
+        if (trimDivider) {
+            options.trimDivider = trimDivider;
+        }
+        if (dividerNode != null) {
+            options.divider = this._getPattern(dividerNode.value);
+        }
+        if (bounds != null) {
+            const minNode = bounds.find(p => p.name === "min");
+            const maxNode = bounds.find(p => p.name === "max");
+            const min = minNode == null ? 0 : Number(minNode.value);
+            const max = maxNode == null ? Infinity : Number(maxNode.value);
+            options.min = min;
+            options.max = max;
+        }
+        else if (exactCount != null) {
+            const integerNode = exactCount.find(p => p.name === "integer");
+            const integer = Number(integerNode.value);
+            options.min = integer;
+            options.max = integer;
+        }
+        else if (quantifier != null) {
+            const type = quantifier.value;
+            if (type === "+") {
+                options.min = 1;
+                options.max = Infinity;
+            }
+            else {
+                options.min = 0;
+                options.max = Infinity;
+            }
+        }
+        const repeat = new Repeat(name, pattern.clone(pattern.name, isPatternOptional), options);
+        this._parseContext.patternsByName.set(name, repeat);
+    }
+    static parse(expression) {
+        const grammar = new Grammar();
+        return grammar.parse(expression);
+    }
+}
+
 exports.And = And;
 exports.AutoComplete = AutoComplete;
 exports.Cursor = Cursor;
 exports.CursorHistory = CursorHistory;
+exports.Grammar = Grammar;
 exports.Literal = Literal;
 exports.Node = Node;
 exports.Not = Not;