Safe Haskell | None |
---|---|
Language | Haskell2010 |
Utilities for handling lexing/tokenization as a separate parsing pass
Synopsis
- data Spanned p a = Spanned {
- spannedSpan :: !(Span p)
- spannedValue :: !a
- newtype LexedStream p a = LexedStream {
- unLexedStream :: Seq (Spanned p a)
- data LexedSpan p
- = LexedSpanNext !(Span p)
- | LexedSpanEnd
- spannedParser :: (PosStream s, Monad m) => ParserT l s e m a -> ParserT l s e m (Spanned (Pos s) a)
- lexedParser :: (PosStream s, Monad m) => ParserT l s e m a -> ParserT l s e m (LexedStream (Pos s) a)
- runParserLexed :: (Typeable l1, Typeable e1, Typeable s, Typeable (Token s), Typeable (Chunk s), Show l1, Show e1, Show s, Show (Token s), Show (Chunk s), Typeable l2, Typeable e2, Typeable (Pos s), Typeable a, Show l2, Show e2, Show (Pos s), Show a, PosStream s, MonadThrow m) => Parser l1 s e1 a -> Parser l2 (LexedStream (Pos s) a) e2 b -> s -> m b
Documentation
A value annotated with a Span
Spanned | |
|
Instances
Functor (Spanned p) Source # | |
Foldable (Spanned p) Source # | |
Defined in SimpleParser.Lexer fold :: Monoid m => Spanned p m -> m # foldMap :: Monoid m => (a -> m) -> Spanned p a -> m # foldMap' :: Monoid m => (a -> m) -> Spanned p a -> m # foldr :: (a -> b -> b) -> b -> Spanned p a -> b # foldr' :: (a -> b -> b) -> b -> Spanned p a -> b # foldl :: (b -> a -> b) -> b -> Spanned p a -> b # foldl' :: (b -> a -> b) -> b -> Spanned p a -> b # foldr1 :: (a -> a -> a) -> Spanned p a -> a # foldl1 :: (a -> a -> a) -> Spanned p a -> a # toList :: Spanned p a -> [a] # length :: Spanned p a -> Int # elem :: Eq a => a -> Spanned p a -> Bool # maximum :: Ord a => Spanned p a -> a # minimum :: Ord a => Spanned p a -> a # | |
Traversable (Spanned p) Source # | |
(Eq p, Eq a) => Eq (Spanned p a) Source # | |
(Show p, Show a) => Show (Spanned p a) Source # | |
newtype LexedStream p a Source #
A materialized sequence of Spanned
values
LexedStream | |
|
Instances
Position in a LexedStream
spannedParser :: (PosStream s, Monad m) => ParserT l s e m a -> ParserT l s e m (Spanned (Pos s) a) Source #
Annotates parse result with a span
lexedParser :: (PosStream s, Monad m) => ParserT l s e m a -> ParserT l s e m (LexedStream (Pos s) a) Source #
Given a parser for a single token, repeatedly apply it and annotate results with spans
runParserLexed :: (Typeable l1, Typeable e1, Typeable s, Typeable (Token s), Typeable (Chunk s), Show l1, Show e1, Show s, Show (Token s), Show (Chunk s), Typeable l2, Typeable e2, Typeable (Pos s), Typeable a, Show l2, Show e2, Show (Pos s), Show a, PosStream s, MonadThrow m) => Parser l1 s e1 a -> Parser l2 (LexedStream (Pos s) a) e2 b -> s -> m b Source #
Similar to runParserEnd
- first lexes the entire stream then runs the second parser over the results