Control.Monad.Tokenizer.Char8.Lazy

A monad for writing pure tokenizers in an imperative-looking way.

Main idea: You walk through the input string like a turtle, and everytime you find a token boundary, you call emit. If some specific kinds of tokens should be suppressed, you can discard them instead (or filter afterwards).

This module supports is specialized for lazy ByteStrings. The module Control.Monad.Tokenizer provides more general types, but does not export a Tokenizable instance for ByteStrings, as its implementation depends on the encoding. This module assumes ASCII encoding (you have been warned!).

Example for a simple tokenizer, that splits words by whitespace and discards stop symbols:

tokenizeWords :: ByteString -> [ByteString]
tokenizeWords = runTokenizer $ untilEOT $ do
  c <- pop
  if isStopSym c
    then discard
    else if c `elem` (" \t\r\n" :: [Char])
         then discard
         else do
           walkWhile (\c -> (c=='_') || not (isSpace c || isPunctuation' c))
           emit

Monad

type Tokenizer = Tokenizer ByteString

Tokenizer monad. Use runTokenizer or runTokenizerCS to run it

runTokenizer :: Tokenizer () -> ByteString -> [ByteString]

Split a string into tokens using the given tokenizer

runTokenizerCS :: Tokenizer () -> ByteString -> [ByteString]

Split a string into tokens using the given tokenizer, case sensitive version

untilEOT :: Tokenizer () -> Tokenizer ()

Repeat a given tokenizer as long as the end of text is not reached

Tests

peek :: Tokenizer Char

Peek the current character

isEOT :: Tokenizer Bool

Have I reached the end of the input text?

lookAhead :: [Char] -> Tokenizer Bool

Check if the next input chars agree with the given string

Movement

walk :: Tokenizer ()

Proceed to the next character

walkBack :: Tokenizer ()

Walk back to the previous character, unless it was discarded/emitted.

pop :: Tokenizer Char

Peek the current character and proceed

walkWhile :: (Char -> Bool) -> Tokenizer ()

Proceed as long as a given function succeeds

walkFold :: a -> (Char -> a -> Maybe a) -> Tokenizer ()

Proceed as long as a given fold returns Just (generalization of walkWhile)

Transactions

emit :: Tokenizer ()

Break at the current position and emit the scanned token

discard :: Tokenizer ()

Break at the current position and discard the scanned token

restore :: Tokenizer ()

Restore the state after the last emit/discard.

Orphan instances

Tokenizable ByteString

Assuming ASCII encoding

Methods

tnull :: ByteString -> Bool

thead :: ByteString -> Char

ttail :: ByteString -> ByteString

ttake :: Int -> ByteString -> ByteString

tdrop :: Int -> ByteString -> ByteString

tlower :: ByteString -> ByteString