clarity-pattern-parser 3.0.16 → 4.0.1

package/dist/patterns/value/RepeatValue.d.ts

@@ -1,19 +0,0 @@
-import ValuePattern from "./ValuePattern";
-import ValueNode from "../../ast/ValueNode";
-import Cursor from "../../Cursor";
-export default class RepeatValue extends ValuePattern {
-    _pattern: ValuePattern;
-    _divider: ValuePattern;
-    nodes: ValueNode[];
-    cursor: Cursor;
-    mark: number;
-    node: ValueNode | null;
-    constructor(name: string, pattern: ValuePattern, divider?: ValuePattern);
-    private _assertArguments;
-    private _reset;
-    parse(cursor: Cursor): ValueNode | null;
-    private _tryPattern;
-    private _processMatch;
-    clone(name?: string): RepeatValue;
-    getTokens(): string[];
-}

package/dist/patterns/value/RepeatValue.js

@@ -1,89 +0,0 @@
-import ValuePattern from "./ValuePattern";
-import ValueNode from "../../ast/ValueNode";
-import ParseError from "../ParseError";
-import OptionalValue from "./OptionalValue";
-export default class RepeatValue extends ValuePattern {
-    constructor(name, pattern, divider) {
-        super("repeat-value", name, divider != null ? [pattern, divider] : [pattern]);
-        this.nodes = [];
-        this.mark = 0;
-        this.node = null;
-        this._pattern = this.children[0];
-        this._divider = this.children[1];
-        this._assertArguments();
-    }
-    _assertArguments() {
-        if (this._pattern instanceof OptionalValue) {
-            throw new Error("Invalid Arguments: The pattern cannot be a optional pattern.");
-        }
-    }
-    _reset(cursor) {
-        this.nodes = [];
-        this.cursor = cursor;
-        this.mark = this.cursor.mark();
-    }
-    parse(cursor) {
-        this._reset(cursor);
-        this._tryPattern();
-        return this.node;
-    }
-    _tryPattern() {
-        while (true) {
-            const node = this._pattern.parse(this.cursor);
-            if (this.cursor.hasUnresolvedError()) {
-                this._processMatch();
-                break;
-            }
-            else {
-                this.nodes.push(node);
-                if (node.endIndex === this.cursor.lastIndex()) {
-                    this._processMatch();
-                    break;
-                }
-                this.cursor.next();
-                if (this._divider != null) {
-                    const mark = this.cursor.mark();
-                    const node = this._divider.parse(this.cursor);
-                    if (this.cursor.hasUnresolvedError()) {
-                        this.cursor.moveToMark(mark);
-                        this._processMatch();
-                        break;
-                    }
-                    else {
-                        this.nodes.push(node);
-                        if (node.endIndex === this.cursor.lastIndex()) {
-                            this._processMatch();
-                            break;
-                        }
-                        this.cursor.next();
-                    }
-                }
-            }
-        }
-    }
-    _processMatch() {
-        const endsOnDivider = this.nodes.length % 2 === 0;
-        this.cursor.resolveError();
-        if (endsOnDivider) {
-            const parseError = new ParseError(`Did not find a repeating match of ${this.name}.`, this.mark, this);
-            this.cursor.throwError(parseError);
-            this.node = null;
-        }
-        else {
-            const value = this.nodes.map((node) => node.value).join("");
-            this.node = new ValueNode("repeat-value", this.name, value, this.nodes[0].startIndex, this.nodes[this.nodes.length - 1].endIndex);
-            this.cursor.index = this.node.endIndex;
-            this.cursor.addMatch(this, this.node);
-        }
-    }
-    clone(name) {
-        if (typeof name !== "string") {
-            name = this.name;
-        }
-        return new RepeatValue(name, this._pattern, this._divider);
-    }
-    getTokens() {
-        return this._pattern.getTokens();
-    }
-}
-//# sourceMappingURL=RepeatValue.js.map

package/dist/patterns/value/RepeatValue.js.map

@@ -1 +0,0 @@
-{"version":3,"file":"RepeatValue.js","sourceRoot":"","sources":["../../../src/patterns/value/RepeatValue.ts"],"names":[],"mappings":"AAAA,OAAO,YAAY,MAAM,gBAAgB,CAAC;AAC1C,OAAO,SAAS,MAAM,qBAAqB,CAAC;AAC5C,OAAO,UAAU,MAAM,eAAe,CAAC;AACvC,OAAO,aAAa,MAAM,iBAAiB,CAAC;AAI5C,MAAM,CAAC,OAAO,OAAO,WAAY,SAAQ,YAAY;IAQnD,YAAY,IAAY,EAAE,OAAqB,EAAE,OAAsB;QACrE,KAAK,CACH,cAAc,EACd,IAAI,EACJ,OAAO,IAAI,IAAI,CAAC,CAAC,CAAC,CAAC,OAAO,EAAE,OAAO,CAAC,CAAC,CAAC,CAAC,CAAC,OAAO,CAAC,CACjD,CAAC;QAVG,UAAK,GAAgB,EAAE,CAAC;QAExB,SAAI,GAAW,CAAC,CAAC;QACjB,SAAI,GAAqB,IAAI,CAAC;QASnC,IAAI,CAAC,QAAQ,GAAG,IAAI,CAAC,QAAQ,CAAC,CAAC,CAAiB,CAAC;QACjD,IAAI,CAAC,QAAQ,GAAG,IAAI,CAAC,QAAQ,CAAC,CAAC,CAAiB,CAAC;QAEjD,IAAI,CAAC,gBAAgB,EAAE,CAAC;IAC1B,CAAC;IAEO,gBAAgB;QACtB,IAAI,IAAI,CAAC,QAAQ,YAAY,aAAa,EAAE;YAC1C,MAAM,IAAI,KAAK,CACb,8DAA8D,CAC/D,CAAC;SACH;IACH,CAAC;IAEO,MAAM,CAAC,MAAc;QAC3B,IAAI,CAAC,KAAK,GAAG,EAAE,CAAC;QAChB,IAAI,CAAC,MAAM,GAAG,MAAM,CAAC;QACrB,IAAI,CAAC,IAAI,GAAG,IAAI,CAAC,MAAM,CAAC,IAAI,EAAE,CAAC;IACjC,CAAC;IAED,KAAK,CAAC,MAAc;QAClB,IAAI,CAAC,MAAM,CAAC,MAAM,CAAC,CAAC;QACpB,IAAI,CAAC,WAAW,EAAE,CAAC;QAEnB,OAAO,IAAI,CAAC,IAAI,CAAC;IACnB,CAAC;IAEO,WAAW;QACjB,OAAO,IAAI,EAAE;YACX,MAAM,IAAI,GAAG,IAAI,CAAC,QAAQ,CAAC,KAAK,CAAC,IAAI,CAAC,MAAM,CAAc,CAAC;YAE3D,IAAI,IAAI,CAAC,MAAM,CAAC,kBAAkB,EAAE,EAAE;gBACpC,IAAI,CAAC,aAAa,EAAE,CAAC;gBACrB,MAAM;aACP;iBAAM;gBACL,IAAI,CAAC,KAAK,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC;gBAEtB,IAAI,IAAI,CAAC,QAAQ,KAAK,IAAI,CAAC,MAAM,CAAC,SAAS,EAAE,EAAE;oBAC7C,IAAI,CAAC,aAAa,EAAE,CAAC;oBACrB,MAAM;iBACP;gBAED,IAAI,CAAC,MAAM,CAAC,IAAI,EAAE,CAAC;gBAEnB,IAAI,IAAI,CAAC,QAAQ,IAAI,IAAI,EAAE;oBACzB,MAAM,IAAI,GAAG,IAAI,CAAC,MAAM,CAAC,IAAI,EAAE,CAAC;oBAChC,MAAM,IAAI,GAAG,IAAI,CAAC,QAAQ,CAAC,KAAK,CAAC,IAAI,CAAC,MAAM,CAAc,CAAC;oBAE3D,IAAI,IAAI,CAAC,MAAM,CAAC,kBAAkB,EAAE,EAAE;wBACpC,IAAI,CAAC,MAAM,CAAC,UAAU,CAAC,IAAI,CAAC,CAAC;wBAC7B,IAAI,CAAC,aAAa,EAAE,CAAC;wBACrB,MAAM;qBACP;yBAAM;wBACL,IAAI,CAAC,KAAK,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC;wBAEtB,IAAI,IAAI,CAAC,QAAQ,KAAK,IAAI,CAAC,MAAM,CAAC,SAAS,EAAE,EAAE;4BAC7C,IAAI,CAAC,aAAa,EAAE,CAAC;4BACrB,MAAM;yBACP;wBAED,IAAI,CAAC,MAAM,CAAC,IAAI,EAAE,CAAC;qBACpB;iBACF;aACF;SACF;IACH,CAAC;IAEO,aAAa;QACnB,MAAM,aAAa,GAAG,IAAI,CAAC,KAAK,CAAC,MAAM,GAAG,CAAC,KAAK,CAAC,CAAC;QAClD,IAAI,CAAC,MAAM,CAAC,YAAY,EAAE,CAAC;QAE3B,IAAI,aAAa,EAAE;YACjB,MAAM,UAAU,GAAG,IAAI,UAAU,CAC/B,qCAAqC,IAAI,CAAC,IAAI,GAAG,EACjD,IAAI,CAAC,IAAI,EACT,IAAI,CACL,CAAC;YACF,IAAI,CAAC,MAAM,CAAC,UAAU,CAAC,UAAU,CAAC,CAAC;YACnC,IAAI,CAAC,IAAI,GAAG,IAAI,CAAC;SAClB;aAAM;YACL,MAAM,KAAK,GAAG,IAAI,CAAC,KAAK,CAAC,GAAG,CAAC,CAAC,IAAI,EAAE,EAAE,CAAC,IAAI,CAAC,KAAK,CAAC,CAAC,IAAI,CAAC,EAAE,CAAC,CAAC;YAE5D,IAAI,CAAC,IAAI,GAAG,IAAI,SAAS,CACvB,cAAc,EACd,IAAI,CAAC,IAAI,EACT,KAAK,EACL,IAAI,CAAC,KAAK,CAAC,CAAC,CAAC,CAAC,UAAU,EACxB,IAAI,CAAC,KAAK,CAAC,IAAI,CAAC,KAAK,CAAC,MAAM,GAAG,CAAC,CAAC,CAAC,QAAQ,CAC3C,CAAC;YAEF,IAAI,CAAC,MAAM,CAAC,KAAK,GAAG,IAAI,CAAC,IAAI,CAAC,QAAQ,CAAC;YACvC,IAAI,CAAC,MAAM,CAAC,QAAQ,CAAC,IAAI,EAAE,IAAI,CAAC,IAAI,CAAC,CAAC;SACvC;IACH,CAAC;IAED,KAAK,CAAC,IAAa;QACjB,IAAI,OAAO,IAAI,KAAK,QAAQ,EAAE;YAC5B,IAAI,GAAG,IAAI,CAAC,IAAI,CAAC;SAClB;QACD,OAAO,IAAI,WAAW,CAAC,IAAI,EAAE,IAAI,CAAC,QAAQ,EAAE,IAAI,CAAC,QAAQ,CAAC,CAAC;IAC7D,CAAC;IAED,SAAS;QACP,OAAO,IAAI,CAAC,QAAQ,CAAC,SAAS,EAAE,CAAC;IACnC,CAAC;CACF"}

package/dist/patterns/value/ValuePattern.d.ts

@@ -1,5 +0,0 @@
-import Pattern from "../Pattern";
-export default abstract class ValuePattern extends Pattern {
-    constructor(type: string, name: string, children?: ValuePattern[]);
-    abstract clone(name?: string): ValuePattern;
-}

package/dist/patterns/value/ValuePattern.js

@@ -1,7 +0,0 @@
-import Pattern from "../Pattern";
-export default class ValuePattern extends Pattern {
-    constructor(type, name, children = []) {
-        super(type, name, children);
-    }
-}
-//# sourceMappingURL=ValuePattern.js.map

package/dist/patterns/value/ValuePattern.js.map

@@ -1 +0,0 @@
-{"version":3,"file":"ValuePattern.js","sourceRoot":"","sources":["../../../src/patterns/value/ValuePattern.ts"],"names":[],"mappings":"AAAA,OAAO,OAAO,MAAM,YAAY,CAAC;AAEjC,MAAM,CAAC,OAAO,OAAgB,YAAa,SAAQ,OAAO;IACxD,YAAY,IAAY,EAAE,IAAY,EAAE,WAA2B,EAAE;QACnE,KAAK,CAAC,IAAI,EAAE,IAAI,EAAE,QAAQ,CAAC,CAAC;IAC9B,CAAC;CAEF"}

package/src/Permutor.ts

@@ -1,64 +0,0 @@
-export default class Permutor {
-  public array: Array<Array<string>>;
-  public positionToOptions: { [key: string]: string[] };
-
-  constructor() {
-    this.array = [];
-    this.positionToOptions = {};
-  }
-
-  permute(array: any) {
-    this.array = array;
-    this.createPositionMap();
-    return this.getPermutations();
-  }
-
-  getPermutations() {
-    return this.array[0].reduce((acc: any, value, index) => {
-      return acc.concat(this.getOptions(0, index));
-    }, []);
-  }
-
-  getKey(x: number, y: number) {
-    return `${x}|${y}`;
-  }
-
-  createPositionMap() {
-    this.positionToOptions = {};
-
-    for (let x = this.array.length - 1; x >= 0; x--) {
-      for (let y = 0; y < this.array[x].length; y++) {
-        const yValue = this.array[x][y];
-        const nextX = x + 1;
-
-        if (this.array[nextX] != null) {
-          const options = this.array[nextX];
-
-          const value = options
-            .map((option, index) => {
-              let permutations = this.getOptions(nextX, index);
-
-              return permutations.map((option) => {
-                return `${yValue}${option}`;
-              });
-            })
-            .reduce((acc, value) => {
-              return acc.concat(value);
-            }, []);
-
-          this.setOptions(x, y, value);
-        } else {
-          this.setOptions(x, y, [yValue]);
-        }
-      }
-    }
-  }
-
-  getOptions(x: number, y: number) {
-    return this.positionToOptions[this.getKey(x, y)];
-  }
-
-  setOptions(x: number, y: number, value: string[]) {
-    this.positionToOptions[this.getKey(x, y)] = value;
-  }
-}

package/src/ast/CompositeNode.ts

@@ -1,26 +0,0 @@
-import Node from "./Node";
-
-export default class CompositeNode extends Node {
-  constructor(type: string, name: string, startIndex = 0, endIndex = 0) {
-    super(type, name, startIndex, endIndex, true);
-  }
-
-  clone() {
-    const node = new CompositeNode(
-      this.type,
-      this.name,
-      this.startIndex,
-      this.endIndex
-    );
-
-    node.children = this.children.map((child) => {
-      return child.clone();
-    });
-
-    return node;
-  }
-
-  toString() {
-    return this.children.map((child) => child.toString()).join("");
-  }
-}

package/src/ast/ValueNode.ts

@@ -1,28 +0,0 @@
-import Node from "./Node";
-
-export default class ValueNode extends Node {
-  constructor(
-    type: string,
-    name: string,
-    value: string,
-    startIndex = 0,
-    endIndex = 0
-  ) {
-    super(type, name, startIndex, endIndex);
-    this.value = value;
-  }
-
-  clone() {
-    return new ValueNode(
-      this.type,
-      this.name,
-      this.value,
-      this.startIndex,
-      this.endIndex
-    );
-  }
-
-  toString() {
-    return this.value;
-  }
-}

package/src/patterns/RecursivePattern.ts

@@ -1,86 +0,0 @@
-import Pattern from "./Pattern";
-import ParserError from "./ParseError";
-import Cursor from "../Cursor";
-
-export default class RecursivePattern extends Pattern {
-  public isRecursing: boolean;
-  public pattern: Pattern | null = null;
-
-  constructor(name: string) {
-    super("recursive", name);
-    this.isRecursing = false;
-  }
-
-  getPattern() {
-    return this._climb(this.parent, (pattern: Pattern | null) => {
-      if (pattern == null) {
-        return false;
-      }
-      return pattern.name === this.name;
-    });
-  }
-
-  _climb(
-    pattern: Pattern | null,
-    isMatch: (pattern: Pattern | null) => boolean
-  ): Pattern | null {
-    if (isMatch(pattern)) {
-      return pattern;
-    } else {
-      if (pattern && pattern.parent != null) {
-        return this._climb(pattern.parent, isMatch);
-      }
-      return null;
-    }
-  }
-
-  parse(cursor: Cursor) {
-    if (this.pattern == null) {
-      const pattern = this.getPattern();
-
-      if (pattern == null) {
-        cursor.throwError(
-          new ParserError(
-            `Couldn't find parent pattern to recursively parse, with the name ${this.name}.`,
-            cursor.index,
-            this as Pattern
-          )
-        );
-        return null;
-      }
-
-      this.pattern = pattern.clone();
-      this.pattern.parent = this as Pattern;
-    }
-
-    const node = this.pattern.parse(cursor);
-
-    if (!cursor.hasUnresolvedError() && node != null) {
-      cursor.addMatch(this as Pattern, node);
-    }
-
-    return node;
-  }
-
-  clone(name?: string): Pattern {
-    if (typeof name !== "string") {
-      name = this.name;
-    }
-    return new RecursivePattern(name);
-  }
-
-  getTokenValue() {
-    return this.getPattern()?.getTokenValue() || null;
-  }
-
-  getTokens() {
-    if (!this.isRecursing) {
-      this.isRecursing = true;
-      const tokens = this.getPattern()?.getTokens() || [];
-      this.isRecursing = false;
-
-      return tokens;
-    }
-    return [];
-  }
-}

package/src/patterns/composite/AndComposite.ts

@@ -1,159 +0,0 @@
-import CompositePattern from "./CompositePattern";
-import CompositeNode from "../../ast/CompositeNode";
-import ParseError from "../../patterns/ParseError";
-import OptionalValue from "../value/OptionalValue";
-import OptionalComposite from "./OptionalComposite";
-import Pattern from "../Pattern";
-import Cursor from "../../Cursor";
-
-
-export default class AndComposite extends CompositePattern {
-  public index!: number;
-  public nodes!: CompositeNode[];
-  public node!: CompositeNode | null;
-  public cursor!: Cursor;
-  public mark!: number;
-
-  constructor(name: string, patterns: Pattern[] = []) {
-    super("and-composite", name, patterns);
-    this._assertArguments();
-  }
-
-  private _assertArguments() {
-    if (this._children.length < 2) {
-      throw new Error(
-        "Invalid Argument: AndValue needs to have more than one value pattern."
-      );
-    }
-  }
-
-  private _reset(cursor: Cursor) {
-    this.index = 0;
-    this.nodes = [];
-    this.node = null;
-    this.cursor = cursor;
-    this.mark = this.cursor.mark();
-  }
-
-  parse(cursor: Cursor) {
-    this._reset(cursor);
-    this._tryPatterns();
-
-    return this.node;
-  }
-
-  private _tryPatterns() {
-    while (true) {
-      const pattern = this._children[this.index];
-      const node = pattern.parse(this.cursor) as CompositeNode;
-
-      if (this.cursor.hasUnresolvedError()) {
-        this.cursor.moveToMark(this.mark);
-        break;
-      } else {
-        this.nodes.push(node);
-      }
-
-      if (!this._next()) {
-        this._processValue();
-        break;
-      }
-    }
-  }
-
-  private _next() {
-    if (this._hasMorePatterns()) {
-      if (this.cursor.hasNext()) {
-        // If the last result was a failed optional, then don't increment the cursor.
-        if (this.nodes[this.nodes.length - 1] != null) {
-          this.cursor.next();
-        }
-
-        this.index++;
-        return true;
-      } else if (this.nodes[this.nodes.length - 1] == null) {
-        this.index++;
-        return true;
-      }
-
-      this._assertRestOfPatternsAreOptional();
-      return false;
-    } else {
-      return false;
-    }
-  }
-
-  private _hasMorePatterns() {
-    return this.index + 1 < this._children.length;
-  }
-
-  private _assertRestOfPatternsAreOptional() {
-    const areTheRestOptional = this.children.every((pattern, index) => {
-      return (
-        index <= this.index ||
-        pattern instanceof OptionalValue ||
-        pattern instanceof OptionalComposite
-      );
-    });
-
-    if (!areTheRestOptional) {
-      const parseError = new ParseError(
-        `Could not match ${this.name} before string ran out.`,
-        this.index,
-        this
-      );
-      this.cursor.throwError(parseError);
-    }
-  }
-
-  private _processValue() {
-    if (!this.cursor.hasUnresolvedError()) {
-      this.nodes = this.nodes.filter((node) => node != null);
-
-      const lastNode = this.nodes[this.nodes.length - 1];
-      const startIndex = this.mark;
-      const endIndex = lastNode.endIndex;
-
-      this.node = new CompositeNode(
-        "and-composite",
-        this.name,
-        startIndex,
-        endIndex
-      );
-
-      this.node.children = this.nodes;
-
-      this.cursor.index = this.node.endIndex;
-      this.cursor.addMatch(this, this.node);
-    } else {
-      this.node = null;
-    }
-  }
-
-  clone(name?: string) {
-    if (typeof name !== "string") {
-      name = this.name;
-    }
-    return new AndComposite(name, this._children);
-  }
-
-  getTokens() {
-    let tokens: string[] = [];
-
-    for (let x = 0; x < this._children.length; x++) {
-      const child = this._children[x];
-
-      if (
-        child instanceof OptionalValue ||
-        child instanceof OptionalComposite
-      ) {
-        tokens = tokens.concat(child.getTokens());
-      } else {
-        tokens = tokens.concat(child.getTokens());
-        break;
-      }
-    }
-
-    return tokens;
-  }
-}

package/src/patterns/composite/CompositePattern.ts

@@ -1,7 +0,0 @@
-import Pattern from "../Pattern";
-
-export default abstract class CompositePattern extends Pattern {
-  constructor(type: string, name: string, children: Pattern[] = []) {
-    super(type, name, children);
-  }
-}

package/src/patterns/composite/OptionalComposite.ts

@@ -1,37 +0,0 @@
-import CompositePattern from "./CompositePattern";
-import Pattern from "../Pattern";
-import Cursor from "../../Cursor";
-
-export default class OptionalComposite extends CompositePattern {
-	public mark: any;
-
-  constructor(pattern: Pattern) {
-    super("optional-composite", "optional-composite", [pattern]);
-  }
-
-  parse(cursor: Cursor) {
-    const mark = cursor.mark();
-    this.mark = mark;
-
-    const node = this.children[0].parse(cursor);
-
-    if (cursor.hasUnresolvedError()) {
-      cursor.resolveError();
-      cursor.moveToMark(mark);
-      return null;
-    } else {
-      if (node != null){
-        cursor.addMatch(this, node);
-      }
-      return node;
-    }
-  }
-
-  clone() {
-    return new OptionalComposite(this.children[0]);
-  }
-
-  getTokens() {
-    return this._children[0].getTokens();
-  }
-}

package/src/patterns/composite/OrComposite.ts

@@ -1,96 +0,0 @@
-import CompositePattern from "./CompositePattern";
-import OptionalValue from "../value/OptionalValue";
-import OptionalComposite from "./OptionalComposite";
-import Pattern from "../Pattern";
-import Cursor from "../../Cursor";
-
-export default class OrComposite extends CompositePattern {
-  public cursor: any;
-  public mark: any;
-  public index: any;
-  public node: any;
-
-  constructor(name: string, patterns: Pattern[]) {
-    super("or-composite", name, patterns);
-    this._assertArguments();
-  }
-
-  private _assertArguments() {
-    if (this._children.length < 2) {
-      throw new Error(
-        "Invalid Argument: OrValue needs to have more than one value pattern."
-      );
-    }
-
-    const hasOptionalChildren = this._children.some(
-      (pattern) =>
-        pattern instanceof OptionalValue || pattern instanceof OptionalComposite
-    );
-
-    if (hasOptionalChildren) {
-      throw new Error("OrComposite cannot have optional values.");
-    }
-  }
-
-  private _reset(cursor: Cursor) {
-    this.cursor = cursor;
-    this.mark = null;
-    this.index = 0;
-    this.node = null;
-    this.mark = cursor.mark();
-  }
-
-  parse(cursor: Cursor) {
-    this._reset(cursor);
-    this._tryPattern();
-
-    if (this.node != null) {
-      this.cursor.addMatch(this, this.node);
-    }
-
-    return this.node;
-  }
-
-  private _tryPattern() {
-    while (true) {
-      const pattern = this._children[this.index];
-
-      this.node = pattern.parse(this.cursor);
-
-      if (this.cursor.hasUnresolvedError()) {
-        if (this.index + 1 < this._children.length) {
-          this.cursor.resolveError();
-          this.index++;
-          this.cursor.moveToMark(this.mark);
-        } else {
-          this.node = null;
-          break;
-        }
-      } else {
-        this.cursor.index = this.node.endIndex;
-        break;
-      }
-    }
-  }
-
-  clone(name?: string) {
-    if (typeof name !== "string") {
-      name = this.name;
-    }
-    return new OrComposite(name, this._children);
-  }
-
-  getTokens() {
-    const tokens = this._children.map((c) => c.getTokens());
-
-    const hasPrimitiveTokens = tokens.every((t) =>
-      t.every((value) => typeof value === "string")
-    );
-
-    if (hasPrimitiveTokens && tokens.length > 0) {
-      return tokens.reduce((acc, t) => acc.concat(t), []);
-    }
-
-    return this._children[0].getTokens();
-  }
-}