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/sequence.cr | 33 +++++++++++++++++++++++++++++++++
 1 file changed, 33 insertions(+)
 create mode 100644 src/__OLD_parcom/sequence.cr

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

diff --git a/src/__OLD_parcom/sequence.cr b/src/__OLD_parcom/sequence.cr
new file mode 100644
index 0000000..6a05cde
--- /dev/null
+++ b/src/__OLD_parcom/sequence.cr
@@ -0,0 +1,33 @@
+require "./parser.cr"
+
+module Parcom
+  # `Sequence` is a `Parser` that combines multiple parsers and
+  # tries to parse all of them in succession. If all of the parsers
+  # succeed, the values parsed are returned in an array, in the order
+  # they were parsed in. If any of the parsers fail,
+  # the `Sequence` also fails.
+  class Sequence(T, V) < Parser(T, Array(V))
+    # Accepts the parsers to use.
+    def initialize(@ps : Iterable(Parser(T, V)))
+    end
+
+    # Tries each parser in order, and returns their results.
+    # Fail if any of the wrapped parsers fail.
+    # TODO: this can probably be optimised more for Arrays
+    # TODO: might be better to use #zip
+    def parse(tokens : Tokens(T)) : Result(T, Array(V))
+      parsed = [] of V
+
+      @ps.each do |p|
+        r = p.parse(tokens)
+        parsed << r.value
+        tokens = r.tokens
+      end
+
+      Result.new(tokens, parsed)
+    rescue ex : ParserFail
+      raise ParserFail.new("Sequence: #{ex.message}")
+    end
+  end
+end
+
-- 
cgit v1.2.1