dotparse-0.0.1: dot language parsing and printing.
Safe HaskellNone
LanguageHaskell2010

DotParse

Description

Parser & Printer for the dot language of graphviz

See DotParse.Examples for usage.

Synopsis

Documentation

anyInt64be :: Parser e Int64 #

Parse any Int64 (big-endian).

anyInt64le :: Parser e Int64 #

Parse any Int64 (little-endian).

anyInt32be :: Parser e Int32 #

Parse any Int32 (big-endian).

anyInt32le :: Parser e Int32 #

Parse any Int32 (little-endian).

anyInt16be :: Parser e Int16 #

Parse any Int16 (big-endian).

anyInt16le :: Parser e Int16 #

Parse any Int16 (little-endian).

anyWord64be :: Parser e Word64 #

Parse any Word64 (big-endian).

anyWord64le :: Parser e Word64 #

Parse any Word64 (little-endian).

anyWord32be :: Parser e Word32 #

Parse any Word32 (big-endian).

anyWord32le :: Parser e Word32 #

Parse any Word32 (little-endian).

anyWord16be :: Parser e Word16 #

Parse any Word16 (big-endian).

anyWord16le :: Parser e Word16 #

Parse any Word16 (little-endian).

anyInt :: Parser e Int #

Parse any Int.

anyInt64 :: Parser e Int64 #

Parse any Int64.

anyInt32 :: Parser e Int32 #

Parse any Int32.

anyInt16 :: Parser e Int16 #

Parse any Int16.

anyInt8 :: Parser e Int8 #

Parse any Int8.

anyWord_ :: Parser e () #

Skip any Word.

anyWord :: Parser e Word #

Parse any Word.

anyWord64_ :: Parser e () #

Skip any Word64.

anyWord64 :: Parser e Word64 #

Parse any Word64.

anyWord32_ :: Parser e () #

Skip any Word32.

anyWord32 :: Parser e Word32 #

Parse any Word32.

anyWord16_ :: Parser e () #

Skip any Word16.

anyWord16 :: Parser e Word16 #

Parse any Word16.

anyWord8_ :: Parser e () #

Skip any Word8 (byte).

anyWord8 :: Parser e Word8 #

Parse any Word8 (byte).

scanBytes# :: [Word] -> Q Exp #

Template function, creates a Parser e () which unsafely scans a given sequence of bytes.

setBack# :: Int -> Parser e () #

Decrease the current input position by the given number of bytes.

scanAny8# :: Parser e Word8 #

Unsafely read and return a byte from the input. It's not checked that the input is non-empty.

scan64# :: Word -> Parser e () #

Unsafely read eight concrete bytes from the input. It's not checked that the input has enough bytes.

scan32# :: Word32 -> Parser e () #

Unsafely read four concrete bytes from the input. It's not checked that the input has enough bytes.

scan16# :: Word16 -> Parser e () #

Unsafely read two concrete bytes from the input. It's not checked that the input has enough bytes.

scan8# :: Word8 -> Parser e () #

Unsafely read a concrete byte from the input. It's not checked that the input has enough bytes.

ensureBytes# :: Int -> Parser e () #

Check that the input has at least the given number of bytes.

unpackUTF8 :: ByteString -> String #

Convert an UTF-8-coded ByteString to a String.

traceRest :: Parser e String #

Get the rest of the input as a String, but restore the parsing state. Assumes UTF-8 encoding. This can be used for debugging.

takeRest :: Parser e String #

Take the rest of the input as a String. Assumes UTF-8 encoding.

traceLine :: Parser e String #

Parse the rest of the current line as a String, but restore the parsing state. Assumes UTF-8 encoding. This can be used for debugging.

takeLine :: Parser e String #

Parse the rest of the current line as a String. Assumes UTF-8 encoding, throws an error if the encoding is invalid.

mkPos :: ByteString -> (Int, Int) -> Pos #

Create a Pos from a line and column number. Throws an error on out-of-bounds line and column numbers.

unsafeSpanToByteString :: Span -> Parser e ByteString #

Create a ByteString from a Span. The result is invalid if the Span points outside the current buffer, or if the Span start is greater than the end position.

posLineCols :: ByteString -> [Pos] -> [(Int, Int)] #

Compute corresponding line and column numbers for each Pos in a list. Throw an error on invalid positions. Note: computing lines and columns may traverse the ByteString, but it traverses it only once regardless of the length of the position list.

validPos :: ByteString -> Pos -> Bool #

Check whether a Pos points into a ByteString.

inSpan :: Span -> Parser e a -> Parser e a #

Run a parser in a given input span. The input position and the Int state is restored after the parser is finished, so inSpan does not consume input and has no side effect. Warning: this operation may crash if the given span points outside the current parsing buffer. It's always safe to use inSpan if the span comes from a previous spanned or spanOf call on the current input.

byteStringed :: Parser e a -> (a -> ByteString -> Parser e b) -> Parser e b #

CPS'd version of byteStringOf. Can be more efficient, because the result is more eagerly unboxed by GHC. It's more efficient to use spanOf or spanned instead.

byteStringOf :: Parser e a -> Parser e ByteString #

Return the ByteString consumed by a parser. Note: it's more efficient to use spanOf and spanned instead.

spanned :: Parser e a -> (a -> Span -> Parser e b) -> Parser e b #

Bind the result together with the span of the result. CPS'd version of spanOf for better unboxing.

spanOf :: Parser e a -> Parser e Span #

Return the consumed span of a parser.

endPos :: Pos #

The end of the input.

setPos :: Pos -> Parser e () #

Set the input position. Warning: this can result in crashes if the position points outside the current buffer. It is always safe to setPos values which came from getPos with the current input.

getPos :: Parser e Pos #

Get the current position in the input.

notFollowedBy :: Parser e a -> Parser e b -> Parser e a #

Succeed if the first parser succeeds and the second one fails.

some_ :: Parser e a -> Parser e () #

Skip a parser one or more times.

some :: Parser e a -> Parser e [a] #

Run a parser one or more times, collect the results in a list. Note: for optimal performance, try to avoid this. Often it is possible to get rid of the intermediate list by using a combinator or a custom parser.

many_ :: Parser e a -> Parser e () #

Skip a parser zero or more times.

many :: Parser e a -> Parser e [a] #

Run a parser zero or more times, collect the results in a list. Note: for optimal performance, try to avoid this. Often it is possible to get rid of the intermediate list by using a combinator or a custom parser.

chainr :: (a -> b -> b) -> Parser e a -> Parser e b -> Parser e b #

An analogue of the list foldr function: parse zero or more a-s, terminated by a b, and combine the results in a right-nested way using the a -> b -> b function. Note: this is not the usual chainr function from the parsec libraries!

chainl :: (b -> a -> b) -> Parser e b -> Parser e a -> Parser e b #

An analogue of the list foldl function: first parse a b, then parse zero or more a-s, and combine the results in a left-nested way by the b -> a -> b function. Note: this is not the usual chainl function from the parsec libraries!

branch :: Parser e a -> Parser e b -> Parser e b -> Parser e b #

Branch on a parser: if the first argument succeeds, continue with the second, else with the third. This can produce slightly more efficient code than (<|>). Moreover, ḃranch does not backtrack from the true/false cases.

(<|>) :: Parser e a -> Parser e a -> Parser e a infixr 6 #

Choose between two parsers. If the first parser fails, try the second one, but if the first one throws an error, propagate the error.

readInteger :: Parser e Integer #

Read an Integer from the input, as a non-empty digit sequence.

readInt :: Parser e Int #

Read an Int from the input, as a non-empty digit sequence. The Int may overflow in the result.

anyCharASCII_ :: Parser e () #

Skip any Char in the ASCII range. More efficient than anyChar_ if we're working only with ASCII.

anyCharASCII :: Parser e Char #

Parse any Char in the ASCII range, fail if the next input character is not in the range. This is more efficient than anyChar if we are only working with ASCII.

anyChar_ :: Parser e () #

Skip any UTF-8-encoded Char.

anyChar :: Parser e Char #

Parse any UTF-8-encoded Char.

fusedSatisfy_ :: (Char -> Bool) -> (Char -> Bool) -> (Char -> Bool) -> (Char -> Bool) -> Parser e () #

Skipping variant of fusedSatisfy.

fusedSatisfy :: (Char -> Bool) -> (Char -> Bool) -> (Char -> Bool) -> (Char -> Bool) -> Parser e Char #

This is a variant of satisfy which allows more optimization. We can pick four testing functions for the four cases for the possible number of bytes in the UTF-8 character. So in fusedSatisfy f1 f2 f3 f4, if we read a one-byte character, the result is scrutinized with f1, for two-bytes, with f2, and so on. This can result in dramatic lexing speedups.

For example, if we want to accept any letter, the naive solution would be to use isLetter, but this accesses a large lookup table of Unicode character classes. We can do better with fusedSatisfy isLatinLetter isLetter isLetter isLetter, since here the isLatinLetter is inlined into the UTF-8 decoding, and it probably handles a great majority of all cases without accessing the character table.

satisfyASCII_ :: (Char -> Bool) -> Parser e () #

Skip an ASCII Char for which a predicate holds. Assumption: the predicate must only return True for ASCII-range characters.

satisfyASCII :: (Char -> Bool) -> Parser e Char #

Parse an ASCII Char for which a predicate holds. Assumption: the predicate must only return True for ASCII-range characters. Otherwise this function might read a 128-255 range byte, thereby breaking UTF-8 decoding.

satisfy_ :: (Char -> Bool) -> Parser e () #

Skip a UTF-8 Char for which a predicate holds.

satisfy :: (Char -> Bool) -> Parser e Char #

Parse a UTF-8 Char for which a predicate holds.

rawSwitchWithPost :: Maybe (Q Exp) -> [(String, Q Exp)] -> Maybe (Q Exp) -> Q Exp #

Version of switchWithPost without syntactic sugar. The second argument is the list of cases, the third is the default case.

switchWithPost :: Maybe (Q Exp) -> Q Exp -> Q Exp #

Switch expression with an optional first argument for performing a post-processing action after every successful branch matching. For example, if we have ws :: Parser e () for a whitespace parser, we might want to consume whitespace after matching on any of the switch cases. For that case, we can define a "lexeme" version of switch as follows.

  switch' :: Q Exp -> Q Exp
  switch' = switchWithPost (Just [| ws |])

Note that this switch' function cannot be used in the same module it's defined in, because of the stage restriction of Template Haskell.

switch :: Q Exp -> Q Exp #

This is a template function which makes it possible to branch on a collection of string literals in an efficient way. By using switch, such branching is compiled to a trie of primitive parsing operations, which has optimized control flow, vectorized reads and grouped checking for needed input bytes.

The syntax is slightly magical, it overloads the usual case expression. An example:

    $(switch [| case _ of
        "foo" -> pure True
        "bar" -> pure False |])

The underscore is mandatory in case _ of. Each branch must be a string literal, but optionally we may have a default case, like in

    $(switch [| case _ of
        "foo" -> pure 10
        "bar" -> pure 20
        _     -> pure 30 |])

All case right hand sides must be parsers with the same type. That type is also the type of the whole switch expression.

A switch has longest match semantics, and the order of cases does not matter, except for the default case, which may only appear as the last case.

If a switch does not have a default case, and no case matches the input, then it returns with failure, without having consumed any input. A fallthrough to the default case also does not consume any input.

string :: String -> Q Exp #

Parse a UTF-8 string literal. This is a template function, you can use it as $(string "foo"), for example, and the splice has type Parser e ().

bytes :: [Word] -> Q Exp #

Read a sequence of bytes. This is a template function, you can use it as $(bytes [3, 4, 5]), for example, and the splice has type Parser e ().

byte :: Word8 -> Parser e () #

Read a Word8.

char :: Char -> Q Exp #

Parse a UTF-8 character literal. This is a template function, you can use it as $(char 'x'), for example, and the splice in this case has type Parser e ().

eof :: Parser e () #

Succeed if the input is empty.

cutting :: Parser e a -> e -> (e -> e -> e) -> Parser e a #

Run the parser, if we get a failure, throw the given error, but if we get an error, merge the inner and the newly given errors using the e -> e -> e function. This can be useful for implementing parsing errors which may propagate hints or accummulate contextual information.

optioned :: Parser e a -> (a -> Parser e b) -> Parser e b -> Parser e b #

CPS'd version of optional. This is usually more efficient, since it gets rid of the extra Maybe allocation.

optional_ :: Parser e a -> Parser e () #

Convert a parsing failure to a ().

optional :: Parser e a -> Parser e (Maybe a) #

Convert a parsing failure to a Maybe. If possible, use optioned instead.

try :: Parser e a -> Parser e a #

Convert a parsing error into failure.

fails :: Parser e a -> Parser e () #

Convert a parsing failure to a success.

lookahead :: Parser e a -> Parser e a #

Save the parsing state, then run a parser, then restore the state.

err :: e -> Parser e a #

Throw a parsing error. By default, parser choice (<|>) can't backtrack on parser error. Use try to convert an error to a recoverable failure.

empty :: Parser e a #

The failing parser. By default, parser choice (<|>) arbitrarily backtracks on parser failure.

runParserS :: Parser e a -> String -> Result e a #

Run a parser on a String input. Reminder: OverloadedStrings for ByteString does not yield a valid UTF-8 encoding! For non-ASCII ByteString literal input, use runParserS or packUTF8 for testing.

runParser :: Parser e a -> ByteString -> Result e a #

Run a parser.

pattern OK# :: a -> Addr# -> Res# e a #

Contains return value and a pointer to the rest of the input buffer.

pattern Err# :: e -> Res# e a #

Constructor for errors which are by default non-recoverable.

pattern Fail# :: Res# e a #

Constructor for recoverable failure.

type Res# e a = (# (# a, Addr# #) | (# #) | (# e #) #) #

Primitive result of a parser. Possible results are given by OK#, Err# and Fail# pattern synonyms.

newtype Parser e a #

Parser e a has an error type e and a return type a.

Constructors

Parser 

Fields

Instances

Instances details
Monad (Parser e) 
Instance details

Defined in FlatParse.Basic

Methods

(>>=) :: Parser e a -> (a -> Parser e b) -> Parser e b #

(>>) :: Parser e a -> Parser e b -> Parser e b #

return :: a -> Parser e a #

Functor (Parser e) 
Instance details

Defined in FlatParse.Basic

Methods

fmap :: (a -> b) -> Parser e a -> Parser e b #

(<$) :: a -> Parser e b -> Parser e a #

Applicative (Parser e) 
Instance details

Defined in FlatParse.Basic

Methods

pure :: a -> Parser e a #

(<*>) :: Parser e (a -> b) -> Parser e a -> Parser e b #

liftA2 :: (a -> b -> c) -> Parser e a -> Parser e b -> Parser e c #

(*>) :: Parser e a -> Parser e b -> Parser e b #

(<*) :: Parser e a -> Parser e b -> Parser e a #

data Result e a #

Higher-level boxed data type for parsing results.

Constructors

OK a !ByteString

Contains return value and unconsumed input.

Fail

Recoverable-by-default failure.

Err !e

Unrecoverble-by-default error.

Instances

Instances details
Functor (Result e) 
Instance details

Defined in FlatParse.Basic

Methods

fmap :: (a -> b) -> Result e a -> Result e b #

(<$) :: a -> Result e b -> Result e a #

(Show a, Show e) => Show (Result e a) 
Instance details

Defined in FlatParse.Basic

Methods

showsPrec :: Int -> Result e a -> ShowS #

show :: Result e a -> String #

showList :: [Result e a] -> ShowS #

packUTF8 :: String -> ByteString #

Convert a String to an UTF-8-coded ByteString.

unsafeSlice :: ByteString -> Span -> ByteString #

Slice into a ByteString using a Span. The result is invalid if the Span is not a valid slice of the first argument.

isGreekLetter :: Char -> Bool #

isGreekLetter c = ('Α' <= c && c <= 'Ω') || ('α' <= c && c <= 'ω')

isLatinLetter :: Char -> Bool #

isLatinLetter c = ('A' <= c && c <= 'Z') || ('a' <= c && c <= 'z')

isDigit :: Char -> Bool #

isDigit c = '0' <= c && c <= '9'

newtype Pos #

Byte offset counted backwards from the end of the buffer.

Constructors

Pos Int 

Instances

Instances details
Eq Pos 
Instance details

Defined in FlatParse.Internal

Methods

(==) :: Pos -> Pos -> Bool #

(/=) :: Pos -> Pos -> Bool #

Ord Pos 
Instance details

Defined in FlatParse.Internal

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 #

Show Pos 
Instance details

Defined in FlatParse.Internal

Methods

showsPrec :: Int -> Pos -> ShowS #

show :: Pos -> String #

showList :: [Pos] -> ShowS #

data Span #

A pair of positions.

Constructors

Span !Pos !Pos 

Instances

Instances details
Eq Span 
Instance details

Defined in FlatParse.Internal

Methods

(==) :: Span -> Span -> Bool #

(/=) :: Span -> Span -> Bool #

Show Span 
Instance details

Defined in FlatParse.Internal

Methods

showsPrec :: Int -> Span -> ShowS #

show :: Span -> String #

showList :: [Span] -> ShowS #