1 interface Lexer_Combinators where
2 import Lexer_State(Lexer_State)
3 and_also :: (Lexer_State -> (b, Lexer_State)) -> (Lexer_State -> (a, Lexer_State)) -> Lexer_State -> (b, Lexer_State)
4 {-# ARITY and_also = 3 #-}
5 and_then :: (Lexer_State -> (a, Lexer_State)) -> (Lexer_State -> (b, Lexer_State)) -> Lexer_State -> (b, Lexer_State)
6 {-# ARITY and_then = 3 #-}
7 and_with :: (Lexer_State -> (a, Lexer_State)) -> (a -> Lexer_State -> (b, Lexer_State)) -> Lexer_State -> (b, Lexer_State)
8 {-# ARITY and_with = 3 #-}
9 return :: a -> Lexer_State -> (a, Lexer_State)
10 {-# ARITY return = 2 #-}