From b274828831fec26cd8b3089ffef14cb96ce2de2f Mon Sep 17 00:00:00 2001
From: Matthew Hall <hallmatthew314@gmail.com>
Date: Thu, 16 Mar 2023 20:36:03 +1300
Subject: Second rewrite attempt, this one should work, monkaS

---
 src/__OLD_parcom/at_most.cr | 29 +++++++++++++++++++++++++++++
 1 file changed, 29 insertions(+)
 create mode 100644 src/__OLD_parcom/at_most.cr

(limited to 'src/__OLD_parcom/at_most.cr')

diff --git a/src/__OLD_parcom/at_most.cr b/src/__OLD_parcom/at_most.cr
new file mode 100644
index 0000000..b70164f
--- /dev/null
+++ b/src/__OLD_parcom/at_most.cr
@@ -0,0 +1,29 @@
+require "./parser.cr"
+require "./map.cr"
+require "./exactly.cr"
+require "./optional.cr"
+
+module Parcom
+  # `AtMost` is a `Parser` that tries to parse with another parser a specific
+  # number of times. The results of each successful parse are returned in an
+  # array. If the specific number of parses succeed, the parsing stops, even
+  # if it is possible to keep parsing. If the parser is never successful, it
+  # succeeds with an empty array.
+  class AtMost(T, V) < Parser(T, Array(V))
+    @p : Map(T, Array(V?), Array(V))
+
+    # Accepts the number of parsing attempts, and the parser to use.
+    def initialize(i : Int, p : Parser(T, V))
+      @p = Exactly.new(i, Optional.new(p)).map(&.compact)
+    end
+
+    # Tries to parse up to the given number of times.
+    # If the parser never succeeds, returns an empty array.
+    def parse(tokens : Tokens(T)) : Result(T, Array(V))
+      @p.parse(tokens)
+    rescue ex : ParserFail
+      raise ParserFail.new("AtMost: #{ex.message}")
+    end
+  end
+end
+
-- 
cgit v1.2.1