@@ -20,6 +20,9 @@ module Parsing
20
20
, fail
21
21
, failWithPosition
22
22
, region
23
+ , liftMaybe
24
+ , liftEither
25
+ , liftExceptT
23
26
, ParseState (..)
24
27
, stateParserT
25
28
, getParserT
@@ -33,6 +36,7 @@ import Control.Alt (class Alt)
33
36
import Control.Apply (lift2 )
34
37
import Control.Lazy (class Lazy )
35
38
import Control.Monad.Error.Class (class MonadError , class MonadThrow , catchError , throwError )
39
+ import Control.Monad.Except (ExceptT , runExceptT )
36
40
import Control.Monad.Reader.Class (class MonadAsk , class MonadReader , ask , local )
37
41
import Control.Monad.Rec.Class (class MonadRec , Step (..), tailRecM )
38
42
import Control.Monad.State.Class (class MonadState , state )
@@ -43,6 +47,7 @@ import Data.Function.Uncurried (Fn2, Fn5, mkFn2, mkFn3, mkFn5, runFn2, runFn3, r
43
47
import Data.Generic.Rep (class Generic )
44
48
import Data.Identity (Identity )
45
49
import Data.Lazy as Lazy
50
+ import Data.Maybe (Maybe (..))
46
51
import Data.Newtype (unwrap )
47
52
import Data.Show.Generic (genericShow )
48
53
import Data.Tuple (Tuple (..), fst )
@@ -467,4 +472,58 @@ instance Ord Position where
467
472
-- |
468
473
-- | `{ index: 0, line: 1, column: 1 }`
469
474
initialPos :: Position
470
- initialPos = Position { index: 0 , line: 1 , column: 1 }
475
+ initialPos = Position { index: 0 , line: 1 , column: 1 }
476
+
477
+ -- | Lift a `Maybe a` computation into a `ParserT`, with a note for
478
+ -- | the `ParseError` message in case of `Nothing`.
479
+ -- |
480
+ -- | Consumes no parsing input, does not change the parser state at all.
481
+ -- | If the `Maybe` computation is `Nothing`, then this will `fail` in the
482
+ -- | `ParserT` monad with the given error message `String` at the current input
483
+ -- | `Position`.
484
+ -- |
485
+ -- | This is a “validation” function, for when we want to produce some
486
+ -- | data from the parsing input or fail at the current
487
+ -- | parsing position if that’s impossible.
488
+ -- |
489
+ -- | For example:
490
+ -- |
491
+ -- | ```
492
+ -- | runParser "3" do
493
+ -- | myenum :: MyEnum <- tryRethrow do
494
+ -- | x <- intDecimal
495
+ -- | liftMaybe (defer $ "Bad MyEnum " <> show x) $ toEnum x
496
+ -- | pure myenum
497
+ -- | ```
498
+ liftMaybe :: forall s m a . Monad m => (Unit -> String ) -> Maybe a -> ParserT s m a
499
+ liftMaybe message f = case f of
500
+ Nothing -> fail (message unit)
501
+ Just x -> pure x
502
+
503
+ -- | Lift an `Either String a` computation into a `ParserT`.
504
+ -- |
505
+ -- | Consumes no parsing input, does not change the parser state at all.
506
+ -- | If the `Either` computation is `Left String`, then this will `fail` in the
507
+ -- | `ParserT` monad at the current input `Position`.
508
+ -- |
509
+ -- | This is a “validation” function, for when we want to produce some
510
+ -- | data from the parsing input or fail at the current
511
+ -- | parsing position if that’s impossible.
512
+ liftEither :: forall s m a . Monad m => Either String a -> ParserT s m a
513
+ liftEither f = case f of
514
+ Left err -> fail err
515
+ Right x -> pure x
516
+
517
+ -- | Lift an `ExceptT String m a` computation into a `ParserT`.
518
+ -- |
519
+ -- | Consumes no parsing input, does not change the parser state at all.
520
+ -- | If the `ExceptT` computation is `Left String`, then this will `fail` in the
521
+ -- | `ParserT` monad at the current input `Position`.
522
+ -- |
523
+ -- | This is a “validation” function, for when we want to produce some
524
+ -- | data from the parsing input or fail at the current
525
+ -- | parsing position if that’s impossible.
526
+ liftExceptT :: forall s m a . (Monad m ) => ExceptT String m a -> ParserT s m a
527
+ liftExceptT f = lift (runExceptT f) >>= case _ of
528
+ Left err -> fail err
529
+ Right x -> pure x
0 commit comments