aboutsummaryrefslogtreecommitdiff
path: root/src/__OLD_parcom/right.cr
diff options
context:
space:
mode:
authorMatthew Hall <hallmatthew314@gmail.com>2023-03-19 23:02:29 +1300
committerMatthew Hall <hallmatthew314@gmail.com>2023-03-19 23:02:29 +1300
commit9734fa2d530b9496b70a388a117ea57fe5730772 (patch)
tree78a42db1e64e5148edfa96cb2a451a17ef362485 /src/__OLD_parcom/right.cr
parent2ef8841e9c7a48eea0f66cfe09d8fe996f43c2b2 (diff)
Remove old files
Diffstat (limited to 'src/__OLD_parcom/right.cr')
-rw-r--r--src/__OLD_parcom/right.cr26
1 files changed, 0 insertions, 26 deletions
diff --git a/src/__OLD_parcom/right.cr b/src/__OLD_parcom/right.cr
deleted file mode 100644
index a0489b1..0000000
--- a/src/__OLD_parcom/right.cr
+++ /dev/null
@@ -1,26 +0,0 @@
-require "./parser.cr"
-require "./map.cr"
-
-module Parcom
- # `Right` is a `Parser` that tries to parse with two different
- # parsers in succession and fails if either of the two parsers fails.
- # This parser behaves the same as `Plus`, but only returns the result
- # of the second parser.
- class Right(T, V, U) < Parser(T, U)
- @p : Map(T, {V, U}, U)
-
- # Accepts the two parsers to use, in order.
- def initialize(p1 : Parser(T, V), p2 : Parser(T, U))
- @p = (p1 + p2).map(&.last)
- end
-
- # Tries to parse with the two given parsers, and returns the
- # result of the second parser if they both succeed.
- def parse(tokens : Tokens(T)) : Result(T, U)
- @p.parse(tokens)
- rescue ex : ParserFail
- raise ParserFail.new("Left: #{ex.message}")
- end
- end
-end
-