tomland-1.3.3.3: Bidirectional TOML serialization

Copyright | (c) 2018-2022 Kowainik
License | MPL-2.0
Maintainer | Kowainik <xrom.xkov@gmail.com>
Stability | Stable
Portability | Portable
Safe Haskell | None
Language | Haskell2010

Toml.Parser.Core

Contents

- Reexports from `megaparsec`
- Core parsers for TOML

Description

Core functions for TOML parser.

Synopsis

- satisfy :: MonadParsec e s m => (Token s -> Bool) -> m (Token s)
- eof :: MonadParsec e s m => m ()
- try :: MonadParsec e s m => m a -> m a
- match :: MonadParsec e s m => m a -> m (Tokens s, a)
- errorBundlePretty :: (VisualStream s, TraversableStream s, ShowErrorComponent e) => ParseErrorBundle s e -> String
- type Parsec e s = ParsecT e s Identity
- parse :: Parsec e s a -> String -> s -> Either (ParseErrorBundle s e) a
- anySingle :: MonadParsec e s m => m (Token s)
- (<?>) :: MonadParsec e s m => m a -> String -> m a
- char :: (MonadParsec e s m, Token s ~ Char) => Token s -> m (Token s)
- string :: MonadParsec e s m => Tokens s -> m (Tokens s)
- space1 :: (MonadParsec e s m, Token s ~ Char) => m ()
- space :: (MonadParsec e s m, Token s ~ Char) => m ()
- eol :: (MonadParsec e s m, Token s ~ Char) => m (Tokens s)
- tab :: (MonadParsec e s m, Token s ~ Char) => m (Token s)
- alphaNumChar :: (MonadParsec e s m, Token s ~ Char) => m (Token s)
- digitChar :: (MonadParsec e s m, Token s ~ Char) => m (Token s)
- binDigitChar :: (MonadParsec e s m, Token s ~ Char) => m (Token s)
- octDigitChar :: (MonadParsec e s m, Token s ~ Char) => m (Token s)
- hexDigitChar :: (MonadParsec e s m, Token s ~ Char) => m (Token s)
- binary :: (MonadParsec e s m, Token s ~ Char, Num a) => m a
- symbol :: MonadParsec e s m => m () -> Tokens s -> m (Tokens s)
- skipLineComment :: (MonadParsec e s m, Token s ~ Char) => Tokens s -> m ()
- octal :: (MonadParsec e s m, Token s ~ Char, Num a) => m a
- hexadecimal :: (MonadParsec e s m, Token s ~ Char, Num a) => m a
- float :: (MonadParsec e s m, Token s ~ Char, RealFloat a) => m a
- signed :: (MonadParsec e s m, Token s ~ Char, Num a) => m () -> m a -> m a
- type Parser = Parsec Void Text
- lexeme :: Parser a -> Parser a
- sc :: Parser ()
- text :: Text -> Parser Text

# Reexports from `megaparsec`

satisfy #

Arguments

:: MonadParsec e s m |
=> (Token s -> Bool) | Predicate to apply
-> m (Token s) |

The parser ``satisfy` f` succeeds for any token for which the supplied function `f` returns `True`.

    digitChar = satisfy isDigit <?> "digit"
    oneOf cs  = satisfy (`elem` cs)

Performance note: when you need to parse a single token, it is often a good idea to use `satisfy` with the right predicate function instead of creating a complex parser using the combinators.

See also: `anySingle`, `anySingleBut`, `oneOf`, `noneOf`.

Since: megaparsec-7.0.0

eof :: MonadParsec e s m => m () #

This parser only succeeds at the end of input.

try :: MonadParsec e s m => m a -> m a #

The parser ``try` p` behaves like the parser `p`, except that it backtracks the parser state when `p` fails (either consuming input or not).

This combinator is used whenever arbitrary look ahead is needed. Since it pretends that it hasn't consumed any input when `p` fails, the (`<|>`) combinator will try its second alternative even if the first parser failed while consuming input.

For example, here is a parser that is supposed to parse the word “let” or the word “lexical”:

    >>> parseTest (string "let" <|> string "lexical") "lexical"
    1:1:
    unexpected "lex"
    expecting "let"

What happens here? The first parser consumes “le” and fails (because it doesn't see a “t”). The second parser, however, isn't tried, since the first parser has already consumed some input! `try` fixes this behavior and allows backtracking to work:

    >>> parseTest (try (string "let") <|> string "lexical") "lexical"
    "lexical"

`try` also improves error messages in case of overlapping alternatives, because Megaparsec's hint system can be used:

    >>> parseTest (try (string "let") <|> string "lexical") "le"
    1:1:
    unexpected "le"
    expecting "let" or "lexical"

Note that as of Megaparsec 4.4.0, `string` backtracks automatically (see `tokens`), so it does not need `try`. However, the examples above demonstrate the idea behind `try` so well that it was decided to keep them. You still need to use `try` when your alternatives are complex, composite parsers.

match :: MonadParsec e s m => m a -> m (Tokens s, a) #

Return both the result of a parse and a chunk of input that was consumed during parsing. This relies on the change of the `stateOffset` value to evaluate how many tokens were consumed. If you mess with it manually in the argument parser, prepare for troubles.

Since: megaparsec-5.3.0

errorBundlePretty #

Arguments

:: (VisualStream s, TraversableStream s, ShowErrorComponent e) |
=> ParseErrorBundle s e | Parse error bundle to display
-> String | Textual rendition of the bundle

Pretty-print a `ParseErrorBundle`. All `ParseError`s in the bundle will be pretty-printed in order together with the corresponding offending lines by doing a single pass over the input stream. The rendered `String` always ends with a newline.

Since: megaparsec-7.0.0

type Parsec e s = ParsecT e s Identity #

`Parsec` is a non-transformer variant of the more general `ParsecT` monad transformer.

parse #

Arguments

:: Parsec e s a | Parser to run
-> String | Name of source file
-> s | Input for parser
-> Either (ParseErrorBundle s e) a |

``parse` p file input` runs parser `p` over `Identity` (see `runParserT` if you're using the `ParsecT` monad transformer; `parse` itself is just a synonym for `runParser`). It returns either a `ParseErrorBundle` (`Left`) or a value of type `a` (`Right`). `errorBundlePretty` can be used to turn `ParseErrorBundle` into the string representation of the error message. See Text.Megaparsec.Error if you need to do more advanced error analysis.

    main = case parse numbers "" "11,2,43" of
             Left bundle -> putStr (errorBundlePretty bundle)
             Right xs -> print (sum xs)

    numbers = decimal `sepBy` char ','

`parse` is the same as `runParser`.

anySingle :: MonadParsec e s m => m (Token s) #

Parse and return a single token. It's a good idea to attach a `label` to this parser.

    anySingle = satisfy (const True)

See also: `satisfy`, `anySingleBut`.

Since: megaparsec-7.0.0

(<?>) :: MonadParsec e s m => m a -> String -> m a infix 0 #

A synonym for `label` in the form of an operator.

char :: (MonadParsec e s m, Token s ~ Char) => Token s -> m (Token s) #

A type-constrained version of `single`.

    semicolon = char ';'

string :: MonadParsec e s m => Tokens s -> m (Tokens s) #

A synonym for `chunk`.

space1 :: (MonadParsec e s m, Token s ~ Char) => m () #

Skip one or more white space characters.

See also: `skipSome` and `spaceChar`.

Since: megaparsec-6.0.0

space :: (MonadParsec e s m, Token s ~ Char) => m () #

Skip zero or more white space characters.

See also: `skipMany` and `spaceChar`.

eol :: (MonadParsec e s m, Token s ~ Char) => m (Tokens s) #

Parse a CRLF (see `crlf`) or LF (see `newline`) end of line. Return the sequence of characters parsed.

tab :: (MonadParsec e s m, Token s ~ Char) => m (Token s) #

Parse a tab character.

alphaNumChar :: (MonadParsec e s m, Token s ~ Char) => m (Token s) #

Parse an alphabetic or numeric digit Unicode characters.

Note that the numeric digits outside the ASCII range are parsed by this parser but not by `digitChar`. Such digits may be part of identifiers but are not used by the printer and reader to represent numbers.

digitChar :: (MonadParsec e s m, Token s ~ Char) => m (Token s) #

Parse an ASCII digit, i.e between “0” and “9”.

binDigitChar :: (MonadParsec e s m, Token s ~ Char) => m (Token s) #

Parse a binary digit, i.e. "0" or "1".

Since: megaparsec-7.0.0

octDigitChar :: (MonadParsec e s m, Token s ~ Char) => m (Token s) #

Parse an octal digit, i.e. between “0” and “7”.

hexDigitChar :: (MonadParsec e s m, Token s ~ Char) => m (Token s) #

Parse a hexadecimal digit, i.e. between “0” and “9”, or “a” and “f”, or “A” and “F”.

binary :: (MonadParsec e s m, Token s ~ Char, Num a) => m a #

Parse an integer in binary representation. The binary number is expected to be a non-empty sequence of zeroes “0” and ones “1”.

You could of course parse some prefix before the actual number:

    binary = char '0' >> char' 'b' >> L.binary

Warning: this function does not perform range checks.

Since: megaparsec-7.0.0

symbol #

Arguments

:: MonadParsec e s m |
=> m () | How to consume white space after lexeme
-> Tokens s | Symbol to parse
-> m (Tokens s) |

This is a helper to parse symbols, i.e. verbatim strings. You pass the first argument (parser that consumes white space, probably defined via `space`) and then you can use the resulting function to parse strings:

    symbol    = L.symbol spaceConsumer

    parens    = between (symbol "(") (symbol ")")
    braces    = between (symbol "{") (symbol "}")
    angles    = between (symbol "<") (symbol ">")
    brackets  = between (symbol "[") (symbol "]")
    semicolon = symbol ";"
    comma     = symbol ","
    colon     = symbol ":"
    dot       = symbol "."

skipLineComment #

Arguments

:: (MonadParsec e s m, Token s ~ Char) |
=> Tokens s | Line comment prefix
-> m () |

Given a comment prefix this function returns a parser that skips line comments. Note that it stops just before the newline character but doesn't consume the newline. Newline is either supposed to be consumed by `space` parser or picked up manually.

octal :: (MonadParsec e s m, Token s ~ Char, Num a) => m a #

Parse an integer in the octal representation. The format of the octal number is expected to be according to the Haskell report except for the fact that this parser doesn't parse “0o” or “0O” prefix. It is a responsibility of the programmer to parse correct prefix before parsing the number itself.

For example you can make it conform to the Haskell report like this:

    octal = char '0' >> char' 'o' >> L.octal

Note: before version 6.0.0 the function returned `Integer`, i.e. it wasn't polymorphic in its return type.

Warning: this function does not perform range checks.

hexadecimal :: (MonadParsec e s m, Token s ~ Char, Num a) => m a #

Parse an integer in the hexadecimal representation. The format of the hexadecimal number is expected to be according to the Haskell report except for the fact that this parser doesn't parse “0x” or “0X” prefix. It is a responsibility of the programmer to parse correct prefix before parsing the number itself.

For example you can make it conform to the Haskell report like this:

    hexadecimal = char '0' >> char' 'x' >> L.hexadecimal

Note: before version 6.0.0 the function returned `Integer`, i.e. it wasn't polymorphic in its return type.

Warning: this function does not perform range checks.

float :: (MonadParsec e s m, Token s ~ Char, RealFloat a) => m a #

Parse a floating point number according to the syntax for floating point literals described in the Haskell report.

This function does not parse sign, if you need to parse signed numbers, see `signed`.

Note: before version 6.0.0 the function returned `Double`, i.e. it wasn't polymorphic in its return type.

Note: in versions 6.0.0–6.1.1 this function accepted plain integers.

signed #

Arguments

:: (MonadParsec e s m, Token s ~ Char, Num a) |
=> m () | How to consume white space after the sign
-> m a | How to parse the number itself
-> m a | Parser for signed numbers

``signed` space p` parses an optional sign character (“+” or “-”), then if there is a sign it consumes optional white space (using the `space` parser), then it runs the parser `p` which should return a number. Sign of the number is changed according to the previously parsed sign character.

For example, to parse signed integer you can write:

    lexeme        = L.lexeme spaceConsumer
    integer       = lexeme L.decimal
    signedInteger = L.signed spaceConsumer integer

# Core parsers for TOML

type Parser = Parsec Void Text #

The parser

lexeme :: Parser a -> Parser a #

Wrapper for consuming spaces after every lexeme (not before it!). Consumes all characters according to `sc` parser.

sc :: Parser () #

Space and comment consumer. Currently also consumes newlines.

text :: Text -> Parser Text #

`Parser` for "fixed" string.