48 lines
1.2 KiB
Haskell
48 lines
1.2 KiB
Haskell
{-# LANGUAGE LambdaCase #-}
|
|
{-# LANGUAGE OverloadedStrings #-}
|
|
|
|
module Auxiliary (module Auxiliary) where
|
|
|
|
import Control.Monad.Error.Class (liftEither)
|
|
import Control.Monad.Except (MonadError)
|
|
import Data.Either.Combinators (maybeToRight)
|
|
import Data.List (foldl')
|
|
import Grammar.Abs
|
|
import Prelude hiding ((>>), (>>=))
|
|
|
|
(>>) a b = a ++ " " ++ b
|
|
(>>=) a f = f a
|
|
|
|
snoc :: a -> [a] -> [a]
|
|
snoc x xs = xs ++ [x]
|
|
|
|
maybeToRightM :: MonadError l m => l -> Maybe r -> m r
|
|
maybeToRightM err = liftEither . maybeToRight err
|
|
|
|
mapAccumM :: Monad m => (s -> a -> m (s, b)) -> s -> [a] -> m (s, [b])
|
|
mapAccumM f = go
|
|
where
|
|
go acc = \case
|
|
[] -> pure (acc, [])
|
|
x : xs -> do
|
|
(acc', x') <- f acc x
|
|
(acc'', xs') <- go acc' xs
|
|
pure (acc'', x' : xs')
|
|
|
|
unzip4 :: [(a, b, c, d)] -> ([a], [b], [c], [d])
|
|
unzip4 =
|
|
foldl'
|
|
( \(as, bs, cs, ds) (a, b, c, d) ->
|
|
(as ++ [a], bs ++ [b], cs ++ [c], ds ++ [d])
|
|
)
|
|
([], [], [], [])
|
|
|
|
litType :: Lit -> Type
|
|
litType (LInt _) = int
|
|
litType (LChar _) = char
|
|
|
|
int = TLit "Int"
|
|
char = TLit "Char"
|
|
|
|
tupSequence :: Monad m => (m a, b) -> m (a, b)
|
|
tupSequence (ma, b) = (,b) <$> ma
|