Safe Haskell	Safe-Inferred
Language	Haskell2010

Unison.Syntax.Lexer

Contents

Character classifiers
other utils

Description

This currently contains a mix of general lexing utilities and identifier-y lexers.

Synopsis

data Token a = Token {
- payload :: a
- start :: !Pos
- end :: !Pos
}
type Line = Int
type Column = Int
data Pos = Pos {
- line :: !Line
- column :: !Column
}
touches :: Token a -> Token b -> Bool
wordyIdChar :: Char -> Bool
wordyIdStartChar :: Char -> Bool
symbolyIdChar :: Char -> Bool
local :: (MonadParsec e s' m, MonadState s m) => (s -> s) -> m a -> m a
space :: MonadParsec e String m => m ()
lit :: MonadParsec e String m => String -> m String
commitAfter2 :: MonadParsec e s m => m a -> m b -> (a -> b -> m c) -> m c
(<+>) :: (Applicative f, Monoid a) => f a -> f a -> f a
some' :: MonadParsec e s m => m a -> m (NonEmpty a)
someTill' :: MonadParsec e s m => m a -> m end -> m (NonEmpty a)
sepBy1' :: MonadParsec e s m => m a -> m sep -> m (NonEmpty a)
separated :: MonadParsec e s m => (Token s -> Bool) -> m a -> m a
wordySep :: Char -> Bool
pop :: [a] -> [a]
typeOrAbilityAlt :: Alternative f => (Text -> f a) -> f a
inc :: Pos -> Pos

Documentation

data Token a Source #

Constructors

Token
Fields payload :: a start :: !Pos end :: !Pos

Instances

Instances details

Foldable Token Source #
Instance details Defined in Unison.Syntax.Lexer.Token Methods fold :: Monoid m => Token m -> m # foldMap :: Monoid m => (a -> m) -> Token a -> m # foldMap' :: Monoid m => (a -> m) -> Token a -> m # foldr :: (a -> b -> b) -> b -> Token a -> b # foldr' :: (a -> b -> b) -> b -> Token a -> b # foldl :: (b -> a -> b) -> b -> Token a -> b # foldl' :: (b -> a -> b) -> b -> Token a -> b # foldr1 :: (a -> a -> a) -> Token a -> a # foldl1 :: (a -> a -> a) -> Token a -> a # toList :: Token a -> [a] # null :: Token a -> Bool # length :: Token a -> Int # elem :: Eq a => a -> Token a -> Bool # maximum :: Ord a => Token a -> a # minimum :: Ord a => Token a -> a # sum :: Num a => Token a -> a # product :: Num a => Token a -> a #
Traversable Token Source #
Instance details Defined in Unison.Syntax.Lexer.Token Methods traverse :: Applicative f => (a -> f b) -> Token a -> f (Token b) # sequenceA :: Applicative f => Token (f a) -> f (Token a) # mapM :: Monad m => (a -> m b) -> Token a -> m (Token b) # sequence :: Monad m => Token (m a) -> m (Token a) #
Applicative Token Source #
Instance details Defined in Unison.Syntax.Lexer.Token Methods pure :: a -> Token a # (<>) :: Token (a -> b) -> Token a -> Token b # liftA2 :: (a -> b -> c) -> Token a -> Token b -> Token c # (>) :: Token a -> Token b -> Token b # (<*) :: Token a -> Token b -> Token a #
Functor Token Source #
Instance details Defined in Unison.Syntax.Lexer.Token Methods fmap :: (a -> b) -> Token a -> Token b # (<$) :: a -> Token b -> Token a #
Show a => Show (Token a) Source #
Instance details Defined in Unison.Syntax.Lexer.Token Methods showsPrec :: Int -> Token a -> ShowS # show :: Token a -> String # showList :: [Token a] -> ShowS #
Eq a => Eq (Token a) Source #
Instance details Defined in Unison.Syntax.Lexer.Token Methods (==) :: Token a -> Token a -> Bool # (/=) :: Token a -> Token a -> Bool #
Ord a => Ord (Token a) Source #
Instance details Defined in Unison.Syntax.Lexer.Token Methods compare :: Token a -> Token a -> Ordering # (<) :: Token a -> Token a -> Bool # (<=) :: Token a -> Token a -> Bool # (>) :: Token a -> Token a -> Bool # (>=) :: Token a -> Token a -> Bool # max :: Token a -> Token a -> Token a # min :: Token a -> Token a -> Token a #
ShowErrorComponent (Token Text) Source #
Instance details Defined in Unison.Syntax.Lexer.Token Methods showErrorComponent :: Token Text -> String # errorComponentLen :: Token Text -> Int #
ShowErrorComponent (Token Err) Source #
Instance details Defined in Unison.Syntax.Lexer.Unison Methods showErrorComponent :: Token Err -> String # errorComponentLen :: Token Err -> Int #
VisualStream [Token Lexeme] Source #
Instance details Defined in Unison.Syntax.Lexer.Unison Methods showTokens :: Proxy [Token Lexeme] -> NonEmpty (Token0 [Token Lexeme]) -> String # tokensLength :: Proxy [Token Lexeme] -> NonEmpty (Token0 [Token Lexeme]) -> Int #
Annotated (Token a) Source #
Instance details Defined in Unison.Syntax.Lexer.Token Methods ann :: Token a -> Ann Source #

type Line = Int Source #

type Column = Int Source #

data Pos Source #

Constructors

Pos
Fields line :: !Line column :: !Column

Instances

Instances details

Monoid Pos Source #
Instance details Defined in Unison.Lexer.Pos Methods mempty :: Pos # mappend :: Pos -> Pos -> Pos # mconcat :: [Pos] -> Pos #
Semigroup Pos Source #
Instance details Defined in Unison.Lexer.Pos Methods (<>) :: Pos -> Pos -> Pos # sconcat :: NonEmpty Pos -> Pos # stimes :: Integral b => b -> Pos -> Pos #
Show Pos Source #
Instance details Defined in Unison.Lexer.Pos Methods showsPrec :: Int -> Pos -> ShowS # show :: Pos -> String # showList :: [Pos] -> ShowS #
Eq Pos Source #
Instance details Defined in Unison.Lexer.Pos Methods (==) :: Pos -> Pos -> Bool # (/=) :: Pos -> Pos -> Bool #
Ord Pos Source #
Instance details Defined in Unison.Lexer.Pos Methods compare :: Pos -> Pos -> Ordering # (<) :: Pos -> Pos -> Bool # (<=) :: Pos -> Pos -> Bool # (>) :: Pos -> Pos -> Bool # (>=) :: Pos -> Pos -> Bool # max :: Pos -> Pos -> Pos # min :: Pos -> Pos -> Pos #