parser-combinators 1.1.3 → 1.2.1

package/README.md

@@ -1,8 +1,8 @@
 ## Parser Combinators
 
-![GitHub Workflow Status (branch)](https://img.shields.io/github/workflow/status/michalusio/Parser/CI/master)
+[![CI](https://github.com/michalusio/Parser/actions/workflows/CI.yml/badge.svg)](https://github.com/michalusio/Parser/actions/workflows/CI.yml)
 [![CodeQL](https://github.com/michalusio/Parser/actions/workflows/codeql-analysis.yml/badge.svg?branch=master)](https://github.com/michalusio/Parser/actions/workflows/codeql-analysis.yml)
-![Codecov](https://img.shields.io/codecov/c/github/michalusio/Parser)
+[![codecov](https://codecov.io/gh/michalusio/Parser/branch/master/graph/badge.svg?token=gtTR0hPodY)](https://codecov.io/gh/michalusio/Parser)
 
 ![NPM](https://img.shields.io/npm/l/parser-combinators)
 [![NPM Version](https://badge.fury.io/js/parser-combinators.svg)](https://badge.fury.io/js/parser-combinators)
@@ -33,12 +33,14 @@ A library of parser combinators, with which you can create your own parsers.
   - `opt`ional
   - `regex`
   - `seq`uence
-  - `str`ing
+  - `str`ing and `stri`ng (case-insensitive)
 - Utility combinators:
   - `ref`er
   - `expect`
   - `expectErase`
   - `surely`
+  - `token`
+  - `lookaround`
 - Ready-made value combinators:
   - `spaces`
   - `spacesPlus`
@@ -46,10 +48,28 @@ A library of parser combinators, with which you can create your own parsers.
   - `bool` (and `boolP`)
   - `int` (and `intP`)
   - `real` (and `realP`)
+  - `eof`
+- Recovery combinators:
+  - `recoverBySkippingChars`
+  - `recoverByAddingChars`
 - Whole parsers:
   - Extended Backus-Naur Form (`EBNF`)
   - JavaScript Object Notation (`JSON`)
 
+##### Optimization remarks:
+
+Combining many string parsers using an `any` parser uses parser fusion.
+This means that a parser of the form e.g. `any(str(...), ..., str())` is automatically converted into a search trie.
+This drastically decreases the number of callbacks, and improves performance because all search strings are checked "at once" by going over the trie.
+
+Nested `any` parsers are also supported, as well as `stri` parsers, so all of these undergo fusion:
+
+    any(str('QeQMTvqJuS'), str('IoOYSLNPlM'), str('SpFMUWpzHs'))
+
+    any(str('QeQMTvqJuS'), any(str('IoOYSLNPlM'), str('SpFMUWpzHs')))
+
+    any(str('QeQMTvqJuS'), stri('QeQMTvqJuS'), str('QeqmtabeacErEmTDUUIFcFpsAJhfwqXN'), str('SpFMUWpzHs'))
+
 ### Example usage:
 
 ##### Using standard combinators:
@@ -85,3 +105,24 @@ A library of parser combinators, with which you can create your own parsers.
         'The number must be over 1.5!'
     );
     const result = ParseText(' number: 1.25  ', parser); // Will throw a ParseError('The number must be over 1.5!')
+
+##### Pretty messages available on parsing errors:
+
+    import { spacesPlus, str } from 'parser-combinators/parsers';
+    import { ParseText } from 'parser-combinators';
+
+    const parser = seq(
+      str('Lazy fox jumps'), spacesPlus, str('over'), spacesPlus, str('a lazy dog')
+    );
+
+    try {
+      const result = ParseText('Lazy fox jumps under a lazy dog', parser);
+    } catch (e) {
+      console.error(e.getPrettyErrorMessage());
+    }
+
+Will write:
+
+    Parse error, expected over at char 15 (line 1, col 16):
+    Lazy fox jumps under a lazy dog
+    ---------------^

package/dist/index.d.ts

@@ -1,3 +1,3 @@
-export * from "./types";
-export * from "./parsers";
-export * from "./parser";
+export * from "./types";
+export * from "./parsers";
+export * from "./parser";

package/dist/index.js

@@ -1,19 +1,19 @@
-"use strict";
-var __createBinding = (this && this.__createBinding) || (Object.create ? (function(o, m, k, k2) {
-    if (k2 === undefined) k2 = k;
-    var desc = Object.getOwnPropertyDescriptor(m, k);
-    if (!desc || ("get" in desc ? !m.__esModule : desc.writable || desc.configurable)) {
-      desc = { enumerable: true, get: function() { return m[k]; } };
-    }
-    Object.defineProperty(o, k2, desc);
-}) : (function(o, m, k, k2) {
-    if (k2 === undefined) k2 = k;
-    o[k2] = m[k];
-}));
-var __exportStar = (this && this.__exportStar) || function(m, exports) {
-    for (var p in m) if (p !== "default" && !Object.prototype.hasOwnProperty.call(exports, p)) __createBinding(exports, m, p);
-};
-Object.defineProperty(exports, "__esModule", { value: true });
-__exportStar(require("./types"), exports);
-__exportStar(require("./parsers"), exports);
-__exportStar(require("./parser"), exports);
+"use strict";
+var __createBinding = (this && this.__createBinding) || (Object.create ? (function(o, m, k, k2) {
+    if (k2 === undefined) k2 = k;
+    var desc = Object.getOwnPropertyDescriptor(m, k);
+    if (!desc || ("get" in desc ? !m.__esModule : desc.writable || desc.configurable)) {
+      desc = { enumerable: true, get: function() { return m[k]; } };
+    }
+    Object.defineProperty(o, k2, desc);
+}) : (function(o, m, k, k2) {
+    if (k2 === undefined) k2 = k;
+    o[k2] = m[k];
+}));
+var __exportStar = (this && this.__exportStar) || function(m, exports) {
+    for (var p in m) if (p !== "default" && !Object.prototype.hasOwnProperty.call(exports, p)) __createBinding(exports, m, p);
+};
+Object.defineProperty(exports, "__esModule", { value: true });
+__exportStar(require("./types"), exports);
+__exportStar(require("./parsers"), exports);
+__exportStar(require("./parser"), exports);

package/dist/index.min.js

@@ -0,0 +1,4 @@
+"use strict";(()=>{var a=(e,n)=>()=>(n||e((n={exports:{}}).exports,n),n.exports);var l=a(p=>{"use strict";Object.defineProperty(p,"__esModule",{value:!0});p.ParseError=void 0;p.isFailure=be;p.success=k;p.failure=ee;p.result=ve;p.fail=Pe;function be(e){return!e.success}function k(e,n){return{success:!0,value:n,ctx:e}}function ee(e,n,t){return{success:!1,expected:n,ctx:e,history:t}}function ve(e){return n=>k(n,e)}function Pe(e){return n=>ee(n,e,[e])}var B=class extends Error{constructor(n,t,r,s){super(n),this.index=r,this.history=s,[this.line,this.column,this.row]=this.getInputData(t,r)}getInputData(n,t){let r=n.split(`
+`),s=0;for(;t>0;){if(r[s].length>t)return[r[s],t+1,s+1];t-=r[s].length+1,s+=1}return[r[s],t+1,s+1]}getPrettyErrorMessage(){return`${this.message} (line ${this.row}, col ${this.column}):
+${this.line}
+${(this.column>0?"-".repeat(this.column-1):"")+"^"}`}};p.ParseError=B});var te=a(z=>{"use strict";Object.defineProperty(z,"__esModule",{value:!0});z.anyString=Oe;var re=l();function Oe(e){let n=`'${e[e.length-1][0]}'`,t;return Object.assign(r=>{t??=we(e);let s=Me(t,r.text,r.index);return s?(0,re.success)({...r,index:s.end},e[s.matchIndex][0]):(0,re.failure)(r,n,["any",n])},{parserType:"anyString",matches:e})}function we(e){let n=new Map;return e.forEach((t,r)=>w(n,t,r)),n}function w(e,n,t,r=0){if(r>=n[0].length)e.matchIndex!=null?e.matchIndex=Math.min(e.matchIndex,t):e.matchIndex=t;else{let s=n[0][r],u=s.toLowerCase(),i=s.toUpperCase(),g=new Map;if(n[1]&&u!==i){let q=e.get(u)??g,_=e.get(i)??g;e.set(u,q),e.set(i,_),w(q,n,t,r+1),q!==_&&w(_,n,t,r+1)}else{let q=e.get(s)??g;e.set(s,q);let _=e.get(u);if(_===e.get(i)){let Z=new Map(_.entries());Z.matchIndex=_.matchIndex,e.set(i,Z)}w(q,n,t,r+1)}}}function Me(e,n,t){let r,s,u=e;for(let i=t;i<n.length;i++){let g=n[i];if(u.matchIndex!=null&&(s==null||u.matchIndex<=s)&&(r=i,s=u.matchIndex),u=u.get(g),!u)break}return u&&u.matchIndex!=null&&(s==null||u.matchIndex<=s)&&(r=n.length,s=u.matchIndex),r==null?void 0:{end:r,matchIndex:s}}});var M=a(f=>{"use strict";Object.defineProperty(f,"__esModule",{value:!0});f.toggleFusions=f.shouldPerformFusions=void 0;f.ref=Fe;f.expect=se;f.expectErase=Se;f.surely=$e;f.token=Te;f.lookaround=Ie;var h=l(),je=()=>ne;f.shouldPerformFusions=je;var ne=!0,me=e=>{ne=e};f.toggleFusions=me;function Fe(e,n,t){return r=>{let s=e(r);return!(0,h.isFailure)(s)&&!n(s.value)?(0,h.failure)(s.ctx,t??"check",[`ref: ${t??"check"}`]):s}}function se(e,n){return t=>{let r=e(t);return(0,h.isFailure)(r)?(0,h.failure)(r.ctx,n,[n,...r.history]):r}}function Se(e,n){return t=>{let r=e(t);return(0,h.isFailure)(r)?(0,h.failure)(r.ctx,n,[n]):r}}function $e(e){return se(e,"surely")}function Te(e){return n=>{let t=e(n);return t.success?{...t,value:{value:t.value,start:n.index,end:t.ctx.index}}:t}}function Ie(e){return n=>{let t=e(n);return t.success?(0,h.success)(n,void 0):(0,h.failure)(n,t.expected,["lookaround",...t.history])}}});var ue=a(R=>{"use strict";Object.defineProperty(R,"__esModule",{value:!0});R.any=ze;var D=l(),Ee=te(),Ce=M(),Be=["str","stri","anyString"];function ze(...e){let n={};if((0,Ce.shouldPerformFusions)()&&e.every(t=>"parserType"in t&&typeof t.parserType=="string"&&Be.includes(t.parserType))){let r=e.flatMap(s=>{switch(s.parserType){case"anyString":return s.matches;case"str":return[[s.match,!1]];case"stri":return[[s.match,!0]]}});if(r.length>10)return(0,Ee.anyString)(r);n={parserType:"anyString",matches:r}}return Object.assign(t=>{let r=[];for(let u of e){let i=u(t);if((0,D.isFailure)(i)){if(i.history.includes("surely"))return(0,D.failure)(i.ctx,i.expected,i.history.filter(g=>g!=="surely"));r.push(i)}else return i}let s=r.reduce((u,i)=>u.history.length>i.history.length?u:i);return(0,D.failure)(s.ctx,s.expected,["any",...s.history])},n)}});var v=a(Q=>{"use strict";Object.defineProperty(Q,"__esModule",{value:!0});Q.seq=De;var N=l();function De(...e){return n=>{let t=[];for(let r of e){let s=r(n);if(n=s.ctx,(0,N.isFailure)(s))return(0,N.failure)(s.ctx,s.expected,["seq",...s.history]);t.push(s.value)}return(0,N.success)(n,t)}}});var oe=a(A=>{"use strict";Object.defineProperty(A,"__esModule",{value:!0});A.between=Ne;var ie=l(),Re=v();function Ne(e,n,t){let r=(0,Re.seq)(e,n,t);return s=>{let u=r(s);if((0,ie.isFailure)(u)){let i=[...u.history];return i.splice(0,1),(0,ie.failure)(u.ctx,u.expected,["between",...i])}return{...u,value:u.value[1]}}}});var ce=a(H=>{"use strict";Object.defineProperty(H,"__esModule",{value:!0});H.exhaust=Qe;var P=l();function Qe(e,n=null){return t=>{let r=[];for(;;){let s=e(t);if((0,P.isFailure)(s))return n===null||(0,P.isFailure)(n(t))?(0,P.failure)(s.ctx,s.expected,["exhaust",...s.history]):(0,P.success)(t,r);if(t=s.ctx,r.push(s.value),s.ctx.index===s.ctx.text.length)return(0,P.success)(s.ctx,r)}}}});var m=a(L=>{"use strict";Object.defineProperty(L,"__esModule",{value:!0});L.map=Ae;var j=l();function Ae(e,n){return t=>{let r=e(t);if((0,j.isFailure)(r))return(0,j.failure)(r.ctx,r.expected,["map",...r.history]);try{let s=n(r.value);return(0,j.success)(r.ctx,s)}catch{return(0,j.failure)(r.ctx,"Error while mapping",["map"])}}}});var F=a(U=>{"use strict";Object.defineProperty(U,"__esModule",{value:!0});U.opt=He;var ae=l();function He(e){return n=>{let t=e(n);return(0,ae.isFailure)(t)?(0,ae.success)(n,null):t}}});var fe=a(b=>{"use strict";Object.defineProperty(b,"__esModule",{value:!0});b.many=V;b.zeroOrMany=Ue;b.oneOrMany=le;b.oneOrManyRed=Ve;var S=l(),x=m(),Le=F(),$=v();function V(e){return n=>{let t=[];for(;;){let r=e(n);if((0,S.isFailure)(r))return(0,S.success)(n,t);n=r.ctx,t.push(r.value)}}}function Ue(e,n){return(0,x.map)((0,Le.opt)(le(e,n)),t=>t??[])}function le(e,n=void 0){let t=(0,x.map)((0,$.seq)(e,V(n?(0,x.map)((0,$.seq)(n,e),([,r])=>r):e)),([r,s])=>[r,...s]);return r=>{let s=t(r);if((0,S.isFailure)(s)){let u=[...s.history];return u.splice(0,2),(0,S.failure)(s.ctx,s.expected,["oneOrMany",...u])}return s}}function Ve(e,n,t){return(0,x.map)((0,x.map)((0,$.seq)((0,x.map)(e,r=>[null,r]),V((0,$.seq)(n,e))),([r,s])=>[r,...s]),r=>{let s=r[0][1];for(let u=1;u<r.length;u++)s=t(s,r[u][1],r[u][0]);return s})}});var G=a(W=>{"use strict";Object.defineProperty(W,"__esModule",{value:!0});W.regex=We;var de=l();function We(e,n){let t=new RegExp(e,typeof e=="string"?"y":e.flags+"y");return r=>{t.lastIndex=r.index;let s=t.exec(r.text);return s!==null&&s.index===r.index?(0,de.success)({...r,index:r.index+s[0].length},s[0]):(0,de.failure)(r,n,[n])}}});var J=a(I=>{"use strict";Object.defineProperty(I,"__esModule",{value:!0});I.str=Ge;I.stri=Ke;var T=l();function Ge(e){let n=`'${e}'`;return Object.assign(t=>t.text.startsWith(e,t.index)?(0,T.success)({...t,index:t.index+e.length},e):(0,T.failure)(t,n,[n]),{parserType:"str",match:e})}var Je=new Intl.Collator("en",{sensitivity:"accent"});function Ke(e){let n=e.toLowerCase(),t=`'${n}'`;return Object.assign(r=>{let s=r.text.slice(r.index,r.index+e.length);return Je.compare(e,s)==0?(0,T.success)({...r,index:r.index+e.length},n):(0,T.failure)(r,t,[t])},{parserType:"stri",match:n})}});var ye=a(E=>{"use strict";Object.defineProperty(E,"__esModule",{value:!0});E.recoverBySkippingChars=Xe;E.recoverByAddingChars=Ye;var pe=l();function Xe(e,n){return t=>{let r=null;for(let s=0;s<=n;s++){let u=e({index:t.index+s,path:t.path,text:t.text});if((0,pe.isFailure)(u))r??=u;else return u}return r}}function Ye(e,n){return t=>{let r=null;for(let s=0;s<=n.length;s++){let u=n.slice(0,s),i=e({index:t.index,path:t.path,text:`${t.text.slice(0,t.index)}${u}${t.text.slice(t.index)}`});if((0,pe.isFailure)(i))r??=i;else return i}return r}}});var ge=a(o=>{"use strict";Object.defineProperty(o,"__esModule",{value:!0});o.eof=o.realP=o.real=o.intP=o.int=o.boolP=o.bool=o.wspaces=o.spacesPlus=o.spaces=void 0;var he=l(),C=m(),Ze=F(),O=G(),ke=v(),er=J(),rr=M();o.spaces=(0,O.regex)(/ */,"spaces");o.spacesPlus=(0,O.regex)(/ +/,"spaces");o.wspaces=(0,Ze.opt)((0,O.regex)(/(?:\s|\t|\n|\r)+/,"whitespace characters"));o.bool=(0,O.regex)(/true|false/,"boolean");o.boolP=(0,C.map)(o.bool,e=>e==="true");o.int=(0,O.regex)(/\d+/,"integer");o.intP=(0,C.map)(o.int,e=>parseInt(e,10));o.real=(0,rr.expect)((0,C.map)((0,ke.seq)(o.int,(0,er.str)("."),o.int),([e,,n])=>`${e}.${n}`),"real");o.realP=(0,C.map)(o.real,e=>parseFloat(e));var tr=e=>e.index===e.text.length?(0,he.success)(e,void 0):(0,he.failure)(e,"End Of File",["EOF"]);o.eof=tr});var qe=a(c=>{"use strict";var nr=c&&c.__createBinding||(Object.create?(function(e,n,t,r){r===void 0&&(r=t);var s=Object.getOwnPropertyDescriptor(n,t);(!s||("get"in s?!n.__esModule:s.writable||s.configurable))&&(s={enumerable:!0,get:function(){return n[t]}}),Object.defineProperty(e,r,s)}):(function(e,n,t,r){r===void 0&&(r=t),e[r]=n[t]})),d=c&&c.__exportStar||function(e,n){for(var t in e)t!=="default"&&!Object.prototype.hasOwnProperty.call(n,t)&&nr(n,e,t)};Object.defineProperty(c,"__esModule",{value:!0});c.stri=c.str=void 0;d(ue(),c);d(oe(),c);d(ce(),c);d(fe(),c);d(m(),c);d(F(),c);d(G(),c);d(v(),c);var _e=J();Object.defineProperty(c,"str",{enumerable:!0,get:function(){return _e.str}});Object.defineProperty(c,"stri",{enumerable:!0,get:function(){return _e.stri}});d(ye(),c);d(M(),c);d(ge(),c)});var xe=a(X=>{"use strict";Object.defineProperty(X,"__esModule",{value:!0});X.ParseText=sr;var K=l();function sr(e,n,t=""){let r=n({text:e,path:t,index:0});if((0,K.isFailure)(r))throw new K.ParseError(`Parse error, expected ${[...r.history].pop()} at char ${r.ctx.index}`,e,r.ctx.index,r.history);if(r.ctx.index!==e.length)throw new K.ParseError(`Parse error, expected end of text at char ${r.ctx.index}`,e,r.ctx.index,[]);return r.value}});var ir=a(y=>{var ur=y&&y.__createBinding||(Object.create?(function(e,n,t,r){r===void 0&&(r=t);var s=Object.getOwnPropertyDescriptor(n,t);(!s||("get"in s?!n.__esModule:s.writable||s.configurable))&&(s={enumerable:!0,get:function(){return n[t]}}),Object.defineProperty(e,r,s)}):(function(e,n,t,r){r===void 0&&(r=t),e[r]=n[t]})),Y=y&&y.__exportStar||function(e,n){for(var t in e)t!=="default"&&!Object.prototype.hasOwnProperty.call(n,t)&&ur(n,e,t)};Object.defineProperty(y,"__esModule",{value:!0});Y(l(),y);Y(qe(),y);Y(xe(),y)});ir();})();

package/dist/parser.d.ts

@@ -1,16 +1,9 @@
-import { Parser } from './types';
-/** Parses the utf-8 content of a given file's content.
- * @param path The path to the file to parse.
- * @param parser The parser to use.
- * @returns The result of the parse.
- * @throws {ParseError} if the parsing fails or the parser does not consume the full input.
- */
-export declare function ParseFile<T>(path: string, parser: Parser<T>): T;
-/** Parses the given string.
- * @param text The string to parse.
- * @param parser The parser to use.
- * @param path The path of the parsed text. Can be used for error reporting.
- * @returns The result of the parse.
- * @throws {ParseError} if the parsing fails or the parser does not consume the full input.
- */
-export declare function ParseText<T>(text: string, parser: Parser<T>, path?: string): T;
+import { Parser } from './types';
+/** Parses the given string.
+ * @param text The string to parse.
+ * @param parser The parser to use.
+ * @param path The path of the parsed text. Can be used for error reporting.
+ * @returns The result of the parse.
+ * @throws {ParseError} if the parsing fails or the parser does not consume the full input.
+ */
+export declare function ParseText<T>(text: string, parser: Parser<T>, path?: string): T;

package/dist/parser.js

@@ -1,34 +1,21 @@
-"use strict";
-Object.defineProperty(exports, "__esModule", { value: true });
-exports.ParseText = exports.ParseFile = void 0;
-const fs = require("fs");
-const types_1 = require("./types");
-/** Parses the utf-8 content of a given file's content.
- * @param path The path to the file to parse.
- * @param parser The parser to use.
- * @returns The result of the parse.
- * @throws {ParseError} if the parsing fails or the parser does not consume the full input.
- */
-function ParseFile(path, parser) {
-    const text = fs.readFileSync(path, 'utf8');
-    return ParseText(text, parser, path);
-}
-exports.ParseFile = ParseFile;
-/** Parses the given string.
- * @param text The string to parse.
- * @param parser The parser to use.
- * @param path The path of the parsed text. Can be used for error reporting.
- * @returns The result of the parse.
- * @throws {ParseError} if the parsing fails or the parser does not consume the full input.
- */
-function ParseText(text, parser, path = '') {
-    const res = parser({ text, path, index: 0 });
-    if ((0, types_1.isFailure)(res)) {
-        throw new types_1.ParseError(`Parse error, expected ${[...res.history].pop()} at char ${res.ctx.index}`, text, res.ctx.index, res.history);
-    }
-    if (res.ctx.index !== text.length) {
-        throw new types_1.ParseError(`Parse error at index ${res.ctx.index}`, text, res.ctx.index, []);
-    }
-    return res.value;
-}
-exports.ParseText = ParseText;
+"use strict";
+Object.defineProperty(exports, "__esModule", { value: true });
+exports.ParseText = ParseText;
+const types_1 = require("./types");
+/** Parses the given string.
+ * @param text The string to parse.
+ * @param parser The parser to use.
+ * @param path The path of the parsed text. Can be used for error reporting.
+ * @returns The result of the parse.
+ * @throws {ParseError} if the parsing fails or the parser does not consume the full input.
+ */
+function ParseText(text, parser, path = '') {
+    const res = parser({ text, path, index: 0 });
+    if ((0, types_1.isFailure)(res)) {
+        throw new types_1.ParseError(`Parse error, expected ${[...res.history].pop()} at char ${res.ctx.index}`, text, res.ctx.index, res.history);
+    }
+    if (res.ctx.index !== text.length) {
+        throw new types_1.ParseError(`Parse error, expected end of text at char ${res.ctx.index}`, text, res.ctx.index, []);
+    }
+    return res.value;
+}

package/dist/parsers/any.d.ts

@@ -1,17 +1,16 @@
-import { Parser } from '../types';
-/** Parses the input using any passed parser, trying from left to right.
- * @returns A parser returning the result of the first parser that succeeds, or the failure that has come the furthest.
- */
-export declare function any<T, U, V, W, X, Z, I, J, K, L, M>(...parsers: [Parser<T>, Parser<U>, Parser<V>, Parser<W>, Parser<X>, Parser<Z>, Parser<I>, Parser<J>, Parser<K>, Parser<L>, Parser<M>]): Parser<T | U | V | W | X | Z | I | J | K | L | M>;
-export declare function any<T, U, V, W, X, Z, I, J, K, L>(...parsers: [Parser<T>, Parser<U>, Parser<V>, Parser<W>, Parser<X>, Parser<Z>, Parser<I>, Parser<J>, Parser<K>, Parser<L>]): Parser<T | U | V | W | X | Z | I | J | K | L>;
-export declare function any<T, U, V, W, X, Z, I, J, K>(...parsers: [Parser<T>, Parser<U>, Parser<V>, Parser<W>, Parser<X>, Parser<Z>, Parser<I>, Parser<J>, Parser<K>]): Parser<T | U | V | W | X | Z | I | J | K>;
-export declare function any<T, U, V, W, X, Z, I, J>(...parsers: [Parser<T>, Parser<U>, Parser<V>, Parser<W>, Parser<X>, Parser<Z>, Parser<I>, Parser<J>]): Parser<T | U | V | W | X | Z | I | J>;
-export declare function any<T, U, V, W, X, Z, I>(...parsers: [Parser<T>, Parser<U>, Parser<V>, Parser<W>, Parser<X>, Parser<Z>, Parser<I>]): Parser<T | U | V | W | X | Z | I>;
-export declare function any<T, U, V, W, X, Z>(...parsers: [Parser<T>, Parser<U>, Parser<V>, Parser<W>, Parser<X>, Parser<Z>]): Parser<T | U | V | W | X | Z>;
-export declare function any<T, U, V, W, X>(...parsers: [Parser<T>, Parser<U>, Parser<V>, Parser<W>, Parser<X>]): Parser<T | U | V | W | X>;
-export declare function any<T, U, V, W>(...parsers: [Parser<T>, Parser<U>, Parser<V>, Parser<W>]): Parser<T | U | V | W>;
-export declare function any<T, U, V>(...parsers: [Parser<T>, Parser<U>, Parser<V>]): Parser<T | U | V>;
-export declare function any<T, U>(...parsers: [Parser<T>, Parser<U>]): Parser<T | U>;
-export declare function any<T>(...parsers: [Parser<T>]): Parser<T>;
-export declare function any<T>(...parsers: Parser<T>[]): Parser<T>;
-export declare function surely<T>(parser: Parser<T>): Parser<T>;
+import { Parser } from '../types';
+/** Parses the input using any passed parser, trying from left to right.
+ * @returns A parser returning the result of the first parser that succeeds, or the failure that has come the furthest.
+ */
+export declare function any<T, U, V, W, X, Z, I, J, K, L, M>(...parsers: [Parser<T>, Parser<U>, Parser<V>, Parser<W>, Parser<X>, Parser<Z>, Parser<I>, Parser<J>, Parser<K>, Parser<L>, Parser<M>]): Parser<T | U | V | W | X | Z | I | J | K | L | M>;
+export declare function any<T, U, V, W, X, Z, I, J, K, L>(...parsers: [Parser<T>, Parser<U>, Parser<V>, Parser<W>, Parser<X>, Parser<Z>, Parser<I>, Parser<J>, Parser<K>, Parser<L>]): Parser<T | U | V | W | X | Z | I | J | K | L>;
+export declare function any<T, U, V, W, X, Z, I, J, K>(...parsers: [Parser<T>, Parser<U>, Parser<V>, Parser<W>, Parser<X>, Parser<Z>, Parser<I>, Parser<J>, Parser<K>]): Parser<T | U | V | W | X | Z | I | J | K>;
+export declare function any<T, U, V, W, X, Z, I, J>(...parsers: [Parser<T>, Parser<U>, Parser<V>, Parser<W>, Parser<X>, Parser<Z>, Parser<I>, Parser<J>]): Parser<T | U | V | W | X | Z | I | J>;
+export declare function any<T, U, V, W, X, Z, I>(...parsers: [Parser<T>, Parser<U>, Parser<V>, Parser<W>, Parser<X>, Parser<Z>, Parser<I>]): Parser<T | U | V | W | X | Z | I>;
+export declare function any<T, U, V, W, X, Z>(...parsers: [Parser<T>, Parser<U>, Parser<V>, Parser<W>, Parser<X>, Parser<Z>]): Parser<T | U | V | W | X | Z>;
+export declare function any<T, U, V, W, X>(...parsers: [Parser<T>, Parser<U>, Parser<V>, Parser<W>, Parser<X>]): Parser<T | U | V | W | X>;
+export declare function any<T, U, V, W>(...parsers: [Parser<T>, Parser<U>, Parser<V>, Parser<W>]): Parser<T | U | V | W>;
+export declare function any<T, U, V>(...parsers: [Parser<T>, Parser<U>, Parser<V>]): Parser<T | U | V>;
+export declare function any<T, U>(...parsers: [Parser<T>, Parser<U>]): Parser<T | U>;
+export declare function any<T>(...parsers: [Parser<T>]): Parser<T>;
+export declare function any<T>(...parsers: Parser<T>[]): Parser<T>;

package/dist/parsers/any.js

@@ -1,29 +1,47 @@
-"use strict";
-Object.defineProperty(exports, "__esModule", { value: true });
-exports.surely = exports.any = void 0;
-const _1 = require(".");
-const types_1 = require("../types");
-function any(...parsers) {
-    return (ctx) => {
-        const expected = [];
-        for (const parser of parsers) {
-            const res = parser(ctx);
-            if ((0, types_1.isFailure)(res)) {
-                if (res.history.includes('surely')) {
-                    console.log('shot');
-                    return (0, types_1.failure)(res.ctx, res.expected, res.history.filter(h => h !== 'surely'));
-                }
-                expected.push(res);
-            }
-            else
-                return res;
-        }
-        const longest = expected.reduce((a, b) => a.history.length > b.history.length ? a : b);
-        return (0, types_1.failure)(longest.ctx, longest.expected, ['any', ...longest.history]);
-    };
-}
-exports.any = any;
-function surely(parser) {
-    return (0, _1.expect)(parser, 'surely');
-}
-exports.surely = surely;
+"use strict";
+Object.defineProperty(exports, "__esModule", { value: true });
+exports.any = any;
+const types_1 = require("../types");
+const anyString_1 = require("./anyString");
+const utilities_1 = require("./utilities");
+const optimizableTypes = ['str', 'stri', 'anyString'];
+function any(...parsers) {
+    let marker = {};
+    if ((0, utilities_1.shouldPerformFusions)() && parsers.every(p => 'parserType' in p && typeof p.parserType === 'string' && optimizableTypes.includes(p.parserType))) {
+        const optimizableParsers = parsers;
+        const matches = optimizableParsers.flatMap(p => {
+            switch (p.parserType) {
+                case 'anyString':
+                    return p.matches;
+                case 'str':
+                    return [[p.match, false]];
+                case 'stri':
+                    return [[p.match, true]];
+            }
+        });
+        // Not fusing if not enough matches
+        // We do pass the matches forward though, because a parser above may want to fuse
+        if (matches.length > 10) {
+            return (0, anyString_1.anyString)(matches);
+        }
+        else {
+            marker = { parserType: 'anyString', matches };
+        }
+    }
+    return Object.assign((ctx) => {
+        const expected = [];
+        for (const parser of parsers) {
+            const res = parser(ctx);
+            if ((0, types_1.isFailure)(res)) {
+                if (res.history.includes('surely')) {
+                    return (0, types_1.failure)(res.ctx, res.expected, res.history.filter(h => h !== 'surely'));
+                }
+                expected.push(res);
+            }
+            else
+                return res;
+        }
+        const longest = expected.reduce((a, b) => a.history.length > b.history.length ? a : b);
+        return (0, types_1.failure)(longest.ctx, longest.expected, ['any', ...longest.history]);
+    }, marker);
+}

package/dist/parsers/anyString.d.ts

@@ -0,0 +1,15 @@
+import { Parser } from "../types";
+import { StrIParser, StrParser } from "./str";
+type AnyStringParser<T> = Parser<T> & {
+    parserType: 'anyString';
+    /**
+     * if flag is true, match case-insensitive
+     */
+    matches: (readonly [string, boolean])[];
+};
+export type OptimizableStrParser<T> = AnyStringParser<T> | StrParser<T> | StrIParser<T>;
+/**
+ * Optimization for `any(str(), str(), ...)` which replaces the parser tree with one parser which tries all strings together
+ */
+export declare function anyString<T extends string>(matches: (readonly [string, boolean])[]): AnyStringParser<T>;
+export {};

package/dist/parsers/anyString.js

@@ -0,0 +1,85 @@
+"use strict";
+Object.defineProperty(exports, "__esModule", { value: true });
+exports.anyString = anyString;
+const types_1 = require("../types");
+/**
+ * Optimization for `any(str(), str(), ...)` which replaces the parser tree with one parser which tries all strings together
+ */
+function anyString(matches) {
+    const lastMatchInQuotes = `'${matches[matches.length - 1][0]}'`;
+    let tree;
+    return Object.assign((ctx) => {
+        tree ??= createSearchTree(matches);
+        const result = searchThroughTree(tree, ctx.text, ctx.index);
+        if (result) {
+            return (0, types_1.success)({ ...ctx, index: result.end }, matches[result.matchIndex][0]);
+        }
+        else {
+            return (0, types_1.failure)(ctx, lastMatchInQuotes, ['any', lastMatchInQuotes]);
+        }
+    }, { parserType: 'anyString', matches });
+}
+function createSearchTree(matches) {
+    const tree = new Map();
+    matches.forEach((match, index) => addMatchToTree(tree, match, index));
+    return tree;
+}
+function addMatchToTree(node, match, idIndex, charIndex = 0) {
+    if (charIndex >= match[0].length) {
+        if (node.matchIndex != undefined) {
+            node.matchIndex = Math.min(node.matchIndex, idIndex);
+        }
+        else {
+            node.matchIndex = idIndex;
+        }
+    }
+    else {
+        const char = match[0][charIndex];
+        const lowercase = char.toLowerCase();
+        const uppercase = char.toUpperCase();
+        const newNode = new Map();
+        if (match[1] && (lowercase !== uppercase)) {
+            const lower = node.get(lowercase) ?? newNode;
+            const upper = node.get(uppercase) ?? newNode;
+            node.set(lowercase, lower);
+            node.set(uppercase, upper);
+            addMatchToTree(lower, match, idIndex, charIndex + 1);
+            if (lower !== upper) {
+                addMatchToTree(upper, match, idIndex, charIndex + 1);
+            }
+        }
+        else {
+            const charNode = node.get(char) ?? newNode;
+            node.set(char, charNode);
+            const lower = node.get(lowercase);
+            if (lower === node.get(uppercase)) {
+                const copy = new Map(lower.entries());
+                copy.matchIndex = lower.matchIndex;
+                node.set(uppercase, copy);
+            }
+            addMatchToTree(charNode, match, idIndex, charIndex + 1);
+        }
+    }
+}
+function searchThroughTree(node, text, start) {
+    let lastSuccessIndex = undefined;
+    let lastSuccessMatchIndex = undefined;
+    let currentNode = node;
+    for (let index = start; index < text.length; index++) {
+        const char = text[index];
+        if (currentNode.matchIndex != undefined && (lastSuccessMatchIndex == undefined || currentNode.matchIndex <= lastSuccessMatchIndex)) {
+            lastSuccessIndex = index;
+            lastSuccessMatchIndex = currentNode.matchIndex;
+        }
+        currentNode = currentNode.get(char);
+        if (!currentNode)
+            break;
+    }
+    if (currentNode && currentNode.matchIndex != undefined && (lastSuccessMatchIndex == undefined || currentNode.matchIndex <= lastSuccessMatchIndex)) {
+        lastSuccessIndex = text.length;
+        lastSuccessMatchIndex = currentNode.matchIndex;
+    }
+    return lastSuccessIndex == undefined
+        ? undefined
+        : { end: lastSuccessIndex, matchIndex: lastSuccessMatchIndex };
+}

package/dist/parsers/between.d.ts

@@ -1,5 +1,5 @@
-import { Parser } from '../types';
-/** Parses a sequence of three parsers.
- * @returns A parser returning only the middle parser's result.
- */
-export declare function between<T, U, V>(left: Parser<U>, parser: Parser<T>, right: Parser<V>): Parser<T>;
+import { Parser } from '../types';
+/** Parses a sequence of three parsers.
+ * @returns A parser returning only the middle parser's result.
+ */
+export declare function between<T, U, V>(left: Parser<U>, parser: Parser<T>, right: Parser<V>): Parser<T>;

package/dist/parsers/between.js

@@ -1,21 +1,20 @@
-"use strict";
-Object.defineProperty(exports, "__esModule", { value: true });
-exports.between = void 0;
-const types_1 = require("../types");
-const seq_1 = require("./seq");
-/** Parses a sequence of three parsers.
- * @returns A parser returning only the middle parser's result.
- */
-function between(left, parser, right) {
-    const sequence = (0, seq_1.seq)(left, parser, right);
-    return (ctx) => {
-        const res = sequence(ctx);
-        if ((0, types_1.isFailure)(res)) {
-            const newHistory = [...res.history];
-            newHistory.splice(0, 1);
-            return (0, types_1.failure)(res.ctx, res.expected, ['between', ...newHistory]);
-        }
-        return { ...res, value: res.value[1] };
-    };
-}
-exports.between = between;
+"use strict";
+Object.defineProperty(exports, "__esModule", { value: true });
+exports.between = between;
+const types_1 = require("../types");
+const seq_1 = require("./seq");
+/** Parses a sequence of three parsers.
+ * @returns A parser returning only the middle parser's result.
+ */
+function between(left, parser, right) {
+    const sequence = (0, seq_1.seq)(left, parser, right);
+    return (ctx) => {
+        const res = sequence(ctx);
+        if ((0, types_1.isFailure)(res)) {
+            const newHistory = [...res.history];
+            newHistory.splice(0, 1);
+            return (0, types_1.failure)(res.ctx, res.expected, ['between', ...newHistory]);
+        }
+        return { ...res, value: res.value[1] };
+    };
+}

package/dist/parsers/exhaust.d.ts

@@ -1,5 +1,5 @@
-import { Parser } from '../types';
-/** Parses using the passed in parser, until the input is exhausted or until the `until` condition is satisfied.
- * @returns A parser returning an array of parsed results.
- */
-export declare function exhaust<T, V>(parser: Parser<T>, until?: Parser<V> | null): Parser<T[]>;
+import { Parser } from '../types';
+/** Parses using the passed in parser, until the input is exhausted or until the `until` condition is satisfied.
+ * @returns A parser returning an array of parsed results.
+ */
+export declare function exhaust<T, V>(parser: Parser<T>, until?: Parser<V> | null): Parser<T[]>;

package/dist/parsers/exhaust.js

@@ -1,27 +1,25 @@
-"use strict";
-Object.defineProperty(exports, "__esModule", { value: true });
-exports.exhaust = void 0;
-const types_1 = require("../types");
-/** Parses using the passed in parser, until the input is exhausted or until the `until` condition is satisfied.
- * @returns A parser returning an array of parsed results.
- */
-function exhaust(parser, until = null) {
-    return (ctx) => {
-        const results = [];
-        // eslint-disable-next-line no-constant-condition
-        while (true) {
-            const res = parser(ctx);
-            if ((0, types_1.isFailure)(res)) {
-                if (until === null || (0, types_1.isFailure)(until(ctx))) {
-                    return (0, types_1.failure)(res.ctx, res.expected, ['exhaust', ...res.history]);
-                }
-                return (0, types_1.success)(ctx, results);
-            }
-            ctx = res.ctx;
-            results.push(res.value);
-            if (res.ctx.index === res.ctx.text.length)
-                return (0, types_1.success)(res.ctx, results);
-        }
-    };
-}
-exports.exhaust = exhaust;
+"use strict";
+Object.defineProperty(exports, "__esModule", { value: true });
+exports.exhaust = exhaust;
+const types_1 = require("../types");
+/** Parses using the passed in parser, until the input is exhausted or until the `until` condition is satisfied.
+ * @returns A parser returning an array of parsed results.
+ */
+function exhaust(parser, until = null) {
+    return (ctx) => {
+        const results = [];
+        while (true) {
+            const res = parser(ctx);
+            if ((0, types_1.isFailure)(res)) {
+                if (until === null || (0, types_1.isFailure)(until(ctx))) {
+                    return (0, types_1.failure)(res.ctx, res.expected, ['exhaust', ...res.history]);
+                }
+                return (0, types_1.success)(ctx, results);
+            }
+            ctx = res.ctx;
+            results.push(res.value);
+            if (res.ctx.index === res.ctx.text.length)
+                return (0, types_1.success)(res.ctx, results);
+        }
+    };
+}

package/dist/parsers/index.d.ts

@@ -1,11 +1,12 @@
-export * from './any';
-export * from './between';
-export * from './exhaust';
-export * from './many';
-export * from './map';
-export * from './opt';
-export * from './regex';
-export * from './seq';
-export * from './str';
-export * from './utilities';
-export * from './values';
+export * from './any';
+export * from './between';
+export * from './exhaust';
+export * from './many';
+export * from './map';
+export * from './opt';
+export * from './regex';
+export * from './seq';
+export { str, stri } from './str';
+export * from './recovery';
+export * from './utilities';
+export * from './values';