tarsec 0.1.0 → 0.1.1

package/dist/combinators.d.ts

@@ -142,12 +142,22 @@ export declare function between<O, C, P>(open: Parser<O>, close: Parser<C>, pars
 export declare function between1<O, C, P>(open: Parser<O>, close: Parser<C>, parser: Parser<P>): Parser<P[]>;
 /**
  * Parses many instances of the parser separated by separator.
- * The parser needs to succeed at least once, otherwise sepBy fails.
+ * The parser will succeed even if it consumes zero instances.
+ * To require at least one instance, use `sepBy1`.
  * @param separator
  * @param parser
  * @returns a parser that runs the given parser zero to many times, separated by the separator parser.
  */
 export declare function sepBy<S, P>(separator: Parser<S>, parser: Parser<P>): Parser<P[]>;
+/**
+ * Parses many instances of the parser separated by separator.
+ * The parser needs to succeed at least once, otherwise sepBy fails.
+ * To not require at least one instance, use `sepBy`.
+ * @param separator
+ * @param parser
+ * @returns a parser that runs the given parser one to many times, separated by the separator parser.
+ */
+export declare function sepBy1<S, P>(separator: Parser<S>, parser: Parser<P>): Parser<P[]>;
 /**
  * Convenience function to use as the second argument to `seq` to get all the results from `seq`
  * @param results

package/dist/combinators.js

@@ -300,7 +300,8 @@ export function between1(open, close, parser) {
 }
 /**
  * Parses many instances of the parser separated by separator.
- * The parser needs to succeed at least once, otherwise sepBy fails.
+ * The parser will succeed even if it consumes zero instances.
+ * To require at least one instance, use `sepBy1`.
  * @param separator
  * @param parser
  * @returns a parser that runs the given parser zero to many times, separated by the separator parser.
@@ -312,28 +313,37 @@ export function sepBy(separator, parser) {
         while (true) {
             const result = parser(rest);
             if (!result.success) {
-                if (results.length === 0) {
-                    return failure(result.message, input);
-                }
-                else {
-                    return success(results, rest);
-                }
+                return success(results, rest);
             }
             results.push(result.result);
             rest = result.rest;
             const sepResult = separator(rest);
             if (!sepResult.success) {
-                if (results.length === 0) {
-                    return failure(sepResult.message, input);
-                }
-                else {
-                    return success(results, rest);
-                }
+                return success(results, rest);
             }
             rest = sepResult.rest;
         }
     };
 }
+/**
+ * Parses many instances of the parser separated by separator.
+ * The parser needs to succeed at least once, otherwise sepBy fails.
+ * To not require at least one instance, use `sepBy`.
+ * @param separator
+ * @param parser
+ * @returns a parser that runs the given parser one to many times, separated by the separator parser.
+ */
+export function sepBy1(separator, parser) {
+    return (input) => {
+        const result = sepBy(separator, parser)(input);
+        if (result.success) {
+            if (result.result.length === 0) {
+                return failure("expected at least one match", input);
+            }
+        }
+        return result;
+    };
+}
 /**
  * Convenience function to use as the second argument to `seq` to get all the results from `seq`
  * @param results

package/package.json

@@ -1,6 +1,6 @@
 {
   "name": "tarsec",
-  "version": "0.1.0",
+  "version": "0.1.1",
   "description": "A parser combinator library for TypeScript, inspired by Parsec.",
   "homepage": "https://github.com/egonSchiele/tarsec",
   "scripts": {