@traqula/core 0.0.1-alpha.141 → 0.0.1-alpha.145

package/lib/grammar-builder/parserBuilder.d.ts

@@ -20,7 +20,7 @@ export declare class Builder<Names extends string, RuleDefs extends RuleDefMap<N
     /**
      * Add a rule to the grammar. If the rule already exists, but the implementation differs, an error will be thrown.
      */
-    addRuleRedundant<U extends string, RET, ARGS extends undefined[]>(rule: RuleDef<U, RET, ARGS>): Builder<Names | U, {
+    addRuleRedundant<U extends string, RET, ARGS extends unknown[]>(rule: RuleDef<U, RET, ARGS>): Builder<Names | U, {
         [K in Names | U]: K extends U ? RuleDef<K, RET, ARGS> : (K extends Names ? (RuleDefs[K] extends RuleDef<K> ? RuleDefs[K] : never) : never);
     }>;
     /**

package/lib/grammar-builder/parserBuilder.js

@@ -94,7 +94,7 @@ export class Builder {
         const selfSufficientParser = {};
         // eslint-disable-next-line ts/no-unnecessary-type-assertion
         for (const rule of Object.values(this.rules)) {
-            selfSufficientParser[rule.name] = ((input, ...args) => {
+            selfSufficientParser[rule.name] = ((input, arg) => {
                 // Transform input in accordance to 19.2
                 input = input.replaceAll(/\\u([0-9a-fA-F]{4})|\\U([0-9a-fA-F]{8})/gu, (_, unicode4, unicode8) => {
                     if (unicode4) {
@@ -116,7 +116,7 @@ export class Builder {
                 // Console.log(lexResult.tokens);
                 parser.reset();
                 parser.input = lexResult.tokens;
-                const result = parser[rule.name](...args);
+                const result = parser[rule.name](arg);
                 if (parser.errors.length > 0) {
                     // Console.log(lexResult.tokens);
                     throw new Error(`Parse error on line ${parser.errors.map(x => x.token.startLine).join(', ')}
@@ -138,12 +138,10 @@ ${parser.errors.map(x => `${x.token.startLine}: ${x.message}`).join('\n')}`);
                     ...config,
                 });
                 const selfRef = this.getSelfRef();
-                // Remember to change the reset function accordingly!
+                // !!! Remember to change the RESET function accordingly !!!
                 this.initialParseContext = {
                     dataFactory: new DataFactory({ blankNodePrefix: 'g_' }),
                     baseIRI: undefined,
-                    flushedBlankNodeLabels: new Set(),
-                    usedBlankNodeLabels: new Set(),
                     parseMode: new Set(),
                     skipValidation: false,
                     ...context,
@@ -172,10 +170,13 @@ ${parser.errors.map(x => `${x.token.startLine}: ${x.message}`).join('\n')}`);
                 });
                 this.runningContext.prefixes = { ...this.initialParseContext.prefixes };
                 this.runningContext.parseMode = new Set(this.initialParseContext.parseMode);
-                this.runningContext.usedBlankNodeLabels.clear();
-                this.runningContext.flushedBlankNodeLabels.clear();
             }
             getSelfRef() {
+                const subRuleImpl = (subrule) => {
+                    return ((cstDef, ...args) => {
+                        return subrule(this[cstDef.name], { ARGS: args });
+                    });
+                };
                 return {
                     CONSUME: (tokenType, option) => this.CONSUME(tokenType, option),
                     CONSUME1: (tokenType, option) => this.CONSUME1(tokenType, option),
@@ -256,86 +257,16 @@ ${parser.errors.map(x => `${x.token.startLine}: ${x.message}`).join('\n')}`);
                             throw error;
                         }
                     },
-                    SUBRULE: (cstDef, ...args) => {
-                        try {
-                            return this.SUBRULE(this[cstDef.name], { ARGS: args });
-                        }
-                        catch (error) {
-                            throw error;
-                        }
-                    },
-                    SUBRULE1: (cstDef, ...args) => {
-                        try {
-                            return this.SUBRULE1(this[cstDef.name], { ARGS: args });
-                        }
-                        catch (error) {
-                            throw error;
-                        }
-                    },
-                    SUBRULE2: (cstDef, ...args) => {
-                        try {
-                            return this.SUBRULE2(this[cstDef.name], { ARGS: args });
-                        }
-                        catch (error) {
-                            throw error;
-                        }
-                    },
-                    SUBRULE3: (cstDef, ...args) => {
-                        try {
-                            return this.SUBRULE3(this[cstDef.name], { ARGS: args });
-                        }
-                        catch (error) {
-                            throw error;
-                        }
-                    },
-                    SUBRULE4: (cstDef, ...args) => {
-                        try {
-                            return this.SUBRULE4(this[cstDef.name], { ARGS: args });
-                        }
-                        catch (error) {
-                            throw error;
-                        }
-                    },
-                    SUBRULE5: (cstDef, ...args) => {
-                        try {
-                            return this.SUBRULE5(this[cstDef.name], { ARGS: args });
-                        }
-                        catch (error) {
-                            throw error;
-                        }
-                    },
-                    SUBRULE6: (cstDef, ...args) => {
-                        try {
-                            return this.SUBRULE6(this[cstDef.name], { ARGS: args });
-                        }
-                        catch (error) {
-                            throw error;
-                        }
-                    },
-                    SUBRULE7: (cstDef, ...args) => {
-                        try {
-                            return this.SUBRULE7(this[cstDef.name], { ARGS: args });
-                        }
-                        catch (error) {
-                            throw error;
-                        }
-                    },
-                    SUBRULE8: (cstDef, ...args) => {
-                        try {
-                            return this.SUBRULE8(this[cstDef.name], { ARGS: args });
-                        }
-                        catch (error) {
-                            throw error;
-                        }
-                    },
-                    SUBRULE9: (cstDef, ...args) => {
-                        try {
-                            return this.SUBRULE9(this[cstDef.name], { ARGS: args });
-                        }
-                        catch (error) {
-                            throw error;
-                        }
-                    },
+                    SUBRULE: subRuleImpl((rule, args) => this.SUBRULE(rule, args)),
+                    SUBRULE1: subRuleImpl((rule, args) => this.SUBRULE1(rule, args)),
+                    SUBRULE2: subRuleImpl((rule, args) => this.SUBRULE2(rule, args)),
+                    SUBRULE3: subRuleImpl((rule, args) => this.SUBRULE3(rule, args)),
+                    SUBRULE4: subRuleImpl((rule, args) => this.SUBRULE4(rule, args)),
+                    SUBRULE5: subRuleImpl((rule, args) => this.SUBRULE5(rule, args)),
+                    SUBRULE6: subRuleImpl((rule, args) => this.SUBRULE6(rule, args)),
+                    SUBRULE7: subRuleImpl((rule, args) => this.SUBRULE7(rule, args)),
+                    SUBRULE8: subRuleImpl((rule, args) => this.SUBRULE8(rule, args)),
+                    SUBRULE9: subRuleImpl((rule, args) => this.SUBRULE9(rule, args)),
                 };
             }
         }

package/lib/grammar-builder/parserBuilder.js.map

@@ -1 +1 @@
-{"version":3,"file":"parserBuilder.js","sourceRoot":"","sources":["parserBuilder.ts"],"names":[],"mappings":"AAEA,OAAO,EAAE,qBAAqB,EAAE,KAAK,EAAE,MAAM,YAAY,CAAC;AAC1D,OAAO,EAAE,WAAW,EAAE,MAAM,kBAAkB,CAAC;AAW/C,SAAS,gBAAgB,CAA+B,KAAQ;IAC9D,MAAM,QAAQ,GAA4B,EAAE,CAAC;IAC7C,KAAK,MAAM,IAAI,IAAI,KAAK,EAAE,CAAC;QACzB,QAAQ,CAAC,IAAI,CAAC,IAAI,CAAC,GAAG,IAAI,CAAC;IAC7B,CAAC;IACD,OAA4B,QAAQ,CAAC;AACvC,CAAC;AAED,MAAM,OAAO,OAAO;IAClB;;;OAGG;IACI,MAAM,CAAC,aAAa,CAI3B,KAAuC;QACrC,IAAI,KAAK,YAAY,OAAO,EAAE,CAAC;YAC7B,OAAO,IAAI,OAAO,CAAC,EAAE,GAAG,KAAK,CAAC,KAAK,EAAE,CAAC,CAAC;QACzC,CAAC;QACD,OAA4C,IAAI,OAAO,CAAC,gBAAgB,CAAC,KAAK,CAAC,CAAC,CAAC;IACnF,CAAC;IAID,YAAoB,UAAoB;QACtC,IAAI,CAAC,KAAK,GAAG,UAAU,CAAC;IAC1B,CAAC;IAED;;OAEG;IACI,SAAS,CAA+C,KAA4B;QAEzF,MAAM,IAAI,GACE,IAAI,CAAC;QACjB,IAAI,CAAC,KAAK,CAAC,KAAK,CAAC,IAAI,CAAC,GAAS,KAAK,CAAC;QACrC,OAAO,IAAI,CAAC;IACd,CAAC;IAED;;OAEG;IACI,gBAAgB,CAAkD,IAA2B;QAElG,MAAM,IAAI,GACE,IAAI,CAAC;QACjB,MAAM,KAAK,GAA6B,IAAI,CAAC,KAAK,CAAC;QACnD,IAAI,KAAK,CAAC,IAAI,CAAC,IAAI,CAAC,KAAK,SAAS,IAAI,KAAK,CAAC,IAAI,CAAC,IAAI,CAAC,KAAK,IAAI,EAAE,CAAC;YAChE,MAAM,IAAI,KAAK,CAAC,QAAQ,IAAI,CAAC,IAAI,gCAAgC,CAAC,CAAC;QACrE,CAAC;QACD,KAAK,CAAC,IAAI,CAAC,IAAI,CAAC,GAAG,IAAI,CAAC;QACxB,OAAO,IAAI,CAAC;IACd,CAAC;IAED;;OAEG;IACI,OAAO,CACZ,IAAmD;QAEnD,OAAO,IAAI,CAAC,gBAAgB,CAAC,IAAI,CAAC,CAAC;IACrC,CAAC;IAEM,OAAO,CACZ,GAAG,KAAmD;QAUtD,IAAI,CAAC,KAAK,GAAG,EAAE,GAAG,IAAI,CAAC,KAAK,EAAE,GAAG,gBAAgB,CAAC,KAAK,CAAC,EAAE,CAAC;QAC3D,OAAuB,IAAI,CAAC;IAC9B,CAAC;IAEM,UAAU,CAAkB,QAAW;QAE5C,OAAO,IAAI,CAAC,KAAK,CAAC,QAAQ,CAAC,CAAC;QAC5B,OACY,IAAI,CAAC;IACnB,CAAC;IAEM,KAAK,CACV,OAAwC,EACxC,eAAmB;QAYnB,yFAAyF;QACzF,MAAM,UAAU,GAA4B,EAAE,GAAG,OAAO,CAAC,KAAK,EAAE,CAAC;QACjE,MAAM,OAAO,GAA4B,IAAI,CAAC,KAAK,CAAC;QAEpD,KAAK,MAAM,IAAI,IAAI,MAAM,CAAC,MAAM,CAAC,OAAO,CAAC,EAAE,CAAC;YAC1C,IAAI,UAAU,CAAC,IAAI,CAAC,IAAI,CAAC,KAAK,SAAS,EAAE,CAAC;gBACxC,UAAU,CAAC,IAAI,CAAC,IAAI,CAAC,GAAG,IAAI,CAAC;YAC/B,CAAC;iBAAM,CAAC;gBACN,MAAM,YAAY,GAAG,UAAU,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC;gBAC3C,wCAAwC;gBACxC,IAAI,YAAY,KAAK,IAAI,EAAE,CAAC;oBAC1B,MAAM,QAAQ,GAAG,eAAe,CAAC,IAAI,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC,IAAI,KAAK,IAAI,CAAC,IAAI,CAAC,CAAC;oBACjE,mFAAmF;oBACnF,IAAI,QAAQ,EAAE,CAAC;wBACb,UAAU,CAAC,IAAI,CAAC,IAAI,CAAC,GAAG,QAAQ,CAAC;oBACnC,CAAC;yBAAM,CAAC;wBACN,MAAM,IAAI,KAAK,CAAC,mBAAmB,IAAI,CAAC,IAAI,0EAA0E,CAAC,CAAC;oBAC1H,CAAC;gBACH,CAAC;YACH,CAAC;QACH,CAAC;QAED,IAAI,CAAC,KAAK,GAAmB,UAAU,CAAC;QACxC,OAAuB,IAAI,CAAC;IAC9B,CAAC;IAEM,eAAe,CAAC,EAAE,eAAe,EAAE,YAAY,GAAG,EAAE,EAAE,WAAW,GAAG,EAAE,EAI5E,EAAE,UAAwC,EAAE;QAC3C,MAAM,KAAK,GAAU,IAAI,KAAK,CAAC,eAAe,EAAE;YAC9C,gBAAgB,EAAE,WAAW;YAC7B,eAAe,EAAE,KAAK;YACtB,kBAAkB;YAClB,yBAAyB;YACzB,mBAAmB,EAAE,IAAI;YACzB,GAAG,WAAW;SACf,CAAC,CAAC;QACH,MAAM,MAAM,GAAG,IAAI,CAAC,OAAO,CAAC,EAAE,eAAe,EAAE,MAAM,EAAE,YAAY,EAAE,EAAE,OAAO,CAAC,CAAC;QAChF,MAAM,oBAAoB,GAA8C,EAAE,CAAC;QAC3E,4DAA4D;QAC5D,KAAK,MAAM,IAAI,IAAuB,MAAM,CAAC,MAAM,CAAC,IAAI,CAAC,KAAK,CAAC,EAAE,CAAC;YAChE,oBAAoB,CAAC,IAAI,CAAC,IAAI,CAAC,GAAS,CAAC,CAAC,KAAa,EAAE,GAAG,IAAe,EAAE,EAAE;gBAC7E,wCAAwC;gBACxC,KAAK,GAAG,KAAK,CAAC,UAAU,CACtB,2CAA2C,EAC3C,CAAC,CAAC,EAAE,QAAgB,EAAE,QAAgB,EAAE,EAAE;oBACxC,IAAI,QAAQ,EAAE,CAAC;wBACb,MAAM,QAAQ,GAAG,MAAM,CAAC,QAAQ,CAAC,QAAQ,EAAE,EAAE,CAAC,CAAC;wBAC/C,OAAO,MAAM,CAAC,aAAa,CAAC,QAAQ,CAAC,CAAC;oBACxC,CAAC;oBACD,MAAM,QAAQ,GAAG,MAAM,CAAC,QAAQ,CAAC,QAAQ,EAAE,EAAE,CAAC,CAAC;oBAC/C,IAAI,QAAQ,GAAG,MAAM,EAAE,CAAC;wBACtB,OAAO,MAAM,CAAC,aAAa,CAAC,QAAQ,CAAC,CAAC;oBACxC,CAAC;oBACD,MAAM,mBAAmB,GAAG,QAAQ,GAAG,OAAO,CAAC;oBAC/C,OAAO,MAAM,CAAC,aAAa,CAAC,MAAM,GAAG,CAAC,mBAAmB,IAAI,EAAE,CAAC,EAAE,MAAM,GAAG,CAAC,mBAAmB,GAAG,KAAK,CAAC,CAAC,CAAC;gBAC5G,CAAC,CACF,CAAC;gBACF,2CAA2C;gBAC3C,IAAI,sCAAsC,CAAC,IAAI,CAAC,KAAK,CAAC,EAAE,CAAC;oBACvD,MAAM,IAAI,KAAK,CAAC,6EAA6E,CAAC,CAAC;gBACjG,CAAC;gBAED,MAAM,SAAS,GAAG,KAAK,CAAC,QAAQ,CAAC,KAAK,CAAC,CAAC;gBACxC,iCAAiC;gBAEjC,MAAM,CAAC,KAAK,EAAE,CAAC;gBACf,MAAM,CAAC,KAAK,GAAG,SAAS,CAAC,MAAM,CAAC;gBAChC,MAAM,MAAM,GAAG,MAAM,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC,GAAG,IAAI,CAAC,CAAC;gBAC1C,IAAI,MAAM,CAAC,MAAM,CAAC,MAAM,GAAG,CAAC,EAAE,CAAC;oBAC7B,iCAAiC;oBACjC,MAAM,IAAI,KAAK,CAAC,uBAAuB,MAAM,CAAC,MAAM,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC,KAAK,CAAC,SAAS,CAAC,CAAC,IAAI,CAAC,IAAI,CAAC;EACnG,MAAM,CAAC,MAAM,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,CAAC,GAAG,CAAC,CAAC,KAAK,CAAC,SAAS,KAAK,CAAC,CAAC,OAAO,EAAE,CAAC,CAAC,IAAI,CAAC,IAAI,CAAC,EAAE,CAAC,CAAC;gBACrE,CAAC;gBACD,OAAO,MAAM,CAAC;YAChB,CAAC,CAAC,CAAC;QACL,CAAC;QACD,OAA0C,oBAAoB,CAAC;IACjE,CAAC;IAEM,OAAO,CAAC,EAAE,eAAe,EAAE,MAAM,GAAG,EAAE,EAG5C,EAAE,UAAwC,EAAE;QAC3C,MAAM,KAAK,GAAG,IAAI,CAAC,KAAK,CAAC;QACzB,MAAM,QAAS,SAAQ,qBAAqB;YAI1C;gBACE,KAAK,CAAC,eAAe,EAAE;oBACrB,yBAAyB;oBACzB,YAAY,EAAE,CAAC;oBACf,yBAAyB;oBACzB,GAAG,MAAM;iBACV,CAAC,CAAC;gBAEH,MAAM,OAAO,GAAG,IAAI,CAAC,UAAU,EAAE,CAAC;gBAClC,qDAAqD;gBACrD,IAAI,CAAC,mBAAmB,GAAG;oBACzB,WAAW,EAAE,IAAI,WAAW,CAAC,EAAE,eAAe,EAAE,IAAI,EAAE,CAAC;oBACvD,OAAO,EAAE,SAAS;oBAClB,sBAAsB,EAAE,IAAI,GAAG,EAAE;oBACjC,mBAAmB,EAAE,IAAI,GAAG,EAAE;oBAC9B,SAAS,EAAE,IAAI,GAAG,EAAE;oBACpB,cAAc,EAAE,KAAK;oBACrB,GAAG,OAAO;oBACV,QAAQ,EAAE,OAAO,CAAC,QAAQ,CAAC,CAAC,CAAC,EAAE,GAAG,OAAO,CAAC,QAAQ,EAAE,CAAC,CAAC,CAAC,EAAE;iBAC1D,CAAC;gBACF,IAAI,CAAC,cAAc,GAAG;oBACpB,GAAG,IAAI,CAAC,mBAAmB;oBAC3B,QAAQ,EAAE,EAAE,GAAG,IAAI,CAAC,mBAAmB,CAAC,QAAQ,EAAE;oBAClD,SAAS,EAAE,IAAI,GAAG,CAAC,IAAI,CAAC,mBAAmB,CAAC,SAAS,CAAC;iBACvD,CAAC;gBAEF,MAAM,QAAQ,GAAa;oBACzB,GAAG,OAAO;oBACV,KAAK,EAAE,IAAI,OAAO,EAAE;oBACpB,OAAO,EAAE,IAAI,CAAC,cAAc;iBAC7B,CAAC;gBAEF,KAAK,MAAM,IAAI,IAAI,MAAM,CAAC,MAAM,CAA0B,KAAK,CAAC,EAAE,CAAC;oBACjE,IAAI,CAAuB,IAAI,CAAC,IAAI,CAAC,GAAS,IAAI,CAAC,IAAI,CAAC,IAAI,CAAC,IAAI,EAAE,IAAI,CAAC,IAAI,CAAC,QAAQ,CAAC,CAAC,CAAC;gBAC1F,CAAC;gBACD,IAAI,CAAC,mBAAmB,EAAE,CAAC;YAC7B,CAAC;YAEe,KAAK;gBACnB,KAAK,CAAC,KAAK,EAAE,CAAC;gBACd,iDAAiD;gBACjD,MAAM,CAAC,MAAM,CAAC,IAAI,CAAC,cAAc,EAAE;oBACjC,GAAG,IAAI,CAAC,mBAAmB;iBAC5B,CAAC,CAAC;gBACH,IAAI,CAAC,cAAc,CAAC,QAAQ,GAAG,EAAE,GAAG,IAAI,CAAC,mBAAmB,CAAC,QAAQ,EAAE,CAAC;gBACxE,IAAI,CAAC,cAAc,CAAC,SAAS,GAAG,IAAI,GAAG,CAAC,IAAI,CAAC,mBAAmB,CAAC,SAAS,CAAC,CAAC;gBAC5E,IAAI,CAAC,cAAc,CAAC,mBAAmB,CAAC,KAAK,EAAE,CAAC;gBAChD,IAAI,CAAC,cAAc,CAAC,sBAAsB,CAAC,KAAK,EAAE,CAAC;YACrD,CAAC;YAEO,UAAU;gBAChB,OAAO;oBACL,OAAO,EAAE,CAAC,SAAS,EAAE,MAAM,EAAE,EAAE,CAAC,IAAI,CAAC,OAAO,CAAC,SAAS,EAAE,MAAM,CAAC;oBAC/D,QAAQ,EAAE,CAAC,SAAS,EAAE,MAAM,EAAE,EAAE,CAAC,IAAI,CAAC,QAAQ,CAAC,SAAS,EAAE,MAAM,CAAC;oBACjE,QAAQ,EAAE,CAAC,SAAS,EAAE,MAAM,EAAE,EAAE,CAAC,IAAI,CAAC,QAAQ,CAAC,SAAS,EAAE,MAAM,CAAC;oBACjE,QAAQ,EAAE,CAAC,SAAS,EAAE,MAAM,EAAE,EAAE,CAAC,IAAI,CAAC,QAAQ,CAAC,SAAS,EAAE,MAAM,CAAC;oBACjE,QAAQ,EAAE,CAAC,SAAS,EAAE,MAAM,EAAE,EAAE,CAAC,IAAI,CAAC,QAAQ,CAAC,SAAS,EAAE,MAAM,CAAC;oBACjE,QAAQ,EAAE,CAAC,SAAS,EAAE,MAAM,EAAE,EAAE,CAAC,IAAI,CAAC,QAAQ,CAAC,SAAS,EAAE,MAAM,CAAC;oBACjE,QAAQ,EAAE,CAAC,SAAS,EAAE,MAAM,EAAE,EAAE,CAAC,IAAI,CAAC,QAAQ,CAAC,SAAS,EAAE,MAAM,CAAC;oBACjE,QAAQ,EAAE,CAAC,SAAS,EAAE,MAAM,EAAE,EAAE,CAAC,IAAI,CAAC,QAAQ,CAAC,SAAS,EAAE,MAAM,CAAC;oBACjE,QAAQ,EAAE,CAAC,SAAS,EAAE,MAAM,EAAE,EAAE,CAAC,IAAI,CAAC,QAAQ,CAAC,SAAS,EAAE,MAAM,CAAC;oBACjE,QAAQ,EAAE,CAAC,SAAS,EAAE,MAAM,EAAE,EAAE,CAAC,IAAI,CAAC,QAAQ,CAAC,SAAS,EAAE,MAAM,CAAC;oBACjE,MAAM,EAAE,iBAAiB,CAAC,EAAE,CAAC,IAAI,CAAC,MAAM,CAAC,iBAAiB,CAAC;oBAC3D,OAAO,EAAE,iBAAiB,CAAC,EAAE,CAAC,IAAI,CAAC,OAAO,CAAC,iBAAiB,CAAC;oBAC7D,OAAO,EAAE,iBAAiB,CAAC,EAAE,CAAC,IAAI,CAAC,OAAO,CAAC,iBAAiB,CAAC;oBAC7D,OAAO,EAAE,iBAAiB,CAAC,EAAE,CAAC,IAAI,CAAC,OAAO,CAAC,iBAAiB,CAAC;oBAC7D,OAAO,EAAE,iBAAiB,CAAC,EAAE,CAAC,IAAI,CAAC,OAAO,CAAC,iBAAiB,CAAC;oBAC7D,OAAO,EAAE,iBAAiB,CAAC,EAAE,CAAC,IAAI,CAAC,OAAO,CAAC,iBAAiB,CAAC;oBAC7D,OAAO,EAAE,iBAAiB,CAAC,EAAE,CAAC,IAAI,CAAC,OAAO,CAAC,iBAAiB,CAAC;oBAC7D,OAAO,EAAE,iBAAiB,CAAC,EAAE,CAAC,IAAI,CAAC,OAAO,CAAC,iBAAiB,CAAC;oBAC7D,OAAO,EAAE,iBAAiB,CAAC,EAAE,CAAC,IAAI,CAAC,OAAO,CAAC,iBAAiB,CAAC;oBAC7D,OAAO,EAAE,iBAAiB,CAAC,EAAE,CAAC,IAAI,CAAC,OAAO,CAAC,iBAAiB,CAAC;oBAC7D,EAAE,EAAE,UAAU,CAAC,EAAE,CAAC,IAAI,CAAC,EAAE,CAAC,UAAU,CAAC;oBACrC,GAAG,EAAE,UAAU,CAAC,EAAE,CAAC,IAAI,CAAC,GAAG,CAAC,UAAU,CAAC;oBACvC,GAAG,EAAE,UAAU,CAAC,EAAE,CAAC,IAAI,CAAC,GAAG,CAAC,UAAU,CAAC;oBACvC,GAAG,EAAE,UAAU,CAAC,EAAE,CAAC,IAAI,CAAC,GAAG,CAAC,UAAU,CAAC;oBACvC,GAAG,EAAE,UAAU,CAAC,EAAE,CAAC,IAAI,CAAC,GAAG,CAAC,UAAU,CAAC;oBACvC,GAAG,EAAE,UAAU,CAAC,EAAE,CAAC,IAAI,CAAC,GAAG,CAAC,UAAU,CAAC;oBACvC,GAAG,EAAE,UAAU,CAAC,EAAE,CAAC,IAAI,CAAC,GAAG,CAAC,UAAU,CAAC;oBACvC,GAAG,EAAE,UAAU,CAAC,EAAE,CAAC,IAAI,CAAC,GAAG,CAAC,UAAU,CAAC;oBACvC,GAAG,EAAE,UAAU,CAAC,EAAE,CAAC,IAAI,CAAC,GAAG,CAAC,UAAU,CAAC;oBACvC,GAAG,EAAE,UAAU,CAAC,EAAE,CAAC,IAAI,CAAC,GAAG,CAAC,UAAU,CAAC;oBACvC,IAAI,EAAE,iBAAiB,CAAC,EAAE,CAAC,IAAI,CAAC,IAAI,CAAC,iBAAiB,CAAC;oBACvD,KAAK,EAAE,iBAAiB,CAAC,EAAE,CAAC,IAAI,CAAC,KAAK,CAAC,iBAAiB,CAAC;oBACzD,KAAK,EAAE,iBAAiB,CAAC,EAAE,CAAC,IAAI,CAAC,KAAK,CAAC,iBAAiB,CAAC;oBACzD,KAAK,EAAE,iBAAiB,CAAC,EAAE,CAAC,IAAI,CAAC,KAAK,CAAC,iBAAiB,CAAC;oBACzD,KAAK,EAAE,iBAAiB,CAAC,EAAE,CAAC,IAAI,CAAC,KAAK,CAAC,iBAAiB,CAAC;oBACzD,KAAK,EAAE,iBAAiB,CAAC,EAAE,CAAC,IAAI,CAAC,KAAK,CAAC,iBAAiB,CAAC;oBACzD,KAAK,EAAE,iBAAiB,CAAC,EAAE,CAAC,IAAI,CAAC,KAAK,CAAC,iBAAiB,CAAC;oBACzD,KAAK,EAAE,iBAAiB,CAAC,EAAE,CAAC,IAAI,CAAC,KAAK,CAAC,iBAAiB,CAAC;oBACzD,KAAK,EAAE,iBAAiB,CAAC,EAAE,CAAC,IAAI,CAAC,KAAK,CAAC,iBAAiB,CAAC;oBACzD,KAAK,EAAE,iBAAiB,CAAC,EAAE,CAAC,IAAI,CAAC,KAAK,CAAC,iBAAiB,CAAC;oBACzD,QAAQ,EAAE,OAAO,CAAC,EAAE,CAAC,IAAI,CAAC,QAAQ,CAAC,OAAO,CAAC;oBAC3C,SAAS,EAAE,OAAO,CAAC,EAAE,CAAC,IAAI,CAAC,SAAS,CAAC,OAAO,CAAC;oBAC7C,SAAS,EAAE,OAAO,CAAC,EAAE,CAAC,IAAI,CAAC,SAAS,CAAC,OAAO,CAAC;oBAC7C,SAAS,EAAE,OAAO,CAAC,EAAE,CAAC,IAAI,CAAC,SAAS,CAAC,OAAO,CAAC;oBAC7C,SAAS,EAAE,OAAO,CAAC,EAAE,CAAC,IAAI,CAAC,SAAS,CAAC,OAAO,CAAC;oBAC7C,SAAS,EAAE,OAAO,CAAC,EAAE,CAAC,IAAI,CAAC,SAAS,CAAC,OAAO,CAAC;oBAC7C,SAAS,EAAE,OAAO,CAAC,EAAE,CAAC,IAAI,CAAC,SAAS,CAAC,OAAO,CAAC;oBAC7C,SAAS,EAAE,OAAO,CAAC,EAAE,CAAC,IAAI,CAAC,SAAS,CAAC,OAAO,CAAC;oBAC7C,SAAS,EAAE,OAAO,CAAC,EAAE,CAAC,IAAI,CAAC,SAAS,CAAC,OAAO,CAAC;oBAC7C,SAAS,EAAE,OAAO,CAAC,EAAE,CAAC,IAAI,CAAC,SAAS,CAAC,OAAO,CAAC;oBAC7C,YAAY,EAAE,iBAAiB,CAAC,EAAE,CAAC,IAAI,CAAC,YAAY,CAAC,iBAAiB,CAAC;oBACvE,aAAa,EAAE,iBAAiB,CAAC,EAAE,CAAC,IAAI,CAAC,aAAa,CAAC,iBAAiB,CAAC;oBACzE,aAAa,EAAE,iBAAiB,CAAC,EAAE,CAAC,IAAI,CAAC,aAAa,CAAC,iBAAiB,CAAC;oBACzE,aAAa,EAAE,iBAAiB,CAAC,EAAE,CAAC,IAAI,CAAC,aAAa,CAAC,iBAAiB,CAAC;oBACzE,aAAa,EAAE,iBAAiB,CAAC,EAAE,CAAC,IAAI,CAAC,aAAa,CAAC,iBAAiB,CAAC;oBACzE,aAAa,EAAE,iBAAiB,CAAC,EAAE,CAAC,IAAI,CAAC,aAAa,CAAC,iBAAiB,CAAC;oBACzE,aAAa,EAAE,iBAAiB,CAAC,EAAE,CAAC,IAAI,CAAC,aAAa,CAAC,iBAAiB,CAAC;oBACzE,aAAa,EAAE,iBAAiB,CAAC,EAAE,CAAC,IAAI,CAAC,aAAa,CAAC,iBAAiB,CAAC;oBACzE,aAAa,EAAE,iBAAiB,CAAC,EAAE,CAAC,IAAI,CAAC,aAAa,CAAC,iBAAiB,CAAC;oBACzE,aAAa,EAAE,iBAAiB,CAAC,EAAE,CAAC,IAAI,CAAC,aAAa,CAAC,iBAAiB,CAAC;oBACzE,gBAAgB,EAAE,OAAO,CAAC,EAAE,CAAC,IAAI,CAAC,gBAAgB,CAAC,OAAO,CAAC;oBAC3D,iBAAiB,EAAE,OAAO,CAAC,EAAE,CAAC,IAAI,CAAC,iBAAiB,CAAC,OAAO,CAAC;oBAC7D,iBAAiB,EAAE,OAAO,CAAC,EAAE,CAAC,IAAI,CAAC,iBAAiB,CAAC,OAAO,CAAC;oBAC7D,iBAAiB,EAAE,OAAO,CAAC,EAAE,CAAC,IAAI,CAAC,iBAAiB,CAAC,OAAO,CAAC;oBAC7D,iBAAiB,EAAE,OAAO,CAAC,EAAE,CAAC,IAAI,CAAC,iBAAiB,CAAC,OAAO,CAAC;oBAC7D,iBAAiB,EAAE,OAAO,CAAC,EAAE,CAAC,IAAI,CAAC,iBAAiB,CAAC,OAAO,CAAC;oBAC7D,iBAAiB,EAAE,OAAO,CAAC,EAAE,CAAC,IAAI,CAAC,iBAAiB,CAAC,OAAO,CAAC;oBAC7D,iBAAiB,EAAE,OAAO,CAAC,EAAE,CAAC,IAAI,CAAC,iBAAiB,CAAC,OAAO,CAAC;oBAC7D,iBAAiB,EAAE,OAAO,CAAC,EAAE,CAAC,IAAI,CAAC,iBAAiB,CAAC,OAAO,CAAC;oBAC7D,iBAAiB,EAAE,OAAO,CAAC,EAAE,CAAC,IAAI,CAAC,iBAAiB,CAAC,OAAO,CAAC;oBAC7D,MAAM,EAAE,IAAI,CAAC,EAAE,CAAC,IAAI,CAAC,MAAM,CAAC,IAAI,CAAC;oBACjC,SAAS,EAAE,CAAC,MAAM,EAAE,GAAG,IAAI,EAAE,EAAE;wBAC7B,IAAI,CAAC;4BACH,OAAO,IAAI,CAAC,SAAS,CAAO,IAAI,CAAuB,MAAM,CAAC,IAAI,CAAC,EAAQ,EAAE,IAAI,EAAE,IAAI,EAAE,CAAC,CAAC;wBAC7F,CAAC;wBAAC,OAAO,KAAc,EAAE,CAAC;4BACxB,MAAM,KAAK,CAAC;wBACd,CAAC;oBACH,CAAC;oBACD,OAAO,EAAE,CAAC,MAAM,EAAE,GAAG,IAAI,EAAE,EAAE;wBAC3B,IAAI,CAAC;4BACH,OAAO,IAAI,CAAC,OAAO,CAAO,IAAI,CAAuB,MAAM,CAAC,IAAI,CAAC,EAAQ,EAAE,IAAI,EAAE,IAAI,EAAE,CAAC,CAAC;wBAC3F,CAAC;wBAAC,OAAO,KAAc,EAAE,CAAC;4BACxB,MAAM,KAAK,CAAC;wBACd,CAAC;oBACH,CAAC;oBACD,QAAQ,EAAE,CAAC,MAAM,EAAE,GAAG,IAAI,EAAE,EAAE;wBAC5B,IAAI,CAAC;4BACH,OAAO,IAAI,CAAC,QAAQ,CAAO,IAAI,CAAuB,MAAM,CAAC,IAAI,CAAC,EAAQ,EAAE,IAAI,EAAE,IAAI,EAAE,CAAC,CAAC;wBAC5F,CAAC;wBAAC,OAAO,KAAc,EAAE,CAAC;4BACxB,MAAM,KAAK,CAAC;wBACd,CAAC;oBACH,CAAC;oBACD,QAAQ,EAAE,CAAC,MAAM,EAAE,GAAG,IAAI,EAAE,EAAE;wBAC5B,IAAI,CAAC;4BACH,OAAO,IAAI,CAAC,QAAQ,CAAO,IAAI,CAAuB,MAAM,CAAC,IAAI,CAAC,EAAQ,EAAE,IAAI,EAAE,IAAI,EAAE,CAAC,CAAC;wBAC5F,CAAC;wBAAC,OAAO,KAAc,EAAE,CAAC;4BACxB,MAAM,KAAK,CAAC;wBACd,CAAC;oBACH,CAAC;oBACD,QAAQ,EAAE,CAAC,MAAM,EAAE,GAAG,IAAI,EAAE,EAAE;wBAC5B,IAAI,CAAC;4BACH,OAAO,IAAI,CAAC,QAAQ,CAAO,IAAI,CAAuB,MAAM,CAAC,IAAI,CAAC,EAAQ,EAAE,IAAI,EAAE,IAAI,EAAE,CAAC,CAAC;wBAC5F,CAAC;wBAAC,OAAO,KAAc,EAAE,CAAC;4BACxB,MAAM,KAAK,CAAC;wBACd,CAAC;oBACH,CAAC;oBACD,QAAQ,EAAE,CAAC,MAAM,EAAE,GAAG,IAAI,EAAE,EAAE;wBAC5B,IAAI,CAAC;4BACH,OAAO,IAAI,CAAC,QAAQ,CAAO,IAAI,CAAuB,MAAM,CAAC,IAAI,CAAC,EAAQ,EAAE,IAAI,EAAE,IAAI,EAAE,CAAC,CAAC;wBAC5F,CAAC;wBAAC,OAAO,KAAc,EAAE,CAAC;4BACxB,MAAM,KAAK,CAAC;wBACd,CAAC;oBACH,CAAC;oBACD,QAAQ,EAAE,CAAC,MAAM,EAAE,GAAG,IAAI,EAAE,EAAE;wBAC5B,IAAI,CAAC;4BACH,OAAO,IAAI,CAAC,QAAQ,CAAO,IAAI,CAAuB,MAAM,CAAC,IAAI,CAAC,EAAQ,EAAE,IAAI,EAAE,IAAI,EAAE,CAAC,CAAC;wBAC5F,CAAC;wBAAC,OAAO,KAAc,EAAE,CAAC;4BACxB,MAAM,KAAK,CAAC;wBACd,CAAC;oBACH,CAAC;oBACD,QAAQ,EAAE,CAAC,MAAM,EAAE,GAAG,IAAI,EAAE,EAAE;wBAC5B,IAAI,CAAC;4BACH,OAAO,IAAI,CAAC,QAAQ,CAAO,IAAI,CAAuB,MAAM,CAAC,IAAI,CAAC,EAAQ,EAAE,IAAI,EAAE,IAAI,EAAE,CAAC,CAAC;wBAC5F,CAAC;wBAAC,OAAO,KAAc,EAAE,CAAC;4BACxB,MAAM,KAAK,CAAC;wBACd,CAAC;oBACH,CAAC;oBACD,QAAQ,EAAE,CAAC,MAAM,EAAE,GAAG,IAAI,EAAE,EAAE;wBAC5B,IAAI,CAAC;4BACH,OAAO,IAAI,CAAC,QAAQ,CAAO,IAAI,CAAuB,MAAM,CAAC,IAAI,CAAC,EAAQ,EAAE,IAAI,EAAE,IAAI,EAAE,CAAC,CAAC;wBAC5F,CAAC;wBAAC,OAAO,KAAc,EAAE,CAAC;4BACxB,MAAM,KAAK,CAAC;wBACd,CAAC;oBACH,CAAC;oBACD,QAAQ,EAAE,CAAC,MAAM,EAAE,GAAG,IAAI,EAAE,EAAE;wBAC5B,IAAI,CAAC;4BACH,OAAO,IAAI,CAAC,QAAQ,CAAO,IAAI,CAAuB,MAAM,CAAC,IAAI,CAAC,EAAQ,EAAE,IAAI,EAAE,IAAI,EAAE,CAAC,CAAC;wBAC5F,CAAC;wBAAC,OAAO,KAAc,EAAE,CAAC;4BACxB,MAAM,KAAK,CAAC;wBACd,CAAC;oBACH,CAAC;oBACD,QAAQ,EAAE,CAAC,MAAM,EAAE,GAAG,IAAI,EAAE,EAAE;wBAC5B,IAAI,CAAC;4BACH,OAAO,IAAI,CAAC,QAAQ,CAAO,IAAI,CAAuB,MAAM,CAAC,IAAI,CAAC,EAAQ,EAAE,IAAI,EAAE,IAAI,EAAE,CAAC,CAAC;wBAC5F,CAAC;wBAAC,OAAO,KAAc,EAAE,CAAC;4BACxB,MAAM,KAAK,CAAC;wBACd,CAAC;oBACH,CAAC;iBACF,CAAC;YACJ,CAAC;SACF;QACD,OAAiF,IAAI,QAAQ,EAAE,CAAC;IAClG,CAAC;CACF","sourcesContent":["import type { ILexerConfig, IParserConfig } from '@chevrotain/types';\nimport type {IToken, TokenType, TokenVocabulary} from 'chevrotain';\nimport { EmbeddedActionsParser, Lexer } from 'chevrotain';\nimport { DataFactory } from 'rdf-data-factory';\nimport type {\n  CheckOverlap,\n  RuleDefMap,\n  ParserFromRules,\n  RuleListToObject,\n  RuleNamesFromList,\n  ParseMethodsFromRules,\n} from './builderTypes';\nimport type { CstDef, ImplArgs, RuleDef } from './ruleDefTypes';\n\nfunction listToRuleDefMap<T extends readonly RuleDef[]>(rules: T): RuleListToObject<T> {\n  const newRules: Record<string, RuleDef> = {};\n  for (const rule of rules) {\n    newRules[rule.name] = rule;\n  }\n  return <RuleListToObject<T>>newRules;\n}\n\nexport class Builder<Names extends string, RuleDefs extends RuleDefMap<Names>> {\n  /**\n   * Create a builder with from some initial grammar rules or an existing builder.\n   * If a builder is provided, a new copy will be created.\n   */\n  public static createBuilder<\n    Rules extends readonly RuleDef[] = RuleDef[],\n    Names extends string = RuleNamesFromList<Rules>,\n    RuleDefs extends RuleDefMap<Names> = RuleListToObject<Rules>,\n>(start: Rules | Builder<Names, RuleDefs>): Builder<Names, RuleDefs> {\n    if (start instanceof Builder) {\n      return new Builder({ ...start.rules });\n    }\n    return <Builder<Names, RuleDefs>> <unknown> new Builder(listToRuleDefMap(start));\n  }\n\n  private rules: RuleDefs;\n\n  private constructor(startRules: RuleDefs) {\n    this.rules = startRules;\n  }\n\n  /**\n   * Change the implementation of an existing grammar rule.\n   */\n  public patchRule<U extends Names, RET, ARGS extends unknown[]>(patch: RuleDef<U, RET, ARGS>):\n  Builder<Names, {[Key in Names]: Key extends U ? RuleDef<Key, RET, ARGS> : (RuleDefs[Key] extends RuleDef<Key> ? RuleDefs[Key] : never) }> {\n    const self = <Builder<Names, {[Key in Names]: Key extends U ? RuleDef<Key, RET, ARGS> : (RuleDefs[Key] extends RuleDef<Key> ? RuleDefs[Key] : never) }>>\n      <unknown> this;\n    self.rules[patch.name] = <any> patch;\n    return self;\n  }\n\n  /**\n   * Add a rule to the grammar. If the rule already exists, but the implementation differs, an error will be thrown.\n   */\n  public addRuleRedundant<U extends string, RET, ARGS extends undefined[]>(rule: RuleDef<U, RET, ARGS>):\n  Builder<Names | U, {[K in Names | U]: K extends U ? RuleDef<K, RET, ARGS> : ( K extends Names ? (RuleDefs[K] extends RuleDef<K> ? RuleDefs[K] : never ) : never) }> {\n    const self = <Builder<Names | U, {[K in Names | U]: K extends U ? RuleDef<K, RET, ARGS> : ( K extends Names ? (RuleDefs[K] extends RuleDef<K> ? RuleDefs[K] : never ) : never) }>>\n      <unknown> this;\n    const rules = <Record<string, RuleDef>> self.rules;\n    if (rules[rule.name] !== undefined && rules[rule.name] !== rule) {\n      throw new Error(`Rule ${rule.name} already exists in the builder`);\n    }\n    rules[rule.name] = rule;\n    return self;\n  }\n\n  /**\n   * Add a rule to the grammar. Will raise a typescript error if the rule already exists in the grammar.\n   */\n  public addRule<U extends string, RET, ARGS extends unknown[]>(\n    rule: CheckOverlap<U, Names, RuleDef<U, RET, ARGS>>,\n  ): Builder<Names | U, {[K in Names | U]: K extends U ? RuleDef<K, RET, ARGS> : ( K extends Names ? (RuleDefs[K] extends RuleDef<K> ? RuleDefs[K] : never ) : never) }> {\n    return this.addRuleRedundant(rule);\n  }\n\n  public addMany<U extends RuleDef[]>(\n    ...rules: CheckOverlap<RuleNamesFromList<U>, Names, U>\n  ): Builder<\n    Names | RuleNamesFromList<U>,\n    {[K in Names | RuleNamesFromList<U>]:\n      K extends keyof RuleListToObject<typeof rules> ? (\n        RuleListToObject<typeof rules>[K] extends RuleDef<K> ? RuleListToObject<typeof rules>[K] : never\n      ) : (\n        K extends Names ? (RuleDefs[K] extends RuleDef<K> ? RuleDefs[K] : never) : never\n      )\n    }> {\n    this.rules = { ...this.rules, ...listToRuleDefMap(rules) };\n    return <any> <unknown> this;\n  }\n\n  public deleteRule<U extends Names>(ruleName: U):\n  Builder<Exclude<Names, U>, { [K in Exclude<Names, U>]: RuleDefs[K] extends RuleDef<K> ? RuleDefs[K] : never }> {\n    delete this.rules[ruleName];\n    return <Builder<Exclude<Names, U>, { [K in Exclude<Names, U>]: RuleDefs[K] extends RuleDef<K> ? RuleDefs[K] : never }>>\n      <unknown> this;\n  }\n\n  public merge<OtherNames extends string, OtherRules extends RuleDefMap<OtherNames>, OW extends readonly RuleDef[]>(\n    builder: Builder<OtherNames, OtherRules>,\n    overridingRules: OW,\n  ):\n    Builder<\n      Names | OtherNames | RuleNamesFromList<OW>,\n      {[K in Names | OtherNames | RuleNamesFromList<OW>]:\n        K extends keyof RuleListToObject<OW> ? (\n          RuleListToObject<OW>[K] extends RuleDef<K> ? RuleListToObject<OW>[K] : never\n        )\n        : (\n          K extends Names ? (RuleDefs[K] extends RuleDef<K> ? RuleDefs[K] : never)\n          : K extends OtherNames ? (OtherRules[K] extends RuleDef<K> ? OtherRules[K] : never) : never\n        )}> {\n    // Assume the other grammar is bigger than yours. So start from that one and add this one\n    const otherRules: Record<string, RuleDef> = { ...builder.rules };\n    const myRules: Record<string, RuleDef> = this.rules;\n\n    for (const rule of Object.values(myRules)) {\n      if (otherRules[rule.name] === undefined) {\n        otherRules[rule.name] = rule;\n      } else {\n        const existingRule = otherRules[rule.name];\n        // If same rule, no issue, move on. Else\n        if (existingRule !== rule) {\n          const override = overridingRules.find(x => x.name === rule.name);\n          // If override specified, take override, else, inform user that there is a conflict\n          if (override) {\n            otherRules[rule.name] = override;\n          } else {\n            throw new Error(`Rule with name \"${rule.name}\" already exists in the builder, specify an override to resolve conflict`);\n          }\n        }\n      }\n    }\n\n    this.rules = <any> <unknown> otherRules;\n    return <any> <unknown> this;\n  }\n\n  public consumeToParser({ tokenVocabulary, parserConfig = {}, lexerConfig = {}}: {\n    tokenVocabulary: TokenType[];\n    parserConfig?: IParserConfig;\n    lexerConfig?: ILexerConfig;\n  }, context: Partial<ImplArgs['context']> = {}): ParserFromRules<Names, RuleDefs> {\n    const lexer: Lexer = new Lexer(tokenVocabulary, {\n      positionTracking: 'onlyStart',\n      recoveryEnabled: false,\n      // SafeMode: true,\n      // SkipValidations: true,\n      ensureOptimizations: true,\n      ...lexerConfig,\n    });\n    const parser = this.consume({ tokenVocabulary, config: parserConfig }, context);\n    const selfSufficientParser: Partial<ParserFromRules<Names, RuleDefs>> = {};\n    // eslint-disable-next-line ts/no-unnecessary-type-assertion\n    for (const rule of <RuleDef<Names>[]> Object.values(this.rules)) {\n      selfSufficientParser[rule.name] = <any> ((input: string, ...args: unknown[]) => {\n        // Transform input in accordance to 19.2\n        input = input.replaceAll(\n          /\\\\u([0-9a-fA-F]{4})|\\\\U([0-9a-fA-F]{8})/gu,\n          (_, unicode4: string, unicode8: string) => {\n            if (unicode4) {\n              const charCode = Number.parseInt(unicode4, 16);\n              return String.fromCodePoint(charCode);\n            }\n            const charCode = Number.parseInt(unicode8, 16);\n            if (charCode < 0xFFFF) {\n              return String.fromCodePoint(charCode);\n            }\n            const substractedCharCode = charCode - 0x10000;\n            return String.fromCodePoint(0xD800 + (substractedCharCode >> 10), 0xDC00 + (substractedCharCode & 0x3FF));\n          },\n        );\n        // Test for invalid unicode surrogate pairs\n        if (/[\\uD800-\\uDBFF]([^\\uDC00-\\uDFFF]|$)/u.test(input)) {\n          throw new Error(`Invalid unicode codepoint of surrogate pair without corresponding codepoint`);\n        }\n\n        const lexResult = lexer.tokenize(input);\n        // Console.log(lexResult.tokens);\n\n        parser.reset();\n        parser.input = lexResult.tokens;\n        const result = parser[rule.name](...args);\n        if (parser.errors.length > 0) {\n          // Console.log(lexResult.tokens);\n          throw new Error(`Parse error on line ${parser.errors.map(x => x.token.startLine).join(', ')}\n${parser.errors.map(x => `${x.token.startLine}: ${x.message}`).join('\\n')}`);\n        }\n        return result;\n      });\n    }\n    return <ParserFromRules<Names, RuleDefs>> selfSufficientParser;\n  }\n\n  public consume({ tokenVocabulary, config = {}}: {\n    tokenVocabulary: TokenVocabulary;\n    config?: IParserConfig;\n  }, context: Partial<ImplArgs['context']> = {}): EmbeddedActionsParser & ParseMethodsFromRules<Names, RuleDefs> {\n    const rules = this.rules;\n    class MyParser extends EmbeddedActionsParser {\n      private readonly initialParseContext: ImplArgs['context'];\n      private readonly runningContext: ImplArgs['context'];\n\n      public constructor() {\n        super(tokenVocabulary, {\n          // RecoveryEnabled: true,\n          maxLookahead: 2,\n          // SkipValidations: true,\n          ...config,\n        });\n\n        const selfRef = this.getSelfRef();\n        // Remember to change the reset function accordingly!\n        this.initialParseContext = {\n          dataFactory: new DataFactory({ blankNodePrefix: 'g_' }),\n          baseIRI: undefined,\n          flushedBlankNodeLabels: new Set(),\n          usedBlankNodeLabels: new Set(),\n          parseMode: new Set(),\n          skipValidation: false,\n          ...context,\n          prefixes: context.prefixes ? { ...context.prefixes } : {},\n        };\n        this.runningContext = {\n          ...this.initialParseContext,\n          prefixes: { ...this.initialParseContext.prefixes },\n          parseMode: new Set(this.initialParseContext.parseMode),\n        };\n\n        const implArgs: ImplArgs = {\n          ...selfRef,\n          cache: new WeakMap(),\n          context: this.runningContext,\n        };\n\n        for (const rule of Object.values(<Record<string, RuleDef>>rules)) {\n          this[<keyof (typeof this)> rule.name] = <any> this.RULE(rule.name, rule.impl(implArgs));\n        }\n        this.performSelfAnalysis();\n      }\n\n      public override reset(): void {\n        super.reset();\n        // We need to keep the original object reference.\n        Object.assign(this.runningContext, {\n          ...this.initialParseContext,\n        });\n        this.runningContext.prefixes = { ...this.initialParseContext.prefixes };\n        this.runningContext.parseMode = new Set(this.initialParseContext.parseMode);\n        this.runningContext.usedBlankNodeLabels.clear();\n        this.runningContext.flushedBlankNodeLabels.clear();\n      }\n\n      private getSelfRef(): CstDef {\n        return {\n          CONSUME: (tokenType, option) => this.CONSUME(tokenType, option),\n          CONSUME1: (tokenType, option) => this.CONSUME1(tokenType, option),\n          CONSUME2: (tokenType, option) => this.CONSUME2(tokenType, option),\n          CONSUME3: (tokenType, option) => this.CONSUME3(tokenType, option),\n          CONSUME4: (tokenType, option) => this.CONSUME4(tokenType, option),\n          CONSUME5: (tokenType, option) => this.CONSUME5(tokenType, option),\n          CONSUME6: (tokenType, option) => this.CONSUME6(tokenType, option),\n          CONSUME7: (tokenType, option) => this.CONSUME7(tokenType, option),\n          CONSUME8: (tokenType, option) => this.CONSUME8(tokenType, option),\n          CONSUME9: (tokenType, option) => this.CONSUME9(tokenType, option),\n          OPTION: actionORMethodDef => this.OPTION(actionORMethodDef),\n          OPTION1: actionORMethodDef => this.OPTION1(actionORMethodDef),\n          OPTION2: actionORMethodDef => this.OPTION2(actionORMethodDef),\n          OPTION3: actionORMethodDef => this.OPTION3(actionORMethodDef),\n          OPTION4: actionORMethodDef => this.OPTION4(actionORMethodDef),\n          OPTION5: actionORMethodDef => this.OPTION5(actionORMethodDef),\n          OPTION6: actionORMethodDef => this.OPTION6(actionORMethodDef),\n          OPTION7: actionORMethodDef => this.OPTION7(actionORMethodDef),\n          OPTION8: actionORMethodDef => this.OPTION8(actionORMethodDef),\n          OPTION9: actionORMethodDef => this.OPTION9(actionORMethodDef),\n          OR: altsOrOpts => this.OR(altsOrOpts),\n          OR1: altsOrOpts => this.OR1(altsOrOpts),\n          OR2: altsOrOpts => this.OR2(altsOrOpts),\n          OR3: altsOrOpts => this.OR3(altsOrOpts),\n          OR4: altsOrOpts => this.OR4(altsOrOpts),\n          OR5: altsOrOpts => this.OR5(altsOrOpts),\n          OR6: altsOrOpts => this.OR6(altsOrOpts),\n          OR7: altsOrOpts => this.OR7(altsOrOpts),\n          OR8: altsOrOpts => this.OR8(altsOrOpts),\n          OR9: altsOrOpts => this.OR9(altsOrOpts),\n          MANY: actionORMethodDef => this.MANY(actionORMethodDef),\n          MANY1: actionORMethodDef => this.MANY1(actionORMethodDef),\n          MANY2: actionORMethodDef => this.MANY2(actionORMethodDef),\n          MANY3: actionORMethodDef => this.MANY3(actionORMethodDef),\n          MANY4: actionORMethodDef => this.MANY4(actionORMethodDef),\n          MANY5: actionORMethodDef => this.MANY5(actionORMethodDef),\n          MANY6: actionORMethodDef => this.MANY6(actionORMethodDef),\n          MANY7: actionORMethodDef => this.MANY7(actionORMethodDef),\n          MANY8: actionORMethodDef => this.MANY8(actionORMethodDef),\n          MANY9: actionORMethodDef => this.MANY9(actionORMethodDef),\n          MANY_SEP: options => this.MANY_SEP(options),\n          MANY_SEP1: options => this.MANY_SEP1(options),\n          MANY_SEP2: options => this.MANY_SEP2(options),\n          MANY_SEP3: options => this.MANY_SEP3(options),\n          MANY_SEP4: options => this.MANY_SEP4(options),\n          MANY_SEP5: options => this.MANY_SEP5(options),\n          MANY_SEP6: options => this.MANY_SEP6(options),\n          MANY_SEP7: options => this.MANY_SEP7(options),\n          MANY_SEP8: options => this.MANY_SEP8(options),\n          MANY_SEP9: options => this.MANY_SEP9(options),\n          AT_LEAST_ONE: actionORMethodDef => this.AT_LEAST_ONE(actionORMethodDef),\n          AT_LEAST_ONE1: actionORMethodDef => this.AT_LEAST_ONE1(actionORMethodDef),\n          AT_LEAST_ONE2: actionORMethodDef => this.AT_LEAST_ONE2(actionORMethodDef),\n          AT_LEAST_ONE3: actionORMethodDef => this.AT_LEAST_ONE3(actionORMethodDef),\n          AT_LEAST_ONE4: actionORMethodDef => this.AT_LEAST_ONE4(actionORMethodDef),\n          AT_LEAST_ONE5: actionORMethodDef => this.AT_LEAST_ONE5(actionORMethodDef),\n          AT_LEAST_ONE6: actionORMethodDef => this.AT_LEAST_ONE6(actionORMethodDef),\n          AT_LEAST_ONE7: actionORMethodDef => this.AT_LEAST_ONE7(actionORMethodDef),\n          AT_LEAST_ONE8: actionORMethodDef => this.AT_LEAST_ONE8(actionORMethodDef),\n          AT_LEAST_ONE9: actionORMethodDef => this.AT_LEAST_ONE9(actionORMethodDef),\n          AT_LEAST_ONE_SEP: options => this.AT_LEAST_ONE_SEP(options),\n          AT_LEAST_ONE_SEP1: options => this.AT_LEAST_ONE_SEP1(options),\n          AT_LEAST_ONE_SEP2: options => this.AT_LEAST_ONE_SEP2(options),\n          AT_LEAST_ONE_SEP3: options => this.AT_LEAST_ONE_SEP3(options),\n          AT_LEAST_ONE_SEP4: options => this.AT_LEAST_ONE_SEP4(options),\n          AT_LEAST_ONE_SEP5: options => this.AT_LEAST_ONE_SEP5(options),\n          AT_LEAST_ONE_SEP6: options => this.AT_LEAST_ONE_SEP6(options),\n          AT_LEAST_ONE_SEP7: options => this.AT_LEAST_ONE_SEP7(options),\n          AT_LEAST_ONE_SEP8: options => this.AT_LEAST_ONE_SEP8(options),\n          AT_LEAST_ONE_SEP9: options => this.AT_LEAST_ONE_SEP9(options),\n          ACTION: func => this.ACTION(func),\n          BACKTRACK: (cstDef, ...args) => {\n            try {\n              return this.BACKTRACK(<any> this[<keyof (typeof this)> cstDef.name], <any> { ARGS: args });\n            } catch (error: unknown) {\n              throw error;\n            }\n          },\n          SUBRULE: (cstDef, ...args) => {\n            try {\n              return this.SUBRULE(<any> this[<keyof (typeof this)> cstDef.name], <any> { ARGS: args });\n            } catch (error: unknown) {\n              throw error;\n            }\n          },\n          SUBRULE1: (cstDef, ...args) => {\n            try {\n              return this.SUBRULE1(<any> this[<keyof (typeof this)> cstDef.name], <any> { ARGS: args });\n            } catch (error: unknown) {\n              throw error;\n            }\n          },\n          SUBRULE2: (cstDef, ...args) => {\n            try {\n              return this.SUBRULE2(<any> this[<keyof (typeof this)> cstDef.name], <any> { ARGS: args });\n            } catch (error: unknown) {\n              throw error;\n            }\n          },\n          SUBRULE3: (cstDef, ...args) => {\n            try {\n              return this.SUBRULE3(<any> this[<keyof (typeof this)> cstDef.name], <any> { ARGS: args });\n            } catch (error: unknown) {\n              throw error;\n            }\n          },\n          SUBRULE4: (cstDef, ...args) => {\n            try {\n              return this.SUBRULE4(<any> this[<keyof (typeof this)> cstDef.name], <any> { ARGS: args });\n            } catch (error: unknown) {\n              throw error;\n            }\n          },\n          SUBRULE5: (cstDef, ...args) => {\n            try {\n              return this.SUBRULE5(<any> this[<keyof (typeof this)> cstDef.name], <any> { ARGS: args });\n            } catch (error: unknown) {\n              throw error;\n            }\n          },\n          SUBRULE6: (cstDef, ...args) => {\n            try {\n              return this.SUBRULE6(<any> this[<keyof (typeof this)> cstDef.name], <any> { ARGS: args });\n            } catch (error: unknown) {\n              throw error;\n            }\n          },\n          SUBRULE7: (cstDef, ...args) => {\n            try {\n              return this.SUBRULE7(<any> this[<keyof (typeof this)> cstDef.name], <any> { ARGS: args });\n            } catch (error: unknown) {\n              throw error;\n            }\n          },\n          SUBRULE8: (cstDef, ...args) => {\n            try {\n              return this.SUBRULE8(<any> this[<keyof (typeof this)> cstDef.name], <any> { ARGS: args });\n            } catch (error: unknown) {\n              throw error;\n            }\n          },\n          SUBRULE9: (cstDef, ...args) => {\n            try {\n              return this.SUBRULE9(<any> this[<keyof (typeof this)> cstDef.name], <any> { ARGS: args });\n            } catch (error: unknown) {\n              throw error;\n            }\n          },\n        };\n      }\n    }\n    return <EmbeddedActionsParser & ParseMethodsFromRules<Names, RuleDefs>><unknown> new MyParser();\n  }\n}\n"]}
+{"version":3,"file":"parserBuilder.js","sourceRoot":"","sources":["parserBuilder.ts"],"names":[],"mappings":"AAEA,OAAO,EAAE,qBAAqB,EAAE,KAAK,EAAE,MAAM,YAAY,CAAC;AAC1D,OAAO,EAAE,WAAW,EAAE,MAAM,kBAAkB,CAAC;AAW/C,SAAS,gBAAgB,CAA+B,KAAQ;IAC9D,MAAM,QAAQ,GAA4B,EAAE,CAAC;IAC7C,KAAK,MAAM,IAAI,IAAI,KAAK,EAAE,CAAC;QACzB,QAAQ,CAAC,IAAI,CAAC,IAAI,CAAC,GAAG,IAAI,CAAC;IAC7B,CAAC;IACD,OAA4B,QAAQ,CAAC;AACvC,CAAC;AAED,MAAM,OAAO,OAAO;IAClB;;;OAGG;IACI,MAAM,CAAC,aAAa,CAI3B,KAAuC;QACrC,IAAI,KAAK,YAAY,OAAO,EAAE,CAAC;YAC7B,OAAO,IAAI,OAAO,CAAC,EAAE,GAAG,KAAK,CAAC,KAAK,EAAE,CAAC,CAAC;QACzC,CAAC;QACD,OAA4C,IAAI,OAAO,CAAC,gBAAgB,CAAC,KAAK,CAAC,CAAC,CAAC;IACnF,CAAC;IAID,YAAoB,UAAoB;QACtC,IAAI,CAAC,KAAK,GAAG,UAAU,CAAC;IAC1B,CAAC;IAED;;OAEG;IACI,SAAS,CAA+C,KAA4B;QAEzF,MAAM,IAAI,GACE,IAAI,CAAC;QACjB,IAAI,CAAC,KAAK,CAAC,KAAK,CAAC,IAAI,CAAC,GAAS,KAAK,CAAC;QACrC,OAAO,IAAI,CAAC;IACd,CAAC;IAED;;OAEG;IACI,gBAAgB,CAAgD,IAA2B;QAEhG,MAAM,IAAI,GACE,IAAI,CAAC;QACjB,MAAM,KAAK,GAA6B,IAAI,CAAC,KAAK,CAAC;QACnD,IAAI,KAAK,CAAC,IAAI,CAAC,IAAI,CAAC,KAAK,SAAS,IAAI,KAAK,CAAC,IAAI,CAAC,IAAI,CAAC,KAAK,IAAI,EAAE,CAAC;YAChE,MAAM,IAAI,KAAK,CAAC,QAAQ,IAAI,CAAC,IAAI,gCAAgC,CAAC,CAAC;QACrE,CAAC;QACD,KAAK,CAAC,IAAI,CAAC,IAAI,CAAC,GAAG,IAAI,CAAC;QACxB,OAAO,IAAI,CAAC;IACd,CAAC;IAED;;OAEG;IACI,OAAO,CACZ,IAAmD;QAEnD,OAAO,IAAI,CAAC,gBAAgB,CAAC,IAAI,CAAC,CAAC;IACrC,CAAC;IAEM,OAAO,CACZ,GAAG,KAAmD;QAUtD,IAAI,CAAC,KAAK,GAAG,EAAE,GAAG,IAAI,CAAC,KAAK,EAAE,GAAG,gBAAgB,CAAC,KAAK,CAAC,EAAE,CAAC;QAC3D,OAAuB,IAAI,CAAC;IAC9B,CAAC;IAEM,UAAU,CAAkB,QAAW;QAE5C,OAAO,IAAI,CAAC,KAAK,CAAC,QAAQ,CAAC,CAAC;QAC5B,OACY,IAAI,CAAC;IACnB,CAAC;IAEM,KAAK,CACV,OAAwC,EACxC,eAAmB;QAYnB,yFAAyF;QACzF,MAAM,UAAU,GAA4B,EAAE,GAAG,OAAO,CAAC,KAAK,EAAE,CAAC;QACjE,MAAM,OAAO,GAA4B,IAAI,CAAC,KAAK,CAAC;QAEpD,KAAK,MAAM,IAAI,IAAI,MAAM,CAAC,MAAM,CAAC,OAAO,CAAC,EAAE,CAAC;YAC1C,IAAI,UAAU,CAAC,IAAI,CAAC,IAAI,CAAC,KAAK,SAAS,EAAE,CAAC;gBACxC,UAAU,CAAC,IAAI,CAAC,IAAI,CAAC,GAAG,IAAI,CAAC;YAC/B,CAAC;iBAAM,CAAC;gBACN,MAAM,YAAY,GAAG,UAAU,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC;gBAC3C,wCAAwC;gBACxC,IAAI,YAAY,KAAK,IAAI,EAAE,CAAC;oBAC1B,MAAM,QAAQ,GAAG,eAAe,CAAC,IAAI,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC,IAAI,KAAK,IAAI,CAAC,IAAI,CAAC,CAAC;oBACjE,mFAAmF;oBACnF,IAAI,QAAQ,EAAE,CAAC;wBACb,UAAU,CAAC,IAAI,CAAC,IAAI,CAAC,GAAG,QAAQ,CAAC;oBACnC,CAAC;yBAAM,CAAC;wBACN,MAAM,IAAI,KAAK,CAAC,mBAAmB,IAAI,CAAC,IAAI,0EAA0E,CAAC,CAAC;oBAC1H,CAAC;gBACH,CAAC;YACH,CAAC;QACH,CAAC;QAED,IAAI,CAAC,KAAK,GAAmB,UAAU,CAAC;QACxC,OAAuB,IAAI,CAAC;IAC9B,CAAC;IAEM,eAAe,CAAC,EAAE,eAAe,EAAE,YAAY,GAAG,EAAE,EAAE,WAAW,GAAG,EAAE,EAI5E,EAAE,UAAwC,EAAE;QAC3C,MAAM,KAAK,GAAU,IAAI,KAAK,CAAC,eAAe,EAAE;YAC9C,gBAAgB,EAAE,WAAW;YAC7B,eAAe,EAAE,KAAK;YACtB,kBAAkB;YAClB,yBAAyB;YACzB,mBAAmB,EAAE,IAAI;YACzB,GAAG,WAAW;SACf,CAAC,CAAC;QACH,MAAM,MAAM,GAAG,IAAI,CAAC,OAAO,CAAC,EAAE,eAAe,EAAE,MAAM,EAAE,YAAY,EAAE,EAAE,OAAO,CAAC,CAAC;QAChF,MAAM,oBAAoB,GAA8C,EAAE,CAAC;QAC3E,4DAA4D;QAC5D,KAAK,MAAM,IAAI,IAAuB,MAAM,CAAC,MAAM,CAAC,IAAI,CAAC,KAAK,CAAC,EAAE,CAAC;YAChE,oBAAoB,CAAC,IAAI,CAAC,IAAI,CAAC,GAAS,CAAC,CAAC,KAAa,EAAE,GAAY,EAAE,EAAE;gBACvE,wCAAwC;gBACxC,KAAK,GAAG,KAAK,CAAC,UAAU,CACtB,2CAA2C,EAC3C,CAAC,CAAC,EAAE,QAAgB,EAAE,QAAgB,EAAE,EAAE;oBACxC,IAAI,QAAQ,EAAE,CAAC;wBACb,MAAM,QAAQ,GAAG,MAAM,CAAC,QAAQ,CAAC,QAAQ,EAAE,EAAE,CAAC,CAAC;wBAC/C,OAAO,MAAM,CAAC,aAAa,CAAC,QAAQ,CAAC,CAAC;oBACxC,CAAC;oBACD,MAAM,QAAQ,GAAG,MAAM,CAAC,QAAQ,CAAC,QAAQ,EAAE,EAAE,CAAC,CAAC;oBAC/C,IAAI,QAAQ,GAAG,MAAM,EAAE,CAAC;wBACtB,OAAO,MAAM,CAAC,aAAa,CAAC,QAAQ,CAAC,CAAC;oBACxC,CAAC;oBACD,MAAM,mBAAmB,GAAG,QAAQ,GAAG,OAAO,CAAC;oBAC/C,OAAO,MAAM,CAAC,aAAa,CAAC,MAAM,GAAG,CAAC,mBAAmB,IAAI,EAAE,CAAC,EAAE,MAAM,GAAG,CAAC,mBAAmB,GAAG,KAAK,CAAC,CAAC,CAAC;gBAC5G,CAAC,CACF,CAAC;gBACF,2CAA2C;gBAC3C,IAAI,sCAAsC,CAAC,IAAI,CAAC,KAAK,CAAC,EAAE,CAAC;oBACvD,MAAM,IAAI,KAAK,CAAC,6EAA6E,CAAC,CAAC;gBACjG,CAAC;gBAED,MAAM,SAAS,GAAG,KAAK,CAAC,QAAQ,CAAC,KAAK,CAAC,CAAC;gBACxC,iCAAiC;gBAEjC,MAAM,CAAC,KAAK,EAAE,CAAC;gBACf,MAAM,CAAC,KAAK,GAAG,SAAS,CAAC,MAAM,CAAC;gBAChC,MAAM,MAAM,GAAG,MAAM,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC,GAAG,CAAC,CAAC;gBACtC,IAAI,MAAM,CAAC,MAAM,CAAC,MAAM,GAAG,CAAC,EAAE,CAAC;oBAC7B,iCAAiC;oBACjC,MAAM,IAAI,KAAK,CAAC,uBAAuB,MAAM,CAAC,MAAM,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC,KAAK,CAAC,SAAS,CAAC,CAAC,IAAI,CAAC,IAAI,CAAC;EACnG,MAAM,CAAC,MAAM,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,CAAC,GAAG,CAAC,CAAC,KAAK,CAAC,SAAS,KAAK,CAAC,CAAC,OAAO,EAAE,CAAC,CAAC,IAAI,CAAC,IAAI,CAAC,EAAE,CAAC,CAAC;gBACrE,CAAC;gBACD,OAAO,MAAM,CAAC;YAChB,CAAC,CAAC,CAAC;QACL,CAAC;QACD,OAA0C,oBAAoB,CAAC;IACjE,CAAC;IAEM,OAAO,CAAC,EAAE,eAAe,EAAE,MAAM,GAAG,EAAE,EAG5C,EAAE,UAAwC,EAAE;QAC3C,MAAM,KAAK,GAAG,IAAI,CAAC,KAAK,CAAC;QACzB,MAAM,QAAS,SAAQ,qBAAqB;YAI1C;gBACE,KAAK,CAAC,eAAe,EAAE;oBACrB,yBAAyB;oBACzB,YAAY,EAAE,CAAC;oBACf,yBAAyB;oBACzB,GAAG,MAAM;iBACV,CAAC,CAAC;gBAEH,MAAM,OAAO,GAAG,IAAI,CAAC,UAAU,EAAE,CAAC;gBAClC,4DAA4D;gBAC5D,IAAI,CAAC,mBAAmB,GAAG;oBACzB,WAAW,EAAE,IAAI,WAAW,CAAC,EAAE,eAAe,EAAE,IAAI,EAAE,CAAC;oBACvD,OAAO,EAAE,SAAS;oBAClB,SAAS,EAAE,IAAI,GAAG,EAAE;oBACpB,cAAc,EAAE,KAAK;oBACrB,GAAG,OAAO;oBACV,QAAQ,EAAE,OAAO,CAAC,QAAQ,CAAC,CAAC,CAAC,EAAE,GAAG,OAAO,CAAC,QAAQ,EAAE,CAAC,CAAC,CAAC,EAAE;iBAC1D,CAAC;gBACF,IAAI,CAAC,cAAc,GAAG;oBACpB,GAAG,IAAI,CAAC,mBAAmB;oBAC3B,QAAQ,EAAE,EAAE,GAAG,IAAI,CAAC,mBAAmB,CAAC,QAAQ,EAAE;oBAClD,SAAS,EAAE,IAAI,GAAG,CAAC,IAAI,CAAC,mBAAmB,CAAC,SAAS,CAAC;iBACvD,CAAC;gBAEF,MAAM,QAAQ,GAAa;oBACzB,GAAG,OAAO;oBACV,KAAK,EAAE,IAAI,OAAO,EAAE;oBACpB,OAAO,EAAE,IAAI,CAAC,cAAc;iBAC7B,CAAC;gBAEF,KAAK,MAAM,IAAI,IAAI,MAAM,CAAC,MAAM,CAA0B,KAAK,CAAC,EAAE,CAAC;oBACjE,IAAI,CAAuB,IAAI,CAAC,IAAI,CAAC,GAAS,IAAI,CAAC,IAAI,CAAC,IAAI,CAAC,IAAI,EAAE,IAAI,CAAC,IAAI,CAAC,QAAQ,CAAC,CAAC,CAAC;gBAC1F,CAAC;gBACD,IAAI,CAAC,mBAAmB,EAAE,CAAC;YAC7B,CAAC;YAEe,KAAK;gBACnB,KAAK,CAAC,KAAK,EAAE,CAAC;gBACd,iDAAiD;gBACjD,MAAM,CAAC,MAAM,CAAC,IAAI,CAAC,cAAc,EAAE;oBACjC,GAAG,IAAI,CAAC,mBAAmB;iBAC5B,CAAC,CAAC;gBACH,IAAI,CAAC,cAAc,CAAC,QAAQ,GAAG,EAAE,GAAG,IAAI,CAAC,mBAAmB,CAAC,QAAQ,EAAE,CAAC;gBACxE,IAAI,CAAC,cAAc,CAAC,SAAS,GAAG,IAAI,GAAG,CAAC,IAAI,CAAC,mBAAmB,CAAC,SAAS,CAAC,CAAC;YAC9E,CAAC;YAEO,UAAU;gBAChB,MAAM,WAAW,GAAG,CAAC,OAA4B,EAAqB,EAAE;oBACtE,OAAO,CAAC,CAAC,MAAM,EAAE,GAAG,IAAI,EAAE,EAAE;wBAC1B,OAAO,OAAO,CAAO,IAAI,CAAuB,MAAM,CAAC,IAAI,CAAC,EAAQ,EAAE,IAAI,EAAE,IAAI,EAAE,CAAC,CAAC;oBACtF,CAAC,CAA6B,CAAC;gBACjC,CAAC,CAAA;gBACD,OAAO;oBACL,OAAO,EAAE,CAAC,SAAS,EAAE,MAAM,EAAE,EAAE,CAAC,IAAI,CAAC,OAAO,CAAC,SAAS,EAAE,MAAM,CAAC;oBAC/D,QAAQ,EAAE,CAAC,SAAS,EAAE,MAAM,EAAE,EAAE,CAAC,IAAI,CAAC,QAAQ,CAAC,SAAS,EAAE,MAAM,CAAC;oBACjE,QAAQ,EAAE,CAAC,SAAS,EAAE,MAAM,EAAE,EAAE,CAAC,IAAI,CAAC,QAAQ,CAAC,SAAS,EAAE,MAAM,CAAC;oBACjE,QAAQ,EAAE,CAAC,SAAS,EAAE,MAAM,EAAE,EAAE,CAAC,IAAI,CAAC,QAAQ,CAAC,SAAS,EAAE,MAAM,CAAC;oBACjE,QAAQ,EAAE,CAAC,SAAS,EAAE,MAAM,EAAE,EAAE,CAAC,IAAI,CAAC,QAAQ,CAAC,SAAS,EAAE,MAAM,CAAC;oBACjE,QAAQ,EAAE,CAAC,SAAS,EAAE,MAAM,EAAE,EAAE,CAAC,IAAI,CAAC,QAAQ,CAAC,SAAS,EAAE,MAAM,CAAC;oBACjE,QAAQ,EAAE,CAAC,SAAS,EAAE,MAAM,EAAE,EAAE,CAAC,IAAI,CAAC,QAAQ,CAAC,SAAS,EAAE,MAAM,CAAC;oBACjE,QAAQ,EAAE,CAAC,SAAS,EAAE,MAAM,EAAE,EAAE,CAAC,IAAI,CAAC,QAAQ,CAAC,SAAS,EAAE,MAAM,CAAC;oBACjE,QAAQ,EAAE,CAAC,SAAS,EAAE,MAAM,EAAE,EAAE,CAAC,IAAI,CAAC,QAAQ,CAAC,SAAS,EAAE,MAAM,CAAC;oBACjE,QAAQ,EAAE,CAAC,SAAS,EAAE,MAAM,EAAE,EAAE,CAAC,IAAI,CAAC,QAAQ,CAAC,SAAS,EAAE,MAAM,CAAC;oBACjE,MAAM,EAAE,iBAAiB,CAAC,EAAE,CAAC,IAAI,CAAC,MAAM,CAAC,iBAAiB,CAAC;oBAC3D,OAAO,EAAE,iBAAiB,CAAC,EAAE,CAAC,IAAI,CAAC,OAAO,CAAC,iBAAiB,CAAC;oBAC7D,OAAO,EAAE,iBAAiB,CAAC,EAAE,CAAC,IAAI,CAAC,OAAO,CAAC,iBAAiB,CAAC;oBAC7D,OAAO,EAAE,iBAAiB,CAAC,EAAE,CAAC,IAAI,CAAC,OAAO,CAAC,iBAAiB,CAAC;oBAC7D,OAAO,EAAE,iBAAiB,CAAC,EAAE,CAAC,IAAI,CAAC,OAAO,CAAC,iBAAiB,CAAC;oBAC7D,OAAO,EAAE,iBAAiB,CAAC,EAAE,CAAC,IAAI,CAAC,OAAO,CAAC,iBAAiB,CAAC;oBAC7D,OAAO,EAAE,iBAAiB,CAAC,EAAE,CAAC,IAAI,CAAC,OAAO,CAAC,iBAAiB,CAAC;oBAC7D,OAAO,EAAE,iBAAiB,CAAC,EAAE,CAAC,IAAI,CAAC,OAAO,CAAC,iBAAiB,CAAC;oBAC7D,OAAO,EAAE,iBAAiB,CAAC,EAAE,CAAC,IAAI,CAAC,OAAO,CAAC,iBAAiB,CAAC;oBAC7D,OAAO,EAAE,iBAAiB,CAAC,EAAE,CAAC,IAAI,CAAC,OAAO,CAAC,iBAAiB,CAAC;oBAC7D,EAAE,EAAE,UAAU,CAAC,EAAE,CAAC,IAAI,CAAC,EAAE,CAAC,UAAU,CAAC;oBACrC,GAAG,EAAE,UAAU,CAAC,EAAE,CAAC,IAAI,CAAC,GAAG,CAAC,UAAU,CAAC;oBACvC,GAAG,EAAE,UAAU,CAAC,EAAE,CAAC,IAAI,CAAC,GAAG,CAAC,UAAU,CAAC;oBACvC,GAAG,EAAE,UAAU,CAAC,EAAE,CAAC,IAAI,CAAC,GAAG,CAAC,UAAU,CAAC;oBACvC,GAAG,EAAE,UAAU,CAAC,EAAE,CAAC,IAAI,CAAC,GAAG,CAAC,UAAU,CAAC;oBACvC,GAAG,EAAE,UAAU,CAAC,EAAE,CAAC,IAAI,CAAC,GAAG,CAAC,UAAU,CAAC;oBACvC,GAAG,EAAE,UAAU,CAAC,EAAE,CAAC,IAAI,CAAC,GAAG,CAAC,UAAU,CAAC;oBACvC,GAAG,EAAE,UAAU,CAAC,EAAE,CAAC,IAAI,CAAC,GAAG,CAAC,UAAU,CAAC;oBACvC,GAAG,EAAE,UAAU,CAAC,EAAE,CAAC,IAAI,CAAC,GAAG,CAAC,UAAU,CAAC;oBACvC,GAAG,EAAE,UAAU,CAAC,EAAE,CAAC,IAAI,CAAC,GAAG,CAAC,UAAU,CAAC;oBACvC,IAAI,EAAE,iBAAiB,CAAC,EAAE,CAAC,IAAI,CAAC,IAAI,CAAC,iBAAiB,CAAC;oBACvD,KAAK,EAAE,iBAAiB,CAAC,EAAE,CAAC,IAAI,CAAC,KAAK,CAAC,iBAAiB,CAAC;oBACzD,KAAK,EAAE,iBAAiB,CAAC,EAAE,CAAC,IAAI,CAAC,KAAK,CAAC,iBAAiB,CAAC;oBACzD,KAAK,EAAE,iBAAiB,CAAC,EAAE,CAAC,IAAI,CAAC,KAAK,CAAC,iBAAiB,CAAC;oBACzD,KAAK,EAAE,iBAAiB,CAAC,EAAE,CAAC,IAAI,CAAC,KAAK,CAAC,iBAAiB,CAAC;oBACzD,KAAK,EAAE,iBAAiB,CAAC,EAAE,CAAC,IAAI,CAAC,KAAK,CAAC,iBAAiB,CAAC;oBACzD,KAAK,EAAE,iBAAiB,CAAC,EAAE,CAAC,IAAI,CAAC,KAAK,CAAC,iBAAiB,CAAC;oBACzD,KAAK,EAAE,iBAAiB,CAAC,EAAE,CAAC,IAAI,CAAC,KAAK,CAAC,iBAAiB,CAAC;oBACzD,KAAK,EAAE,iBAAiB,CAAC,EAAE,CAAC,IAAI,CAAC,KAAK,CAAC,iBAAiB,CAAC;oBACzD,KAAK,EAAE,iBAAiB,CAAC,EAAE,CAAC,IAAI,CAAC,KAAK,CAAC,iBAAiB,CAAC;oBACzD,QAAQ,EAAE,OAAO,CAAC,EAAE,CAAC,IAAI,CAAC,QAAQ,CAAC,OAAO,CAAC;oBAC3C,SAAS,EAAE,OAAO,CAAC,EAAE,CAAC,IAAI,CAAC,SAAS,CAAC,OAAO,CAAC;oBAC7C,SAAS,EAAE,OAAO,CAAC,EAAE,CAAC,IAAI,CAAC,SAAS,CAAC,OAAO,CAAC;oBAC7C,SAAS,EAAE,OAAO,CAAC,EAAE,CAAC,IAAI,CAAC,SAAS,CAAC,OAAO,CAAC;oBAC7C,SAAS,EAAE,OAAO,CAAC,EAAE,CAAC,IAAI,CAAC,SAAS,CAAC,OAAO,CAAC;oBAC7C,SAAS,EAAE,OAAO,CAAC,EAAE,CAAC,IAAI,CAAC,SAAS,CAAC,OAAO,CAAC;oBAC7C,SAAS,EAAE,OAAO,CAAC,EAAE,CAAC,IAAI,CAAC,SAAS,CAAC,OAAO,CAAC;oBAC7C,SAAS,EAAE,OAAO,CAAC,EAAE,CAAC,IAAI,CAAC,SAAS,CAAC,OAAO,CAAC;oBAC7C,SAAS,EAAE,OAAO,CAAC,EAAE,CAAC,IAAI,CAAC,SAAS,CAAC,OAAO,CAAC;oBAC7C,SAAS,EAAE,OAAO,CAAC,EAAE,CAAC,IAAI,CAAC,SAAS,CAAC,OAAO,CAAC;oBAC7C,YAAY,EAAE,iBAAiB,CAAC,EAAE,CAAC,IAAI,CAAC,YAAY,CAAC,iBAAiB,CAAC;oBACvE,aAAa,EAAE,iBAAiB,CAAC,EAAE,CAAC,IAAI,CAAC,aAAa,CAAC,iBAAiB,CAAC;oBACzE,aAAa,EAAE,iBAAiB,CAAC,EAAE,CAAC,IAAI,CAAC,aAAa,CAAC,iBAAiB,CAAC;oBACzE,aAAa,EAAE,iBAAiB,CAAC,EAAE,CAAC,IAAI,CAAC,aAAa,CAAC,iBAAiB,CAAC;oBACzE,aAAa,EAAE,iBAAiB,CAAC,EAAE,CAAC,IAAI,CAAC,aAAa,CAAC,iBAAiB,CAAC;oBACzE,aAAa,EAAE,iBAAiB,CAAC,EAAE,CAAC,IAAI,CAAC,aAAa,CAAC,iBAAiB,CAAC;oBACzE,aAAa,EAAE,iBAAiB,CAAC,EAAE,CAAC,IAAI,CAAC,aAAa,CAAC,iBAAiB,CAAC;oBACzE,aAAa,EAAE,iBAAiB,CAAC,EAAE,CAAC,IAAI,CAAC,aAAa,CAAC,iBAAiB,CAAC;oBACzE,aAAa,EAAE,iBAAiB,CAAC,EAAE,CAAC,IAAI,CAAC,aAAa,CAAC,iBAAiB,CAAC;oBACzE,aAAa,EAAE,iBAAiB,CAAC,EAAE,CAAC,IAAI,CAAC,aAAa,CAAC,iBAAiB,CAAC;oBACzE,gBAAgB,EAAE,OAAO,CAAC,EAAE,CAAC,IAAI,CAAC,gBAAgB,CAAC,OAAO,CAAC;oBAC3D,iBAAiB,EAAE,OAAO,CAAC,EAAE,CAAC,IAAI,CAAC,iBAAiB,CAAC,OAAO,CAAC;oBAC7D,iBAAiB,EAAE,OAAO,CAAC,EAAE,CAAC,IAAI,CAAC,iBAAiB,CAAC,OAAO,CAAC;oBAC7D,iBAAiB,EAAE,OAAO,CAAC,EAAE,CAAC,IAAI,CAAC,iBAAiB,CAAC,OAAO,CAAC;oBAC7D,iBAAiB,EAAE,OAAO,CAAC,EAAE,CAAC,IAAI,CAAC,iBAAiB,CAAC,OAAO,CAAC;oBAC7D,iBAAiB,EAAE,OAAO,CAAC,EAAE,CAAC,IAAI,CAAC,iBAAiB,CAAC,OAAO,CAAC;oBAC7D,iBAAiB,EAAE,OAAO,CAAC,EAAE,CAAC,IAAI,CAAC,iBAAiB,CAAC,OAAO,CAAC;oBAC7D,iBAAiB,EAAE,OAAO,CAAC,EAAE,CAAC,IAAI,CAAC,iBAAiB,CAAC,OAAO,CAAC;oBAC7D,iBAAiB,EAAE,OAAO,CAAC,EAAE,CAAC,IAAI,CAAC,iBAAiB,CAAC,OAAO,CAAC;oBAC7D,iBAAiB,EAAE,OAAO,CAAC,EAAE,CAAC,IAAI,CAAC,iBAAiB,CAAC,OAAO,CAAC;oBAC7D,MAAM,EAAE,IAAI,CAAC,EAAE,CAAC,IAAI,CAAC,MAAM,CAAC,IAAI,CAAC;oBACjC,SAAS,EAAE,CAAC,MAAM,EAAE,GAAG,IAAI,EAAE,EAAE;wBAC7B,IAAI,CAAC;4BACH,OAAO,IAAI,CAAC,SAAS,CAAO,IAAI,CAAuB,MAAM,CAAC,IAAI,CAAC,EAAQ,EAAE,IAAI,EAAE,IAAI,EAAE,CAAC,CAAC;wBAC7F,CAAC;wBAAC,OAAO,KAAc,EAAE,CAAC;4BACxB,MAAM,KAAK,CAAC;wBACd,CAAC;oBACH,CAAC;oBACD,OAAO,EAAE,WAAW,CAAC,CAAC,IAAI,EAAE,IAAI,EAAE,EAAE,CAAC,IAAI,CAAC,OAAO,CAAC,IAAI,EAAE,IAAI,CAAC,CAAC;oBAC9D,QAAQ,EAAE,WAAW,CAAC,CAAC,IAAI,EAAE,IAAI,EAAE,EAAE,CAAC,IAAI,CAAC,QAAQ,CAAC,IAAI,EAAE,IAAI,CAAC,CAAC;oBAChE,QAAQ,EAAE,WAAW,CAAC,CAAC,IAAI,EAAE,IAAI,EAAE,EAAE,CAAC,IAAI,CAAC,QAAQ,CAAC,IAAI,EAAE,IAAI,CAAC,CAAC;oBAChE,QAAQ,EAAE,WAAW,CAAC,CAAC,IAAI,EAAE,IAAI,EAAE,EAAE,CAAC,IAAI,CAAC,QAAQ,CAAC,IAAI,EAAE,IAAI,CAAC,CAAC;oBAChE,QAAQ,EAAE,WAAW,CAAC,CAAC,IAAI,EAAE,IAAI,EAAE,EAAE,CAAC,IAAI,CAAC,QAAQ,CAAC,IAAI,EAAE,IAAI,CAAC,CAAC;oBAChE,QAAQ,EAAE,WAAW,CAAC,CAAC,IAAI,EAAE,IAAI,EAAE,EAAE,CAAC,IAAI,CAAC,QAAQ,CAAC,IAAI,EAAE,IAAI,CAAC,CAAC;oBAChE,QAAQ,EAAE,WAAW,CAAC,CAAC,IAAI,EAAE,IAAI,EAAE,EAAE,CAAC,IAAI,CAAC,QAAQ,CAAC,IAAI,EAAE,IAAI,CAAC,CAAC;oBAChE,QAAQ,EAAE,WAAW,CAAC,CAAC,IAAI,EAAE,IAAI,EAAE,EAAE,CAAC,IAAI,CAAC,QAAQ,CAAC,IAAI,EAAE,IAAI,CAAC,CAAC;oBAChE,QAAQ,EAAE,WAAW,CAAC,CAAC,IAAI,EAAE,IAAI,EAAE,EAAE,CAAC,IAAI,CAAC,QAAQ,CAAC,IAAI,EAAE,IAAI,CAAC,CAAC;oBAChE,QAAQ,EAAE,WAAW,CAAC,CAAC,IAAI,EAAE,IAAI,EAAE,EAAE,CAAC,IAAI,CAAC,QAAQ,CAAC,IAAI,EAAE,IAAI,CAAC,CAAC;iBACjE,CAAC;YACJ,CAAC;SACF;QACD,OAAiF,IAAI,QAAQ,EAAE,CAAC;IAClG,CAAC;CACF","sourcesContent":["import type { ILexerConfig, IParserConfig } from '@chevrotain/types';\nimport type {IToken, TokenType, TokenVocabulary} from 'chevrotain';\nimport { EmbeddedActionsParser, Lexer } from 'chevrotain';\nimport { DataFactory } from 'rdf-data-factory';\nimport type {\n  CheckOverlap,\n  RuleDefMap,\n  ParserFromRules,\n  RuleListToObject,\n  RuleNamesFromList,\n  ParseMethodsFromRules,\n} from './builderTypes';\nimport type { CstDef, ImplArgs, RuleDef } from './ruleDefTypes';\n\nfunction listToRuleDefMap<T extends readonly RuleDef[]>(rules: T): RuleListToObject<T> {\n  const newRules: Record<string, RuleDef> = {};\n  for (const rule of rules) {\n    newRules[rule.name] = rule;\n  }\n  return <RuleListToObject<T>>newRules;\n}\n\nexport class Builder<Names extends string, RuleDefs extends RuleDefMap<Names>> {\n  /**\n   * Create a builder with from some initial grammar rules or an existing builder.\n   * If a builder is provided, a new copy will be created.\n   */\n  public static createBuilder<\n    Rules extends readonly RuleDef[] = RuleDef[],\n    Names extends string = RuleNamesFromList<Rules>,\n    RuleDefs extends RuleDefMap<Names> = RuleListToObject<Rules>,\n>(start: Rules | Builder<Names, RuleDefs>): Builder<Names, RuleDefs> {\n    if (start instanceof Builder) {\n      return new Builder({ ...start.rules });\n    }\n    return <Builder<Names, RuleDefs>> <unknown> new Builder(listToRuleDefMap(start));\n  }\n\n  private rules: RuleDefs;\n\n  private constructor(startRules: RuleDefs) {\n    this.rules = startRules;\n  }\n\n  /**\n   * Change the implementation of an existing grammar rule.\n   */\n  public patchRule<U extends Names, RET, ARGS extends unknown[]>(patch: RuleDef<U, RET, ARGS>):\n  Builder<Names, {[Key in Names]: Key extends U ? RuleDef<Key, RET, ARGS> : (RuleDefs[Key] extends RuleDef<Key> ? RuleDefs[Key] : never) }> {\n    const self = <Builder<Names, {[Key in Names]: Key extends U ? RuleDef<Key, RET, ARGS> : (RuleDefs[Key] extends RuleDef<Key> ? RuleDefs[Key] : never) }>>\n      <unknown> this;\n    self.rules[patch.name] = <any> patch;\n    return self;\n  }\n\n  /**\n   * Add a rule to the grammar. If the rule already exists, but the implementation differs, an error will be thrown.\n   */\n  public addRuleRedundant<U extends string, RET, ARGS extends unknown[]>(rule: RuleDef<U, RET, ARGS>):\n  Builder<Names | U, {[K in Names | U]: K extends U ? RuleDef<K, RET, ARGS> : ( K extends Names ? (RuleDefs[K] extends RuleDef<K> ? RuleDefs[K] : never ) : never) }> {\n    const self = <Builder<Names | U, {[K in Names | U]: K extends U ? RuleDef<K, RET, ARGS> : ( K extends Names ? (RuleDefs[K] extends RuleDef<K> ? RuleDefs[K] : never ) : never) }>>\n      <unknown> this;\n    const rules = <Record<string, RuleDef>> self.rules;\n    if (rules[rule.name] !== undefined && rules[rule.name] !== rule) {\n      throw new Error(`Rule ${rule.name} already exists in the builder`);\n    }\n    rules[rule.name] = rule;\n    return self;\n  }\n\n  /**\n   * Add a rule to the grammar. Will raise a typescript error if the rule already exists in the grammar.\n   */\n  public addRule<U extends string, RET, ARGS extends unknown[]>(\n    rule: CheckOverlap<U, Names, RuleDef<U, RET, ARGS>>,\n  ): Builder<Names | U, {[K in Names | U]: K extends U ? RuleDef<K, RET, ARGS> : ( K extends Names ? (RuleDefs[K] extends RuleDef<K> ? RuleDefs[K] : never ) : never) }> {\n    return this.addRuleRedundant(rule);\n  }\n\n  public addMany<U extends RuleDef[]>(\n    ...rules: CheckOverlap<RuleNamesFromList<U>, Names, U>\n  ): Builder<\n    Names | RuleNamesFromList<U>,\n    {[K in Names | RuleNamesFromList<U>]:\n      K extends keyof RuleListToObject<typeof rules> ? (\n        RuleListToObject<typeof rules>[K] extends RuleDef<K> ? RuleListToObject<typeof rules>[K] : never\n      ) : (\n        K extends Names ? (RuleDefs[K] extends RuleDef<K> ? RuleDefs[K] : never) : never\n      )\n    }> {\n    this.rules = { ...this.rules, ...listToRuleDefMap(rules) };\n    return <any> <unknown> this;\n  }\n\n  public deleteRule<U extends Names>(ruleName: U):\n  Builder<Exclude<Names, U>, { [K in Exclude<Names, U>]: RuleDefs[K] extends RuleDef<K> ? RuleDefs[K] : never }> {\n    delete this.rules[ruleName];\n    return <Builder<Exclude<Names, U>, { [K in Exclude<Names, U>]: RuleDefs[K] extends RuleDef<K> ? RuleDefs[K] : never }>>\n      <unknown> this;\n  }\n\n  public merge<OtherNames extends string, OtherRules extends RuleDefMap<OtherNames>, OW extends readonly RuleDef[]>(\n    builder: Builder<OtherNames, OtherRules>,\n    overridingRules: OW,\n  ):\n    Builder<\n      Names | OtherNames | RuleNamesFromList<OW>,\n      {[K in Names | OtherNames | RuleNamesFromList<OW>]:\n        K extends keyof RuleListToObject<OW> ? (\n          RuleListToObject<OW>[K] extends RuleDef<K> ? RuleListToObject<OW>[K] : never\n        )\n        : (\n          K extends Names ? (RuleDefs[K] extends RuleDef<K> ? RuleDefs[K] : never)\n          : K extends OtherNames ? (OtherRules[K] extends RuleDef<K> ? OtherRules[K] : never) : never\n        )}> {\n    // Assume the other grammar is bigger than yours. So start from that one and add this one\n    const otherRules: Record<string, RuleDef> = { ...builder.rules };\n    const myRules: Record<string, RuleDef> = this.rules;\n\n    for (const rule of Object.values(myRules)) {\n      if (otherRules[rule.name] === undefined) {\n        otherRules[rule.name] = rule;\n      } else {\n        const existingRule = otherRules[rule.name];\n        // If same rule, no issue, move on. Else\n        if (existingRule !== rule) {\n          const override = overridingRules.find(x => x.name === rule.name);\n          // If override specified, take override, else, inform user that there is a conflict\n          if (override) {\n            otherRules[rule.name] = override;\n          } else {\n            throw new Error(`Rule with name \"${rule.name}\" already exists in the builder, specify an override to resolve conflict`);\n          }\n        }\n      }\n    }\n\n    this.rules = <any> <unknown> otherRules;\n    return <any> <unknown> this;\n  }\n\n  public consumeToParser({ tokenVocabulary, parserConfig = {}, lexerConfig = {}}: {\n    tokenVocabulary: TokenType[];\n    parserConfig?: IParserConfig;\n    lexerConfig?: ILexerConfig;\n  }, context: Partial<ImplArgs['context']> = {}): ParserFromRules<Names, RuleDefs> {\n    const lexer: Lexer = new Lexer(tokenVocabulary, {\n      positionTracking: 'onlyStart',\n      recoveryEnabled: false,\n      // SafeMode: true,\n      // SkipValidations: true,\n      ensureOptimizations: true,\n      ...lexerConfig,\n    });\n    const parser = this.consume({ tokenVocabulary, config: parserConfig }, context);\n    const selfSufficientParser: Partial<ParserFromRules<Names, RuleDefs>> = {};\n    // eslint-disable-next-line ts/no-unnecessary-type-assertion\n    for (const rule of <RuleDef<Names>[]> Object.values(this.rules)) {\n      selfSufficientParser[rule.name] = <any> ((input: string, arg: unknown) => {\n        // Transform input in accordance to 19.2\n        input = input.replaceAll(\n          /\\\\u([0-9a-fA-F]{4})|\\\\U([0-9a-fA-F]{8})/gu,\n          (_, unicode4: string, unicode8: string) => {\n            if (unicode4) {\n              const charCode = Number.parseInt(unicode4, 16);\n              return String.fromCodePoint(charCode);\n            }\n            const charCode = Number.parseInt(unicode8, 16);\n            if (charCode < 0xFFFF) {\n              return String.fromCodePoint(charCode);\n            }\n            const substractedCharCode = charCode - 0x10000;\n            return String.fromCodePoint(0xD800 + (substractedCharCode >> 10), 0xDC00 + (substractedCharCode & 0x3FF));\n          },\n        );\n        // Test for invalid unicode surrogate pairs\n        if (/[\\uD800-\\uDBFF]([^\\uDC00-\\uDFFF]|$)/u.test(input)) {\n          throw new Error(`Invalid unicode codepoint of surrogate pair without corresponding codepoint`);\n        }\n\n        const lexResult = lexer.tokenize(input);\n        // Console.log(lexResult.tokens);\n\n        parser.reset();\n        parser.input = lexResult.tokens;\n        const result = parser[rule.name](arg);\n        if (parser.errors.length > 0) {\n          // Console.log(lexResult.tokens);\n          throw new Error(`Parse error on line ${parser.errors.map(x => x.token.startLine).join(', ')}\n${parser.errors.map(x => `${x.token.startLine}: ${x.message}`).join('\\n')}`);\n        }\n        return result;\n      });\n    }\n    return <ParserFromRules<Names, RuleDefs>> selfSufficientParser;\n  }\n\n  public consume({ tokenVocabulary, config = {}}: {\n    tokenVocabulary: TokenVocabulary;\n    config?: IParserConfig;\n  }, context: Partial<ImplArgs['context']> = {}): EmbeddedActionsParser & ParseMethodsFromRules<Names, RuleDefs> {\n    const rules = this.rules;\n    class MyParser extends EmbeddedActionsParser {\n      private readonly initialParseContext: ImplArgs['context'];\n      private readonly runningContext: ImplArgs['context'];\n\n      public constructor() {\n        super(tokenVocabulary, {\n          // RecoveryEnabled: true,\n          maxLookahead: 2,\n          // SkipValidations: true,\n          ...config,\n        });\n\n        const selfRef = this.getSelfRef();\n        // !!! Remember to change the RESET function accordingly !!!\n        this.initialParseContext = {\n          dataFactory: new DataFactory({ blankNodePrefix: 'g_' }),\n          baseIRI: undefined,\n          parseMode: new Set(),\n          skipValidation: false,\n          ...context,\n          prefixes: context.prefixes ? { ...context.prefixes } : {},\n        };\n        this.runningContext = {\n          ...this.initialParseContext,\n          prefixes: { ...this.initialParseContext.prefixes },\n          parseMode: new Set(this.initialParseContext.parseMode),\n        };\n\n        const implArgs: ImplArgs = {\n          ...selfRef,\n          cache: new WeakMap(),\n          context: this.runningContext,\n        };\n\n        for (const rule of Object.values(<Record<string, RuleDef>>rules)) {\n          this[<keyof (typeof this)> rule.name] = <any> this.RULE(rule.name, rule.impl(implArgs));\n        }\n        this.performSelfAnalysis();\n      }\n\n      public override reset(): void {\n        super.reset();\n        // We need to keep the original object reference.\n        Object.assign(this.runningContext, {\n          ...this.initialParseContext,\n        });\n        this.runningContext.prefixes = { ...this.initialParseContext.prefixes };\n        this.runningContext.parseMode = new Set(this.initialParseContext.parseMode);\n      }\n\n      private getSelfRef(): CstDef {\n        const subRuleImpl = (subrule: typeof this.SUBRULE): CstDef['SUBRULE'] => {\n          return ((cstDef, ...args) => {\n            return subrule(<any> this[<keyof (typeof this)> cstDef.name], <any> { ARGS: args });\n          }) satisfies CstDef['SUBRULE'];\n        }\n        return {\n          CONSUME: (tokenType, option) => this.CONSUME(tokenType, option),\n          CONSUME1: (tokenType, option) => this.CONSUME1(tokenType, option),\n          CONSUME2: (tokenType, option) => this.CONSUME2(tokenType, option),\n          CONSUME3: (tokenType, option) => this.CONSUME3(tokenType, option),\n          CONSUME4: (tokenType, option) => this.CONSUME4(tokenType, option),\n          CONSUME5: (tokenType, option) => this.CONSUME5(tokenType, option),\n          CONSUME6: (tokenType, option) => this.CONSUME6(tokenType, option),\n          CONSUME7: (tokenType, option) => this.CONSUME7(tokenType, option),\n          CONSUME8: (tokenType, option) => this.CONSUME8(tokenType, option),\n          CONSUME9: (tokenType, option) => this.CONSUME9(tokenType, option),\n          OPTION: actionORMethodDef => this.OPTION(actionORMethodDef),\n          OPTION1: actionORMethodDef => this.OPTION1(actionORMethodDef),\n          OPTION2: actionORMethodDef => this.OPTION2(actionORMethodDef),\n          OPTION3: actionORMethodDef => this.OPTION3(actionORMethodDef),\n          OPTION4: actionORMethodDef => this.OPTION4(actionORMethodDef),\n          OPTION5: actionORMethodDef => this.OPTION5(actionORMethodDef),\n          OPTION6: actionORMethodDef => this.OPTION6(actionORMethodDef),\n          OPTION7: actionORMethodDef => this.OPTION7(actionORMethodDef),\n          OPTION8: actionORMethodDef => this.OPTION8(actionORMethodDef),\n          OPTION9: actionORMethodDef => this.OPTION9(actionORMethodDef),\n          OR: altsOrOpts => this.OR(altsOrOpts),\n          OR1: altsOrOpts => this.OR1(altsOrOpts),\n          OR2: altsOrOpts => this.OR2(altsOrOpts),\n          OR3: altsOrOpts => this.OR3(altsOrOpts),\n          OR4: altsOrOpts => this.OR4(altsOrOpts),\n          OR5: altsOrOpts => this.OR5(altsOrOpts),\n          OR6: altsOrOpts => this.OR6(altsOrOpts),\n          OR7: altsOrOpts => this.OR7(altsOrOpts),\n          OR8: altsOrOpts => this.OR8(altsOrOpts),\n          OR9: altsOrOpts => this.OR9(altsOrOpts),\n          MANY: actionORMethodDef => this.MANY(actionORMethodDef),\n          MANY1: actionORMethodDef => this.MANY1(actionORMethodDef),\n          MANY2: actionORMethodDef => this.MANY2(actionORMethodDef),\n          MANY3: actionORMethodDef => this.MANY3(actionORMethodDef),\n          MANY4: actionORMethodDef => this.MANY4(actionORMethodDef),\n          MANY5: actionORMethodDef => this.MANY5(actionORMethodDef),\n          MANY6: actionORMethodDef => this.MANY6(actionORMethodDef),\n          MANY7: actionORMethodDef => this.MANY7(actionORMethodDef),\n          MANY8: actionORMethodDef => this.MANY8(actionORMethodDef),\n          MANY9: actionORMethodDef => this.MANY9(actionORMethodDef),\n          MANY_SEP: options => this.MANY_SEP(options),\n          MANY_SEP1: options => this.MANY_SEP1(options),\n          MANY_SEP2: options => this.MANY_SEP2(options),\n          MANY_SEP3: options => this.MANY_SEP3(options),\n          MANY_SEP4: options => this.MANY_SEP4(options),\n          MANY_SEP5: options => this.MANY_SEP5(options),\n          MANY_SEP6: options => this.MANY_SEP6(options),\n          MANY_SEP7: options => this.MANY_SEP7(options),\n          MANY_SEP8: options => this.MANY_SEP8(options),\n          MANY_SEP9: options => this.MANY_SEP9(options),\n          AT_LEAST_ONE: actionORMethodDef => this.AT_LEAST_ONE(actionORMethodDef),\n          AT_LEAST_ONE1: actionORMethodDef => this.AT_LEAST_ONE1(actionORMethodDef),\n          AT_LEAST_ONE2: actionORMethodDef => this.AT_LEAST_ONE2(actionORMethodDef),\n          AT_LEAST_ONE3: actionORMethodDef => this.AT_LEAST_ONE3(actionORMethodDef),\n          AT_LEAST_ONE4: actionORMethodDef => this.AT_LEAST_ONE4(actionORMethodDef),\n          AT_LEAST_ONE5: actionORMethodDef => this.AT_LEAST_ONE5(actionORMethodDef),\n          AT_LEAST_ONE6: actionORMethodDef => this.AT_LEAST_ONE6(actionORMethodDef),\n          AT_LEAST_ONE7: actionORMethodDef => this.AT_LEAST_ONE7(actionORMethodDef),\n          AT_LEAST_ONE8: actionORMethodDef => this.AT_LEAST_ONE8(actionORMethodDef),\n          AT_LEAST_ONE9: actionORMethodDef => this.AT_LEAST_ONE9(actionORMethodDef),\n          AT_LEAST_ONE_SEP: options => this.AT_LEAST_ONE_SEP(options),\n          AT_LEAST_ONE_SEP1: options => this.AT_LEAST_ONE_SEP1(options),\n          AT_LEAST_ONE_SEP2: options => this.AT_LEAST_ONE_SEP2(options),\n          AT_LEAST_ONE_SEP3: options => this.AT_LEAST_ONE_SEP3(options),\n          AT_LEAST_ONE_SEP4: options => this.AT_LEAST_ONE_SEP4(options),\n          AT_LEAST_ONE_SEP5: options => this.AT_LEAST_ONE_SEP5(options),\n          AT_LEAST_ONE_SEP6: options => this.AT_LEAST_ONE_SEP6(options),\n          AT_LEAST_ONE_SEP7: options => this.AT_LEAST_ONE_SEP7(options),\n          AT_LEAST_ONE_SEP8: options => this.AT_LEAST_ONE_SEP8(options),\n          AT_LEAST_ONE_SEP9: options => this.AT_LEAST_ONE_SEP9(options),\n          ACTION: func => this.ACTION(func),\n          BACKTRACK: (cstDef, ...args) => {\n            try {\n              return this.BACKTRACK(<any> this[<keyof (typeof this)> cstDef.name], <any> { ARGS: args });\n            } catch (error: unknown) {\n              throw error;\n            }\n          },\n          SUBRULE: subRuleImpl((rule, args) => this.SUBRULE(rule, args)),\n          SUBRULE1: subRuleImpl((rule, args) => this.SUBRULE1(rule, args)),\n          SUBRULE2: subRuleImpl((rule, args) => this.SUBRULE2(rule, args)),\n          SUBRULE3: subRuleImpl((rule, args) => this.SUBRULE3(rule, args)),\n          SUBRULE4: subRuleImpl((rule, args) => this.SUBRULE4(rule, args)),\n          SUBRULE5: subRuleImpl((rule, args) => this.SUBRULE5(rule, args)),\n          SUBRULE6: subRuleImpl((rule, args) => this.SUBRULE6(rule, args)),\n          SUBRULE7: subRuleImpl((rule, args) => this.SUBRULE7(rule, args)),\n          SUBRULE8: subRuleImpl((rule, args) => this.SUBRULE8(rule, args)),\n          SUBRULE9: subRuleImpl((rule, args) => this.SUBRULE9(rule, args)),\n        };\n      }\n    }\n    return <EmbeddedActionsParser & ParseMethodsFromRules<Names, RuleDefs>><unknown> new MyParser();\n  }\n}\n"]}

package/lib/grammar-builder/ruleDefTypes.d.ts

@@ -4,10 +4,10 @@ import type { ConsumeMethodOpts, IToken, TokenType } from 'chevrotain';
 import type { DataFactory } from 'rdf-data-factory';
 export type RuleDef<NameType extends string = string, ReturnType = unknown, ParamType extends unknown[] = unknown[]> = {
     name: NameType;
-    impl: (def: ImplArgs) => (...args: ArrayElementsUndefinable<ParamType>) => ReturnType;
+    impl: (def: ImplArgs) => (...args: ArrayMagicWork<ParamType>) => ReturnType;
 };
 export type RuleDefReturn<T> = T extends RuleDef<any, infer Ret, any> ? Ret : never;
-type ArrayElementsUndefinable<ArrayType extends any[]> = ArrayType extends [infer First, ...infer Rest] ? [First | undefined, ...ArrayElementsUndefinable<Rest>] : [];
+type ArrayMagicWork<ArrayType extends unknown[]> = ArrayType extends [infer First, ...infer Rest] ? [First, ...ArrayMagicWork<Rest>] : [];
 export interface ImplArgs extends CstDef {
     cache: WeakMap<RuleDef, unknown>;
     context: {
@@ -20,14 +20,6 @@ export interface ImplArgs extends CstDef {
          * The base IRI for the query. Used for resolving relative IRIs.
          */
         baseIRI: string | undefined;
-        /**
-         * Set of blank node labels that have been flushed. Used for note 10.
-         */
-        flushedBlankNodeLabels: Set<string>;
-        /**
-         * Set of blank node labels that have been used. Used for note 10.
-         */
-        usedBlankNodeLabels: Set<string>;
         /**
          * Can be used to disable the validation that used variables in a select clause are in scope.
          */

package/lib/grammar-builder/ruleDefTypes.js.map

@@ -1 +1 @@
-{"version":3,"file":"ruleDefTypes.js","sourceRoot":"","sources":["ruleDefTypes.ts"],"names":[],"mappings":"","sourcesContent":["import type {\n  AtLeastOneSepMethodOpts,\n  DSLMethodOpts,\n  DSLMethodOptsWithErr,\n  GrammarAction,\n  IOrAlt,\n  ManySepMethodOpts,\n  OrMethodOpts,\n} from '@chevrotain/types';\nimport type * as RDF from '@rdfjs/types';\nimport type { ConsumeMethodOpts, IToken, TokenType } from 'chevrotain';\nimport type { DataFactory } from 'rdf-data-factory';\n\nexport type RuleDef<\n  NameType extends string = string,\n  ReturnType = unknown,\n  ParamType extends unknown[] = unknown[],\n> = {\n  name: NameType;\n  impl: (def: ImplArgs) => (...args: ArrayElementsUndefinable<ParamType>) => ReturnType;\n};\n\nexport type RuleDefReturn<T> = T extends RuleDef<any, infer Ret, any> ? Ret : never;\n\ntype ArrayElementsUndefinable<ArrayType extends any[]> =\n  ArrayType extends [infer First, ...infer Rest] ? [First | undefined, ...ArrayElementsUndefinable<Rest>] : [];\n\nexport interface ImplArgs extends CstDef {\n  cache: WeakMap<RuleDef, unknown>;\n  context: {\n    dataFactory: DataFactory<RDF.BaseQuad>;\n    /**\n     * Current scoped prefixes. Used for resolving prefixed names.\n     */\n    prefixes: Record<string, string>;\n    /**\n     * The base IRI for the query. Used for resolving relative IRIs.\n     */\n    baseIRI: string | undefined;\n    /**\n     * Set of blank node labels that have been flushed. Used for note 10.\n     */\n    flushedBlankNodeLabels: Set<string>;\n    /**\n     * Set of blank node labels that have been used. Used for note 10.\n     */\n    usedBlankNodeLabels: Set<string>;\n    /**\n     * Can be used to disable the validation that used variables in a select clause are in scope.\n     */\n    skipValidation: boolean;\n    /**\n     * Set of queryModes. Primarily used for note 8, 14.\n     */\n    parseMode: Set<symbol>;\n  };\n}\n\ntype SubRuleFunc = <T extends string, U = unknown, ARGS extends any[] = []>(\n  cstDef: RuleDef<T, U, ARGS>,\n  ...argument: ARGS\n) => U;\ntype BacktrackFunc = <T extends string, U = unknown, ARGS extends any[] = []>(\n  cstDef: RuleDef<T, U, ARGS>,\n  ...argument: ARGS\n) => () => boolean;\n\nexport interface CstDef {\n  /**\n   *\n   * A Parsing DSL method use to consume a single Token.\n   * In EBNF terms this is equivalent to a Terminal.\n   *\n   * A Token will be consumed, IFF the next token in the token vector matches `tokType`.\n   * otherwise the parser may attempt to perform error recovery (if enabled).\n   *\n   * The index in the method name indicates the unique occurrence of a terminal consumption\n   * inside a the top level rule. What this means is that if a terminal appears\n   * more than once in a single rule, each appearance must have a **different** index.\n   *\n   * For example:\n   * ```\n   *   this.RULE(\"qualifiedName\", () => {\n   *   this.CONSUME1(Identifier);\n   *     this.MANY(() => {\n   *       this.CONSUME1(Dot);\n   *       // here we use CONSUME2 because the terminal\n   *       // 'Identifier' has already appeared previously in the\n   *       // the rule 'parseQualifiedName'\n   *       this.CONSUME2(Identifier);\n   *     });\n   *   })\n   * ```\n   *\n   * - See more details on the [unique suffixes requirement](http://chevrotain.io/docs/FAQ.html#NUMERICAL_SUFFIXES).\n   *\n   * @param tokType - The Type of the token to be consumed.\n   * @param options - optional properties to modify the behavior of CONSUME.\n   */\n  CONSUME: (tokType: TokenType, options?: ConsumeMethodOpts) => IToken;\n  CONSUME1: (tokType: TokenType, options?: ConsumeMethodOpts) => IToken;\n  CONSUME2: (tokType: TokenType, options?: ConsumeMethodOpts) => IToken;\n  CONSUME3: (tokType: TokenType, options?: ConsumeMethodOpts) => IToken;\n  CONSUME4: (tokType: TokenType, options?: ConsumeMethodOpts) => IToken;\n  CONSUME5: (tokType: TokenType, options?: ConsumeMethodOpts) => IToken;\n  CONSUME6: (tokType: TokenType, options?: ConsumeMethodOpts) => IToken;\n  CONSUME7: (tokType: TokenType, options?: ConsumeMethodOpts) => IToken;\n  CONSUME8: (tokType: TokenType, options?: ConsumeMethodOpts) => IToken;\n  CONSUME9: (tokType: TokenType, options?: ConsumeMethodOpts) => IToken;\n  /**\n   * Parsing DSL Method that Indicates an Optional production.\n   * in EBNF notation this is equivalent to: \"[...]\".\n   *\n   * Note that there are two syntax forms:\n   * - Passing the grammar action directly:\n   *   ```\n   *     this.OPTION(() => {\n   *       this.CONSUME(Digit)}\n   *     );\n   *   ```\n   *\n   * - using an \"options\" object:\n   *   ```\n   *     this.OPTION({\n   *       GATE:predicateFunc,\n   *       DEF: () => {\n   *         this.CONSUME(Digit)\n   *     }});\n   *   ```\n   *\n   * The optional 'GATE' property in \"options\" object form can be used to add constraints\n   * to invoking the grammar action.\n   *\n   * As in CONSUME the index in the method name indicates the occurrence\n   * of the optional production in it's top rule.\n   *\n   * @param  actionORMethodDef - The grammar action to optionally invoke once\n   *                             or an \"OPTIONS\" object describing the grammar action and optional properties.\n   *\n   * @returns The `GrammarAction` return value (OUT) if the optional syntax is encountered\n   *          or `undefined` if not.\n   */\n  OPTION: <OUT>(\n    actionORMethodDef: GrammarAction<OUT> | DSLMethodOpts<OUT>,\n  ) => OUT | undefined;\n  OPTION1: <OUT>(\n    actionORMethodDef: GrammarAction<OUT> | DSLMethodOpts<OUT>,\n  ) => OUT | undefined;\n  OPTION2: <OUT>(\n    actionORMethodDef: GrammarAction<OUT> | DSLMethodOpts<OUT>,\n  ) => OUT | undefined;\n  OPTION3: <OUT>(\n    actionORMethodDef: GrammarAction<OUT> | DSLMethodOpts<OUT>,\n  ) => OUT | undefined;\n  OPTION4: <OUT>(\n    actionORMethodDef: GrammarAction<OUT> | DSLMethodOpts<OUT>,\n  ) => OUT | undefined;\n  OPTION5: <OUT>(\n    actionORMethodDef: GrammarAction<OUT> | DSLMethodOpts<OUT>,\n  ) => OUT | undefined;\n  OPTION6: <OUT>(\n    actionORMethodDef: GrammarAction<OUT> | DSLMethodOpts<OUT>,\n  ) => OUT | undefined;\n  OPTION7: <OUT>(\n    actionORMethodDef: GrammarAction<OUT> | DSLMethodOpts<OUT>,\n  ) => OUT | undefined;\n  OPTION8: <OUT>(\n    actionORMethodDef: GrammarAction<OUT> | DSLMethodOpts<OUT>,\n  ) => OUT | undefined;\n  OPTION9: <OUT>(\n    actionORMethodDef: GrammarAction<OUT> | DSLMethodOpts<OUT>,\n  ) => OUT | undefined;\n  /**\n   * Parsing DSL method that indicates a choice between a set of alternatives must be made.\n   * This is equivalent to an EBNF alternation (A | B | C | D ...), except\n   * that the alternatives are ordered like in a PEG grammar.\n   * This means that the **first** matching alternative is always chosen.\n   *\n   * There are several forms for the inner alternatives array:\n   *\n   * - Passing alternatives array directly:\n   *   ```\n   *     this.OR([\n   *       { ALT:() => { this.CONSUME(One) }},\n   *       { ALT:() => { this.CONSUME(Two) }},\n   *       { ALT:() => { this.CONSUME(Three) }}\n   *     ])\n   *   ```\n   *\n   * - Passing alternative array directly with predicates (GATE):\n   *   ```\n   *     this.OR([\n   *       { GATE: predicateFunc1, ALT:() => { this.CONSUME(One) }},\n   *       { GATE: predicateFuncX, ALT:() => { this.CONSUME(Two) }},\n   *       { GATE: predicateFuncX, ALT:() => { this.CONSUME(Three) }}\n   *     ])\n   *   ```\n   *\n   * - These syntax forms can also be mixed:\n   *   ```\n   *     this.OR([\n   *       {\n   *         GATE: predicateFunc1,\n   *         ALT:() => { this.CONSUME(One) }\n   *       },\n   *       { ALT:() => { this.CONSUME(Two) }},\n   *       { ALT:() => { this.CONSUME(Three) }}\n   *     ])\n   *   ```\n   *\n   * - Additionally an \"options\" object may be used:\n   *   ```\n   *     this.OR({\n   *       DEF:[\n   *         { ALT:() => { this.CONSUME(One) }},\n   *         { ALT:() => { this.CONSUME(Two) }},\n   *         { ALT:() => { this.CONSUME(Three) }}\n   *       ],\n   *       // OPTIONAL property\n   *       ERR_MSG: \"A Number\"\n   *     })\n   *   ```\n   *\n   * The 'predicateFuncX' in the long form can be used to add constraints to choosing the alternative.\n   *\n   * As in CONSUME the index in the method name indicates the occurrence\n   * of the alternation production in it's top rule.\n   *\n   * @param altsOrOpts - A set of alternatives or an \"OPTIONS\" object describing the alternatives\n   * and optional properties.\n   *\n   * @returns The result of invoking the chosen alternative.\n   */\n  OR: <T>(altsOrOpts: IOrAlt<T>[] | OrMethodOpts<T>) => T;\n  OR1: <T>(altsOrOpts: IOrAlt<T>[] | OrMethodOpts<T>) => T;\n  OR2: <T>(altsOrOpts: IOrAlt<T>[] | OrMethodOpts<T>) => T;\n  OR3: <T>(altsOrOpts: IOrAlt<T>[] | OrMethodOpts<T>) => T;\n  OR4: <T>(altsOrOpts: IOrAlt<T>[] | OrMethodOpts<T>) => T;\n  OR5: <T>(altsOrOpts: IOrAlt<T>[] | OrMethodOpts<T>) => T;\n  OR6: <T>(altsOrOpts: IOrAlt<T>[] | OrMethodOpts<T>) => T;\n  OR7: <T>(altsOrOpts: IOrAlt<T>[] | OrMethodOpts<T>) => T;\n  OR8: <T>(altsOrOpts: IOrAlt<T>[] | OrMethodOpts<T>) => T;\n  OR9: <T>(altsOrOpts: IOrAlt<T>[] | OrMethodOpts<T>) => T;\n  /**\n   * Parsing DSL method, that indicates a repetition of zero or more.\n   * This is equivalent to EBNF repetition \\{...\\}.\n   *\n   * Note that there are two syntax forms:\n   * - Passing the grammar action directly:\n   *   ```\n   *     this.MANY(() => {\n   *       this.CONSUME(Comma)\n   *       this.CONSUME(Digit)\n   *      })\n   *   ```\n   *\n   * - using an \"options\" object:\n   *   ```\n   *     this.MANY({\n   *       GATE: predicateFunc,\n   *       DEF: () => {\n   *              this.CONSUME(Comma)\n   *              this.CONSUME(Digit)\n   *            }\n   *     });\n   *   ```\n   *\n   * The optional 'GATE' property in \"options\" object form can be used to add constraints\n   * to invoking the grammar action.\n   *\n   * As in CONSUME the index in the method name indicates the occurrence\n   * of the repetition production in it's top rule.\n   *\n   * @param actionORMethodDef - The grammar action to optionally invoke multiple times\n   *                             or an \"OPTIONS\" object describing the grammar action and optional properties.\n   *\n   */\n  MANY: (\n    actionORMethodDef: GrammarAction<any> | DSLMethodOpts<any>,\n  ) => void;\n  MANY1: (\n    actionORMethodDef: GrammarAction<any> | DSLMethodOpts<any>,\n  ) => void;\n  MANY2: (\n    actionORMethodDef: GrammarAction<any> | DSLMethodOpts<any>,\n  ) => void;\n  MANY3: (\n    actionORMethodDef: GrammarAction<any> | DSLMethodOpts<any>,\n  ) => void;\n  MANY4: (\n    actionORMethodDef: GrammarAction<any> | DSLMethodOpts<any>,\n  ) => void;\n  MANY5: (\n    actionORMethodDef: GrammarAction<any> | DSLMethodOpts<any>,\n  ) => void;\n  MANY6: (\n    actionORMethodDef: GrammarAction<any> | DSLMethodOpts<any>,\n  ) => void;\n  MANY7: (\n    actionORMethodDef: GrammarAction<any> | DSLMethodOpts<any>,\n  ) => void;\n  MANY8: (\n    actionORMethodDef: GrammarAction<any> | DSLMethodOpts<any>,\n  ) => void;\n  MANY9: (\n    actionORMethodDef: GrammarAction<any> | DSLMethodOpts<any>,\n  ) => void;\n  /**\n   * Parsing DSL method, that indicates a repetition of zero or more with a separator\n   * Token between the repetitions.\n   *\n   * Example:\n   *\n   * ```\n   *     this.MANY_SEP({\n   *         SEP:Comma,\n   *         DEF: () => {\n   *             this.CONSUME(Number};\n   *             // ...\n   *         })\n   * ```\n   *\n   * Note that because this DSL method always requires more than one argument the options object is always required\n   * and it is not possible to use a shorter form like in the MANY DSL method.\n   *\n   * Note that for the purposes of deciding on whether or not another iteration exists\n   * Only a single Token is examined (The separator). Therefore if the grammar being implemented is\n   * so \"crazy\" to require multiple tokens to identify an item separator please use the more basic DSL methods\n   * to implement it.\n   *\n   * As in CONSUME the index in the method name indicates the occurrence\n   * of the repetition production in it's top rule.\n   *\n   * @param options - An object defining the grammar of each iteration and the separator between iterations\n   *\n   */\n  MANY_SEP: (options: ManySepMethodOpts<any>) => void;\n  MANY_SEP1: (options: ManySepMethodOpts<any>) => void;\n  MANY_SEP2: (options: ManySepMethodOpts<any>) => void;\n  MANY_SEP3: (options: ManySepMethodOpts<any>) => void;\n  MANY_SEP4: (options: ManySepMethodOpts<any>) => void;\n  MANY_SEP5: (options: ManySepMethodOpts<any>) => void;\n  MANY_SEP6: (options: ManySepMethodOpts<any>) => void;\n  MANY_SEP7: (options: ManySepMethodOpts<any>) => void;\n  MANY_SEP8: (options: ManySepMethodOpts<any>) => void;\n  MANY_SEP9: (options: ManySepMethodOpts<any>) => void;\n  /**\n   * Convenience method, same as MANY but the repetition is of one or more.\n   * failing to match at least one repetition will result in a parsing error and\n   * cause a parsing error.\n   *\n   * @see MANY\n   *\n   * @param actionORMethodDef  - The grammar action to optionally invoke multiple times\n   *                             or an \"OPTIONS\" object describing the grammar action and optional properties.\n   *\n   */\n  AT_LEAST_ONE: (\n    actionORMethodDef: GrammarAction<any> | DSLMethodOptsWithErr<any>,\n  ) => void;\n  AT_LEAST_ONE1: (\n    actionORMethodDef: GrammarAction<any> | DSLMethodOptsWithErr<any>,\n  ) => void;\n  AT_LEAST_ONE2: (\n    actionORMethodDef: GrammarAction<any> | DSLMethodOptsWithErr<any>,\n  ) => void;\n  AT_LEAST_ONE3: (\n    actionORMethodDef: GrammarAction<any> | DSLMethodOptsWithErr<any>,\n  ) => void;\n  AT_LEAST_ONE4: (\n    actionORMethodDef: GrammarAction<any> | DSLMethodOptsWithErr<any>,\n  ) => void;\n  AT_LEAST_ONE5: (\n    actionORMethodDef: GrammarAction<any> | DSLMethodOptsWithErr<any>,\n  ) => void;\n  AT_LEAST_ONE6: (\n    actionORMethodDef: GrammarAction<any> | DSLMethodOptsWithErr<any>,\n  ) => void;\n  AT_LEAST_ONE7: (\n    actionORMethodDef: GrammarAction<any> | DSLMethodOptsWithErr<any>,\n  ) => void;\n  AT_LEAST_ONE8: (\n    actionORMethodDef: GrammarAction<any> | DSLMethodOptsWithErr<any>,\n  ) => void;\n  AT_LEAST_ONE9: (\n    actionORMethodDef: GrammarAction<any> | DSLMethodOptsWithErr<any>,\n  ) => void;\n  /**\n   * Convenience method, same as MANY_SEP but the repetition is of one or more.\n   * failing to match at least one repetition will result in a parsing error and\n   * cause the parser to attempt error recovery.\n   *\n   * Note that an additional optional property ERR_MSG can be used to provide custom error messages.\n   *\n   * @see MANY_SEP\n   *\n   * @param options - An object defining the grammar of each iteration and the separator between iterations\n   *\n   * @return {ISeparatedIterationResult<OUT>}\n   */\n  AT_LEAST_ONE_SEP: (options: AtLeastOneSepMethodOpts<any>) => void;\n  AT_LEAST_ONE_SEP1: (options: AtLeastOneSepMethodOpts<any>) => void;\n  AT_LEAST_ONE_SEP2: (options: AtLeastOneSepMethodOpts<any>) => void;\n  AT_LEAST_ONE_SEP3: (options: AtLeastOneSepMethodOpts<any>) => void;\n  AT_LEAST_ONE_SEP4: (options: AtLeastOneSepMethodOpts<any>) => void;\n  AT_LEAST_ONE_SEP5: (options: AtLeastOneSepMethodOpts<any>) => void;\n  AT_LEAST_ONE_SEP6: (options: AtLeastOneSepMethodOpts<any>) => void;\n  AT_LEAST_ONE_SEP7: (options: AtLeastOneSepMethodOpts<any>) => void;\n  AT_LEAST_ONE_SEP8: (options: AtLeastOneSepMethodOpts<any>) => void;\n  AT_LEAST_ONE_SEP9: (options: AtLeastOneSepMethodOpts<any>) => void;\n  ACTION: <T>(impl: () => T) => T;\n  BACKTRACK: BacktrackFunc;\n  SUBRULE: SubRuleFunc;\n  SUBRULE1: SubRuleFunc;\n  SUBRULE2: SubRuleFunc;\n  SUBRULE3: SubRuleFunc;\n  SUBRULE4: SubRuleFunc;\n  SUBRULE5: SubRuleFunc;\n  SUBRULE6: SubRuleFunc;\n  SUBRULE7: SubRuleFunc;\n  SUBRULE8: SubRuleFunc;\n  SUBRULE9: SubRuleFunc;\n}\n"]}
+{"version":3,"file":"ruleDefTypes.js","sourceRoot":"","sources":["ruleDefTypes.ts"],"names":[],"mappings":"","sourcesContent":["import type {\n  AtLeastOneSepMethodOpts,\n  DSLMethodOpts,\n  DSLMethodOptsWithErr,\n  GrammarAction,\n  IOrAlt,\n  ManySepMethodOpts,\n  OrMethodOpts,\n} from '@chevrotain/types';\nimport type * as RDF from '@rdfjs/types';\nimport type { ConsumeMethodOpts, IToken, TokenType } from 'chevrotain';\nimport type { DataFactory } from 'rdf-data-factory';\n\nexport type RuleDef<\n  NameType extends string = string,\n  ReturnType = unknown,\n  ParamType extends unknown[] = unknown[],\n> = {\n  name: NameType;\n  impl: (def: ImplArgs) => (...args: ArrayMagicWork<ParamType>) => ReturnType;\n};\n\nexport type RuleDefReturn<T> = T extends RuleDef<any, infer Ret, any> ? Ret : never;\n\ntype ArrayMagicWork<ArrayType extends unknown[]> =\n  ArrayType extends [infer First, ...infer Rest] ? [First, ...ArrayMagicWork<Rest>] : [];\n\nexport interface ImplArgs extends CstDef {\n  cache: WeakMap<RuleDef, unknown>;\n  context: {\n    dataFactory: DataFactory<RDF.BaseQuad>;\n    /**\n     * Current scoped prefixes. Used for resolving prefixed names.\n     */\n    prefixes: Record<string, string>;\n    /**\n     * The base IRI for the query. Used for resolving relative IRIs.\n     */\n    baseIRI: string | undefined;\n    /**\n     * Can be used to disable the validation that used variables in a select clause are in scope.\n     */\n    skipValidation: boolean;\n    /**\n     * Set of queryModes. Primarily used for note 8, 14.\n     */\n    parseMode: Set<symbol>;\n  };\n}\n\ntype SubRuleFunc = <T extends string, U = unknown, ARGS extends any[] = []>(\n  cstDef: RuleDef<T, U, ARGS>,\n  ...argument: ARGS\n) => U;\ntype BacktrackFunc = <T extends string, U = unknown, ARGS extends any[] = []>(\n  cstDef: RuleDef<T, U, ARGS>,\n  ...argument: ARGS\n) => () => boolean;\n\nexport interface CstDef {\n  /**\n   *\n   * A Parsing DSL method use to consume a single Token.\n   * In EBNF terms this is equivalent to a Terminal.\n   *\n   * A Token will be consumed, IFF the next token in the token vector matches `tokType`.\n   * otherwise the parser may attempt to perform error recovery (if enabled).\n   *\n   * The index in the method name indicates the unique occurrence of a terminal consumption\n   * inside a the top level rule. What this means is that if a terminal appears\n   * more than once in a single rule, each appearance must have a **different** index.\n   *\n   * For example:\n   * ```\n   *   this.RULE(\"qualifiedName\", () => {\n   *   this.CONSUME1(Identifier);\n   *     this.MANY(() => {\n   *       this.CONSUME1(Dot);\n   *       // here we use CONSUME2 because the terminal\n   *       // 'Identifier' has already appeared previously in the\n   *       // the rule 'parseQualifiedName'\n   *       this.CONSUME2(Identifier);\n   *     });\n   *   })\n   * ```\n   *\n   * - See more details on the [unique suffixes requirement](http://chevrotain.io/docs/FAQ.html#NUMERICAL_SUFFIXES).\n   *\n   * @param tokType - The Type of the token to be consumed.\n   * @param options - optional properties to modify the behavior of CONSUME.\n   */\n  CONSUME: (tokType: TokenType, options?: ConsumeMethodOpts) => IToken;\n  CONSUME1: (tokType: TokenType, options?: ConsumeMethodOpts) => IToken;\n  CONSUME2: (tokType: TokenType, options?: ConsumeMethodOpts) => IToken;\n  CONSUME3: (tokType: TokenType, options?: ConsumeMethodOpts) => IToken;\n  CONSUME4: (tokType: TokenType, options?: ConsumeMethodOpts) => IToken;\n  CONSUME5: (tokType: TokenType, options?: ConsumeMethodOpts) => IToken;\n  CONSUME6: (tokType: TokenType, options?: ConsumeMethodOpts) => IToken;\n  CONSUME7: (tokType: TokenType, options?: ConsumeMethodOpts) => IToken;\n  CONSUME8: (tokType: TokenType, options?: ConsumeMethodOpts) => IToken;\n  CONSUME9: (tokType: TokenType, options?: ConsumeMethodOpts) => IToken;\n  /**\n   * Parsing DSL Method that Indicates an Optional production.\n   * in EBNF notation this is equivalent to: \"[...]\".\n   *\n   * Note that there are two syntax forms:\n   * - Passing the grammar action directly:\n   *   ```\n   *     this.OPTION(() => {\n   *       this.CONSUME(Digit)}\n   *     );\n   *   ```\n   *\n   * - using an \"options\" object:\n   *   ```\n   *     this.OPTION({\n   *       GATE:predicateFunc,\n   *       DEF: () => {\n   *         this.CONSUME(Digit)\n   *     }});\n   *   ```\n   *\n   * The optional 'GATE' property in \"options\" object form can be used to add constraints\n   * to invoking the grammar action.\n   *\n   * As in CONSUME the index in the method name indicates the occurrence\n   * of the optional production in it's top rule.\n   *\n   * @param  actionORMethodDef - The grammar action to optionally invoke once\n   *                             or an \"OPTIONS\" object describing the grammar action and optional properties.\n   *\n   * @returns The `GrammarAction` return value (OUT) if the optional syntax is encountered\n   *          or `undefined` if not.\n   */\n  OPTION: <OUT>(\n    actionORMethodDef: GrammarAction<OUT> | DSLMethodOpts<OUT>,\n  ) => OUT | undefined;\n  OPTION1: <OUT>(\n    actionORMethodDef: GrammarAction<OUT> | DSLMethodOpts<OUT>,\n  ) => OUT | undefined;\n  OPTION2: <OUT>(\n    actionORMethodDef: GrammarAction<OUT> | DSLMethodOpts<OUT>,\n  ) => OUT | undefined;\n  OPTION3: <OUT>(\n    actionORMethodDef: GrammarAction<OUT> | DSLMethodOpts<OUT>,\n  ) => OUT | undefined;\n  OPTION4: <OUT>(\n    actionORMethodDef: GrammarAction<OUT> | DSLMethodOpts<OUT>,\n  ) => OUT | undefined;\n  OPTION5: <OUT>(\n    actionORMethodDef: GrammarAction<OUT> | DSLMethodOpts<OUT>,\n  ) => OUT | undefined;\n  OPTION6: <OUT>(\n    actionORMethodDef: GrammarAction<OUT> | DSLMethodOpts<OUT>,\n  ) => OUT | undefined;\n  OPTION7: <OUT>(\n    actionORMethodDef: GrammarAction<OUT> | DSLMethodOpts<OUT>,\n  ) => OUT | undefined;\n  OPTION8: <OUT>(\n    actionORMethodDef: GrammarAction<OUT> | DSLMethodOpts<OUT>,\n  ) => OUT | undefined;\n  OPTION9: <OUT>(\n    actionORMethodDef: GrammarAction<OUT> | DSLMethodOpts<OUT>,\n  ) => OUT | undefined;\n  /**\n   * Parsing DSL method that indicates a choice between a set of alternatives must be made.\n   * This is equivalent to an EBNF alternation (A | B | C | D ...), except\n   * that the alternatives are ordered like in a PEG grammar.\n   * This means that the **first** matching alternative is always chosen.\n   *\n   * There are several forms for the inner alternatives array:\n   *\n   * - Passing alternatives array directly:\n   *   ```\n   *     this.OR([\n   *       { ALT:() => { this.CONSUME(One) }},\n   *       { ALT:() => { this.CONSUME(Two) }},\n   *       { ALT:() => { this.CONSUME(Three) }}\n   *     ])\n   *   ```\n   *\n   * - Passing alternative array directly with predicates (GATE):\n   *   ```\n   *     this.OR([\n   *       { GATE: predicateFunc1, ALT:() => { this.CONSUME(One) }},\n   *       { GATE: predicateFuncX, ALT:() => { this.CONSUME(Two) }},\n   *       { GATE: predicateFuncX, ALT:() => { this.CONSUME(Three) }}\n   *     ])\n   *   ```\n   *\n   * - These syntax forms can also be mixed:\n   *   ```\n   *     this.OR([\n   *       {\n   *         GATE: predicateFunc1,\n   *         ALT:() => { this.CONSUME(One) }\n   *       },\n   *       { ALT:() => { this.CONSUME(Two) }},\n   *       { ALT:() => { this.CONSUME(Three) }}\n   *     ])\n   *   ```\n   *\n   * - Additionally an \"options\" object may be used:\n   *   ```\n   *     this.OR({\n   *       DEF:[\n   *         { ALT:() => { this.CONSUME(One) }},\n   *         { ALT:() => { this.CONSUME(Two) }},\n   *         { ALT:() => { this.CONSUME(Three) }}\n   *       ],\n   *       // OPTIONAL property\n   *       ERR_MSG: \"A Number\"\n   *     })\n   *   ```\n   *\n   * The 'predicateFuncX' in the long form can be used to add constraints to choosing the alternative.\n   *\n   * As in CONSUME the index in the method name indicates the occurrence\n   * of the alternation production in it's top rule.\n   *\n   * @param altsOrOpts - A set of alternatives or an \"OPTIONS\" object describing the alternatives\n   * and optional properties.\n   *\n   * @returns The result of invoking the chosen alternative.\n   */\n  OR: <T>(altsOrOpts: IOrAlt<T>[] | OrMethodOpts<T>) => T;\n  OR1: <T>(altsOrOpts: IOrAlt<T>[] | OrMethodOpts<T>) => T;\n  OR2: <T>(altsOrOpts: IOrAlt<T>[] | OrMethodOpts<T>) => T;\n  OR3: <T>(altsOrOpts: IOrAlt<T>[] | OrMethodOpts<T>) => T;\n  OR4: <T>(altsOrOpts: IOrAlt<T>[] | OrMethodOpts<T>) => T;\n  OR5: <T>(altsOrOpts: IOrAlt<T>[] | OrMethodOpts<T>) => T;\n  OR6: <T>(altsOrOpts: IOrAlt<T>[] | OrMethodOpts<T>) => T;\n  OR7: <T>(altsOrOpts: IOrAlt<T>[] | OrMethodOpts<T>) => T;\n  OR8: <T>(altsOrOpts: IOrAlt<T>[] | OrMethodOpts<T>) => T;\n  OR9: <T>(altsOrOpts: IOrAlt<T>[] | OrMethodOpts<T>) => T;\n  /**\n   * Parsing DSL method, that indicates a repetition of zero or more.\n   * This is equivalent to EBNF repetition \\{...\\}.\n   *\n   * Note that there are two syntax forms:\n   * - Passing the grammar action directly:\n   *   ```\n   *     this.MANY(() => {\n   *       this.CONSUME(Comma)\n   *       this.CONSUME(Digit)\n   *      })\n   *   ```\n   *\n   * - using an \"options\" object:\n   *   ```\n   *     this.MANY({\n   *       GATE: predicateFunc,\n   *       DEF: () => {\n   *              this.CONSUME(Comma)\n   *              this.CONSUME(Digit)\n   *            }\n   *     });\n   *   ```\n   *\n   * The optional 'GATE' property in \"options\" object form can be used to add constraints\n   * to invoking the grammar action.\n   *\n   * As in CONSUME the index in the method name indicates the occurrence\n   * of the repetition production in it's top rule.\n   *\n   * @param actionORMethodDef - The grammar action to optionally invoke multiple times\n   *                             or an \"OPTIONS\" object describing the grammar action and optional properties.\n   *\n   */\n  MANY: (\n    actionORMethodDef: GrammarAction<any> | DSLMethodOpts<any>,\n  ) => void;\n  MANY1: (\n    actionORMethodDef: GrammarAction<any> | DSLMethodOpts<any>,\n  ) => void;\n  MANY2: (\n    actionORMethodDef: GrammarAction<any> | DSLMethodOpts<any>,\n  ) => void;\n  MANY3: (\n    actionORMethodDef: GrammarAction<any> | DSLMethodOpts<any>,\n  ) => void;\n  MANY4: (\n    actionORMethodDef: GrammarAction<any> | DSLMethodOpts<any>,\n  ) => void;\n  MANY5: (\n    actionORMethodDef: GrammarAction<any> | DSLMethodOpts<any>,\n  ) => void;\n  MANY6: (\n    actionORMethodDef: GrammarAction<any> | DSLMethodOpts<any>,\n  ) => void;\n  MANY7: (\n    actionORMethodDef: GrammarAction<any> | DSLMethodOpts<any>,\n  ) => void;\n  MANY8: (\n    actionORMethodDef: GrammarAction<any> | DSLMethodOpts<any>,\n  ) => void;\n  MANY9: (\n    actionORMethodDef: GrammarAction<any> | DSLMethodOpts<any>,\n  ) => void;\n  /**\n   * Parsing DSL method, that indicates a repetition of zero or more with a separator\n   * Token between the repetitions.\n   *\n   * Example:\n   *\n   * ```\n   *     this.MANY_SEP({\n   *         SEP:Comma,\n   *         DEF: () => {\n   *             this.CONSUME(Number};\n   *             // ...\n   *         })\n   * ```\n   *\n   * Note that because this DSL method always requires more than one argument the options object is always required\n   * and it is not possible to use a shorter form like in the MANY DSL method.\n   *\n   * Note that for the purposes of deciding on whether or not another iteration exists\n   * Only a single Token is examined (The separator). Therefore if the grammar being implemented is\n   * so \"crazy\" to require multiple tokens to identify an item separator please use the more basic DSL methods\n   * to implement it.\n   *\n   * As in CONSUME the index in the method name indicates the occurrence\n   * of the repetition production in it's top rule.\n   *\n   * @param options - An object defining the grammar of each iteration and the separator between iterations\n   *\n   */\n  MANY_SEP: (options: ManySepMethodOpts<any>) => void;\n  MANY_SEP1: (options: ManySepMethodOpts<any>) => void;\n  MANY_SEP2: (options: ManySepMethodOpts<any>) => void;\n  MANY_SEP3: (options: ManySepMethodOpts<any>) => void;\n  MANY_SEP4: (options: ManySepMethodOpts<any>) => void;\n  MANY_SEP5: (options: ManySepMethodOpts<any>) => void;\n  MANY_SEP6: (options: ManySepMethodOpts<any>) => void;\n  MANY_SEP7: (options: ManySepMethodOpts<any>) => void;\n  MANY_SEP8: (options: ManySepMethodOpts<any>) => void;\n  MANY_SEP9: (options: ManySepMethodOpts<any>) => void;\n  /**\n   * Convenience method, same as MANY but the repetition is of one or more.\n   * failing to match at least one repetition will result in a parsing error and\n   * cause a parsing error.\n   *\n   * @see MANY\n   *\n   * @param actionORMethodDef  - The grammar action to optionally invoke multiple times\n   *                             or an \"OPTIONS\" object describing the grammar action and optional properties.\n   *\n   */\n  AT_LEAST_ONE: (\n    actionORMethodDef: GrammarAction<any> | DSLMethodOptsWithErr<any>,\n  ) => void;\n  AT_LEAST_ONE1: (\n    actionORMethodDef: GrammarAction<any> | DSLMethodOptsWithErr<any>,\n  ) => void;\n  AT_LEAST_ONE2: (\n    actionORMethodDef: GrammarAction<any> | DSLMethodOptsWithErr<any>,\n  ) => void;\n  AT_LEAST_ONE3: (\n    actionORMethodDef: GrammarAction<any> | DSLMethodOptsWithErr<any>,\n  ) => void;\n  AT_LEAST_ONE4: (\n    actionORMethodDef: GrammarAction<any> | DSLMethodOptsWithErr<any>,\n  ) => void;\n  AT_LEAST_ONE5: (\n    actionORMethodDef: GrammarAction<any> | DSLMethodOptsWithErr<any>,\n  ) => void;\n  AT_LEAST_ONE6: (\n    actionORMethodDef: GrammarAction<any> | DSLMethodOptsWithErr<any>,\n  ) => void;\n  AT_LEAST_ONE7: (\n    actionORMethodDef: GrammarAction<any> | DSLMethodOptsWithErr<any>,\n  ) => void;\n  AT_LEAST_ONE8: (\n    actionORMethodDef: GrammarAction<any> | DSLMethodOptsWithErr<any>,\n  ) => void;\n  AT_LEAST_ONE9: (\n    actionORMethodDef: GrammarAction<any> | DSLMethodOptsWithErr<any>,\n  ) => void;\n  /**\n   * Convenience method, same as MANY_SEP but the repetition is of one or more.\n   * failing to match at least one repetition will result in a parsing error and\n   * cause the parser to attempt error recovery.\n   *\n   * Note that an additional optional property ERR_MSG can be used to provide custom error messages.\n   *\n   * @see MANY_SEP\n   *\n   * @param options - An object defining the grammar of each iteration and the separator between iterations\n   *\n   * @return {ISeparatedIterationResult<OUT>}\n   */\n  AT_LEAST_ONE_SEP: (options: AtLeastOneSepMethodOpts<any>) => void;\n  AT_LEAST_ONE_SEP1: (options: AtLeastOneSepMethodOpts<any>) => void;\n  AT_LEAST_ONE_SEP2: (options: AtLeastOneSepMethodOpts<any>) => void;\n  AT_LEAST_ONE_SEP3: (options: AtLeastOneSepMethodOpts<any>) => void;\n  AT_LEAST_ONE_SEP4: (options: AtLeastOneSepMethodOpts<any>) => void;\n  AT_LEAST_ONE_SEP5: (options: AtLeastOneSepMethodOpts<any>) => void;\n  AT_LEAST_ONE_SEP6: (options: AtLeastOneSepMethodOpts<any>) => void;\n  AT_LEAST_ONE_SEP7: (options: AtLeastOneSepMethodOpts<any>) => void;\n  AT_LEAST_ONE_SEP8: (options: AtLeastOneSepMethodOpts<any>) => void;\n  AT_LEAST_ONE_SEP9: (options: AtLeastOneSepMethodOpts<any>) => void;\n  ACTION: <T>(impl: () => T) => T;\n  BACKTRACK: BacktrackFunc;\n  SUBRULE: SubRuleFunc;\n  SUBRULE1: SubRuleFunc;\n  SUBRULE2: SubRuleFunc;\n  SUBRULE3: SubRuleFunc;\n  SUBRULE4: SubRuleFunc;\n  SUBRULE5: SubRuleFunc;\n  SUBRULE6: SubRuleFunc;\n  SUBRULE7: SubRuleFunc;\n  SUBRULE8: SubRuleFunc;\n  SUBRULE9: SubRuleFunc;\n}\n"]}

package/lib/grammar-helpers/utils.d.ts

@@ -11,6 +11,6 @@ export declare enum CommonIRIs {
 }
 export declare function unCapitalize<T extends string>(str: T): Uncapitalize<T>;
 /**
- * Resolves an IRI against a base path
+ * Resolves an IRI against a base path in accordance to the [Syntax for IRIs](https://www.w3.org/TR/sparql11-query/#QSynIRI)
  */
 export declare function resolveIRI(iri: string, base: string | undefined): string;

package/lib/grammar-helpers/utils.js

@@ -16,7 +16,7 @@ export function unCapitalize(str) {
     return (str.charAt(0).toLowerCase() + str.slice(1));
 }
 /**
- * Resolves an IRI against a base path
+ * Resolves an IRI against a base path in accordance to the [Syntax for IRIs](https://www.w3.org/TR/sparql11-query/#QSynIRI)
  */
 export function resolveIRI(iri, base) {
     // Return absolute IRIs unmodified
@@ -38,10 +38,16 @@ export function resolveIRI(iri, base) {
             return base.replace(/(?:\?.*)?$/u, iri);
         // Resolve root relative IRIs at the root of the base IRI
         case '/':
-            return base + iri;
+            const baseMatch = base.match(/^(?:[a-z]+:\/*)?[^\/]*/);
+            if (!baseMatch) {
+                throw new Error(`Could not determine relative IRI using base: ${base}`);
+            }
+            const baseRoot = baseMatch[0];
+            return baseRoot + iri;
         // Resolve all other IRIs at the base IRI's path
         default:
-            return base + iri;
+            const basePath = base.replace(/[^\/:]*$/, '');
+            return basePath + iri;
     }
 }
 //# sourceMappingURL=utils.js.map

package/lib/grammar-helpers/utils.js.map

@@ -1 +1 @@
-{"version":3,"file":"utils.js","sourceRoot":"","sources":["utils.ts"],"names":[],"mappings":"AAAA,MAAM,CAAN,IAAY,UAYX;AAZD,WAAY,UAAU;IACpB,MAAM;IACN,kEAAoD,CAAA;IACpD,kEAAoD,CAAA;IACpD,kEAAoD,CAAA;IACpD,gEAAkD,CAAA;IAClD,MAAM;IACN,wEAA0D,CAAA;IAC1D,sEAAwD,CAAA;IACxD,oEAAsD,CAAA;IACtD,sEAAwD,CAAA;IACxD,4EAA8D,CAAA;AAChE,CAAC,EAZW,UAAU,KAAV,UAAU,QAYrB;AAED,MAAM,UAAU,YAAY,CAAmB,GAAM;IACnD,OAAyB,CAAC,GAAG,CAAC,MAAM,CAAC,CAAC,CAAC,CAAC,WAAW,EAAE,GAAG,GAAG,CAAC,KAAK,CAAC,CAAC,CAAC,CAAC,CAAC;AACxE,CAAC;AAED;;GAEG;AACH,MAAM,UAAU,UAAU,CAAC,GAAW,EAAE,IAAwB;IAC9D,kCAAkC;IAClC,IAAI,sBAAsB,CAAC,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC;QACrC,OAAO,GAAG,CAAC;IACb,CAAC;IACD,IAAI,CAAC,IAAI,EAAE,CAAC;QACV,MAAM,IAAI,KAAK,CAAC,+BAA+B,GAAG,+BAA+B,CAAC,CAAC;IACrF,CAAC;IACD,QAAQ,GAAG,CAAC,CAAC,CAAC,EAAE,CAAC;QACf,+CAA+C;QAC/C,KAAK,SAAS;YACZ,OAAO,IAAI,CAAC;QACd,sDAAsD;QACtD,KAAK,GAAG;YACN,OAAO,IAAI,GAAG,GAAG,CAAC;QACpB,mEAAmE;QACnE,KAAK,GAAG;YACN,OAAO,IAAI,CAAC,OAAO,CAAC,aAAa,EAAE,GAAG,CAAC,CAAC;QAC1C,yDAAyD;QACzD,KAAK,GAAG;YACN,OAAO,IAAI,GAAG,GAAG,CAAC;QACpB,gDAAgD;QAChD;YACE,OAAO,IAAI,GAAG,GAAG,CAAC;IACtB,CAAC;AACH,CAAC","sourcesContent":["export enum CommonIRIs {\n  // XSD\n  BOOLEAN = 'http://www.w3.org/2001/XMLSchema#boolean',\n  INTEGER = 'http://www.w3.org/2001/XMLSchema#integer',\n  DECIMAL = 'http://www.w3.org/2001/XMLSchema#decimal',\n  DOUBLE = 'http://www.w3.org/2001/XMLSchema#double',\n  // RDF\n  FIRST = 'http://www.w3.org/1999/02/22-rdf-syntax-ns#first',\n  REST = 'http://www.w3.org/1999/02/22-rdf-syntax-ns#rest',\n  NIL = 'http://www.w3.org/1999/02/22-rdf-syntax-ns#nil',\n  TYPE = 'http://www.w3.org/1999/02/22-rdf-syntax-ns#type',\n  REIFIES = 'http://www.w3.org/1999/02/22-rdf-syntax-ns#reifies',\n}\n\nexport function unCapitalize<T extends string>(str: T): Uncapitalize<T> {\n  return <Uncapitalize<T>> (str.charAt(0).toLowerCase() + str.slice(1));\n}\n\n/**\n * Resolves an IRI against a base path\n */\nexport function resolveIRI(iri: string, base: string | undefined): string {\n  // Return absolute IRIs unmodified\n  if (/^[a-z][\\d+.a-z-]*:/iu.test(iri)) {\n    return iri;\n  }\n  if (!base) {\n    throw new Error(`Cannot resolve relative IRI ${iri} because no base IRI was set.`);\n  }\n  switch (iri[0]) {\n    // An empty relative IRI indicates the base IRI\n    case undefined:\n      return base;\n    // Resolve relative fragment IRIs against the base IRI\n    case '#':\n      return base + iri;\n    // Resolve relative query string IRIs by replacing the query string\n    case '?':\n      return base.replace(/(?:\\?.*)?$/u, iri);\n    // Resolve root relative IRIs at the root of the base IRI\n    case '/':\n      return base + iri;\n    // Resolve all other IRIs at the base IRI's path\n    default:\n      return base + iri;\n  }\n}\n\n\n"]}
+{"version":3,"file":"utils.js","sourceRoot":"","sources":["utils.ts"],"names":[],"mappings":"AAAA,MAAM,CAAN,IAAY,UAYX;AAZD,WAAY,UAAU;IACpB,MAAM;IACN,kEAAoD,CAAA;IACpD,kEAAoD,CAAA;IACpD,kEAAoD,CAAA;IACpD,gEAAkD,CAAA;IAClD,MAAM;IACN,wEAA0D,CAAA;IAC1D,sEAAwD,CAAA;IACxD,oEAAsD,CAAA;IACtD,sEAAwD,CAAA;IACxD,4EAA8D,CAAA;AAChE,CAAC,EAZW,UAAU,KAAV,UAAU,QAYrB;AAED,MAAM,UAAU,YAAY,CAAmB,GAAM;IACnD,OAAyB,CAAC,GAAG,CAAC,MAAM,CAAC,CAAC,CAAC,CAAC,WAAW,EAAE,GAAG,GAAG,CAAC,KAAK,CAAC,CAAC,CAAC,CAAC,CAAC;AACxE,CAAC;AAED;;GAEG;AACH,MAAM,UAAU,UAAU,CAAC,GAAW,EAAE,IAAwB;IAC9D,kCAAkC;IAClC,IAAI,sBAAsB,CAAC,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC;QACrC,OAAO,GAAG,CAAC;IACb,CAAC;IACD,IAAI,CAAC,IAAI,EAAE,CAAC;QACV,MAAM,IAAI,KAAK,CAAC,+BAA+B,GAAG,+BAA+B,CAAC,CAAC;IACrF,CAAC;IACD,QAAQ,GAAG,CAAC,CAAC,CAAC,EAAE,CAAC;QACf,+CAA+C;QAC/C,KAAK,SAAS;YACZ,OAAO,IAAI,CAAC;QACd,sDAAsD;QACtD,KAAK,GAAG;YACN,OAAO,IAAI,GAAG,GAAG,CAAC;QACpB,mEAAmE;QACnE,KAAK,GAAG;YACN,OAAO,IAAI,CAAC,OAAO,CAAC,aAAa,EAAE,GAAG,CAAC,CAAC;QAC1C,yDAAyD;QACzD,KAAK,GAAG;YACN,MAAM,SAAS,GAAG,IAAI,CAAC,KAAK,CAAC,wBAAwB,CAAC,CAAC;YACvD,IAAI,CAAC,SAAS,EAAE,CAAC;gBACf,MAAM,IAAI,KAAK,CAAC,gDAAgD,IAAI,EAAE,CAAC,CAAC;YAC1E,CAAC;YACD,MAAM,QAAQ,GAAG,SAAS,CAAC,CAAC,CAAC,CAAC;YAC9B,OAAO,QAAQ,GAAG,GAAG,CAAC;QACxB,gDAAgD;QAChD;YACE,MAAM,QAAQ,GAAG,IAAI,CAAC,OAAO,CAAC,UAAU,EAAE,EAAE,CAAC,CAAC;YAC9C,OAAO,QAAQ,GAAG,GAAG,CAAC;IAC1B,CAAC;AACH,CAAC","sourcesContent":["export enum CommonIRIs {\n  // XSD\n  BOOLEAN = 'http://www.w3.org/2001/XMLSchema#boolean',\n  INTEGER = 'http://www.w3.org/2001/XMLSchema#integer',\n  DECIMAL = 'http://www.w3.org/2001/XMLSchema#decimal',\n  DOUBLE = 'http://www.w3.org/2001/XMLSchema#double',\n  // RDF\n  FIRST = 'http://www.w3.org/1999/02/22-rdf-syntax-ns#first',\n  REST = 'http://www.w3.org/1999/02/22-rdf-syntax-ns#rest',\n  NIL = 'http://www.w3.org/1999/02/22-rdf-syntax-ns#nil',\n  TYPE = 'http://www.w3.org/1999/02/22-rdf-syntax-ns#type',\n  REIFIES = 'http://www.w3.org/1999/02/22-rdf-syntax-ns#reifies',\n}\n\nexport function unCapitalize<T extends string>(str: T): Uncapitalize<T> {\n  return <Uncapitalize<T>> (str.charAt(0).toLowerCase() + str.slice(1));\n}\n\n/**\n * Resolves an IRI against a base path in accordance to the [Syntax for IRIs](https://www.w3.org/TR/sparql11-query/#QSynIRI)\n */\nexport function resolveIRI(iri: string, base: string | undefined): string {\n  // Return absolute IRIs unmodified\n  if (/^[a-z][\\d+.a-z-]*:/iu.test(iri)) {\n    return iri;\n  }\n  if (!base) {\n    throw new Error(`Cannot resolve relative IRI ${iri} because no base IRI was set.`);\n  }\n  switch (iri[0]) {\n    // An empty relative IRI indicates the base IRI\n    case undefined:\n      return base;\n    // Resolve relative fragment IRIs against the base IRI\n    case '#':\n      return base + iri;\n    // Resolve relative query string IRIs by replacing the query string\n    case '?':\n      return base.replace(/(?:\\?.*)?$/u, iri);\n    // Resolve root relative IRIs at the root of the base IRI\n    case '/':\n      const baseMatch = base.match(/^(?:[a-z]+:\\/*)?[^\\/]*/);\n      if (!baseMatch) {\n        throw new Error(`Could not determine relative IRI using base: ${base}`);\n      }\n      const baseRoot = baseMatch[0];\n      return baseRoot + iri;\n    // Resolve all other IRIs at the base IRI's path\n    default:\n      const basePath = base.replace(/[^\\/:]*$/, '');\n      return basePath + iri;\n  }\n}\n\n\n"]}

package/lib/index.cjs

@@ -9649,7 +9649,7 @@ var Builder = class _Builder {
     const parser = this.consume({ tokenVocabulary, config: parserConfig }, context);
     const selfSufficientParser = {};
     for (const rule of Object.values(this.rules)) {
-      selfSufficientParser[rule.name] = (input, ...args) => {
+      selfSufficientParser[rule.name] = (input, arg) => {
         input = input.replaceAll(
           /\\u([0-9a-fA-F]{4})|\\U([0-9a-fA-F]{8})/gu,
           (_, unicode4, unicode8) => {
@@ -9671,7 +9671,7 @@ var Builder = class _Builder {
         const lexResult = lexer.tokenize(input);
         parser.reset();
         parser.input = lexResult.tokens;
-        const result = parser[rule.name](...args);
+        const result = parser[rule.name](arg);
         if (parser.errors.length > 0) {
           throw new Error(`Parse error on line ${parser.errors.map((x) => x.token.startLine).join(", ")}
 ${parser.errors.map((x) => `${x.token.startLine}: ${x.message}`).join("\n")}`);
@@ -9695,8 +9695,6 @@ ${parser.errors.map((x) => `${x.token.startLine}: ${x.message}`).join("\n")}`);
         this.initialParseContext = {
           dataFactory: new import_rdf_data_factory.DataFactory({ blankNodePrefix: "g_" }),
           baseIRI: void 0,
-          flushedBlankNodeLabels: /* @__PURE__ */ new Set(),
-          usedBlankNodeLabels: /* @__PURE__ */ new Set(),
           parseMode: /* @__PURE__ */ new Set(),
           skipValidation: false,
           ...context,
@@ -9724,10 +9722,13 @@ ${parser.errors.map((x) => `${x.token.startLine}: ${x.message}`).join("\n")}`);
         });
         this.runningContext.prefixes = { ...this.initialParseContext.prefixes };
         this.runningContext.parseMode = new Set(this.initialParseContext.parseMode);
-        this.runningContext.usedBlankNodeLabels.clear();
-        this.runningContext.flushedBlankNodeLabels.clear();
       }
       getSelfRef() {
+        const subRuleImpl = (subrule) => {
+          return (cstDef, ...args) => {
+            return subrule(this[cstDef.name], { ARGS: args });
+          };
+        };
         return {
           CONSUME: (tokenType, option) => this.CONSUME(tokenType, option),
           CONSUME1: (tokenType, option) => this.CONSUME1(tokenType, option),
@@ -9807,76 +9808,16 @@ ${parser.errors.map((x) => `${x.token.startLine}: ${x.message}`).join("\n")}`);
               throw error;
             }
           },
-          SUBRULE: (cstDef, ...args) => {
-            try {
-              return this.SUBRULE(this[cstDef.name], { ARGS: args });
-            } catch (error) {
-              throw error;
-            }
-          },
-          SUBRULE1: (cstDef, ...args) => {
-            try {
-              return this.SUBRULE1(this[cstDef.name], { ARGS: args });
-            } catch (error) {
-              throw error;
-            }
-          },
-          SUBRULE2: (cstDef, ...args) => {
-            try {
-              return this.SUBRULE2(this[cstDef.name], { ARGS: args });
-            } catch (error) {
-              throw error;
-            }
-          },
-          SUBRULE3: (cstDef, ...args) => {
-            try {
-              return this.SUBRULE3(this[cstDef.name], { ARGS: args });
-            } catch (error) {
-              throw error;
-            }
-          },
-          SUBRULE4: (cstDef, ...args) => {
-            try {
-              return this.SUBRULE4(this[cstDef.name], { ARGS: args });
-            } catch (error) {
-              throw error;
-            }
-          },
-          SUBRULE5: (cstDef, ...args) => {
-            try {
-              return this.SUBRULE5(this[cstDef.name], { ARGS: args });
-            } catch (error) {
-              throw error;
-            }
-          },
-          SUBRULE6: (cstDef, ...args) => {
-            try {
-              return this.SUBRULE6(this[cstDef.name], { ARGS: args });
-            } catch (error) {
-              throw error;
-            }
-          },
-          SUBRULE7: (cstDef, ...args) => {
-            try {
-              return this.SUBRULE7(this[cstDef.name], { ARGS: args });
-            } catch (error) {
-              throw error;
-            }
-          },
-          SUBRULE8: (cstDef, ...args) => {
-            try {
-              return this.SUBRULE8(this[cstDef.name], { ARGS: args });
-            } catch (error) {
-              throw error;
-            }
-          },
-          SUBRULE9: (cstDef, ...args) => {
-            try {
-              return this.SUBRULE9(this[cstDef.name], { ARGS: args });
-            } catch (error) {
-              throw error;
-            }
-          }
+          SUBRULE: subRuleImpl((rule, args) => this.SUBRULE(rule, args)),
+          SUBRULE1: subRuleImpl((rule, args) => this.SUBRULE1(rule, args)),
+          SUBRULE2: subRuleImpl((rule, args) => this.SUBRULE2(rule, args)),
+          SUBRULE3: subRuleImpl((rule, args) => this.SUBRULE3(rule, args)),
+          SUBRULE4: subRuleImpl((rule, args) => this.SUBRULE4(rule, args)),
+          SUBRULE5: subRuleImpl((rule, args) => this.SUBRULE5(rule, args)),
+          SUBRULE6: subRuleImpl((rule, args) => this.SUBRULE6(rule, args)),
+          SUBRULE7: subRuleImpl((rule, args) => this.SUBRULE7(rule, args)),
+          SUBRULE8: subRuleImpl((rule, args) => this.SUBRULE8(rule, args)),
+          SUBRULE9: subRuleImpl((rule, args) => this.SUBRULE9(rule, args))
         };
       }
     }
@@ -9919,10 +9860,16 @@ function resolveIRI(iri, base) {
       return base.replace(/(?:\?.*)?$/u, iri);
     // Resolve root relative IRIs at the root of the base IRI
     case "/":
-      return base + iri;
+      const baseMatch = base.match(/^(?:[a-z]+:\/*)?[^\/]*/);
+      if (!baseMatch) {
+        throw new Error(`Could not determine relative IRI using base: ${base}`);
+      }
+      const baseRoot = baseMatch[0];
+      return baseRoot + iri;
     // Resolve all other IRIs at the base IRI's path
     default:
-      return base + iri;
+      const basePath = base.replace(/[^\/:]*$/, "");
+      return basePath + iri;
   }
 }
 

package/package.json

@@ -1,6 +1,6 @@
 {
   "name": "@traqula/core",
-  "version": "0.0.1-alpha.141+caaf4c7",
+  "version": "0.0.1-alpha.145+b7fd73e",
   "description": "Core components of TRAQULA",
   "lsd:module": true,
   "license": "MIT",
@@ -45,5 +45,5 @@
     "@chevrotain/types": "^11.0.3",
     "@rdfjs/types": "^2.0.0"
   },
-  "gitHead": "caaf4c71153d27f8fa113b51efb1dae91e182960"
+  "gitHead": "b7fd73efdfc32dec46beaa040431ba031a723b53"
 }