module Text.Parse
  ( -- * The Parse class is a replacement for the standard Read class. 
    -- $parser
    TextParser	-- synonym for Parser Char, i.e. string input, no state
  , Parse(..)	-- instances: (), (a,b), (a,b,c), Maybe a, Either a, [a],
		--            Int, Integer, Float, Double, Char, Bool
  , parseByRead	-- :: Read a => String -> TextParser a
  , readByParse -- :: TextParser a -> ReadS a
  , readsPrecByParsePrec -- :: (Int->TextParser a) -> Int -> ReadS a
    -- ** Combinators specific to string input, lexed haskell-style
  , word	-- :: TextParser String
  , isWord	-- :: String -> TextParser ()
  , literal	-- :: String -> TextParser ()
  , optionalParens	-- :: TextParser a -> TextParser a
  , parens	-- :: Bool -> TextParser a -> TextParser a
  , field	-- :: Parse a => String -> TextParser a
  , constructors-- :: [(String,TextParser a)] -> TextParser a
  , enumeration -- :: Show a => String -> [a] -> TextParser a
    -- ** Parsers for literal numerics and characters
  , parseSigned
  , parseInt
  , parseDec
  , parseOct
  , parseHex
  , parseFloat
  , parseLitChar
  , parseLitChar'
    -- ** Re-export all the more general combinators from Poly too
  , module Text.ParserCombinators.Poly
    -- ** Strings as whole entities
  , allAsString
  ) where

import Data.Char as Char (isSpace,toLower,isUpper,isDigit,isOctDigit
                         ,isHexDigit,digitToInt,isAlpha,isAlphaNum,ord,chr)
import Data.List (intersperse)
import Data.Ratio
import Text.ParserCombinators.Poly

------------------------------------------------------------------------
-- $parser
-- The Parse class is a replacement for the standard Read class.  It is a
-- specialisation of the (poly) Parser monad for String input.
-- There are instances defined for all Prelude types.
-- For user-defined types, you can write your own instance, or use
-- DrIFT to generate them automatically, e.g. {-! derive : Parse !-}

-- | A synonym for Parser Char, i.e. string input (no state)
type TextParser a = Parser Char a

-- | The class @Parse@ is a replacement for @Read@, operating over String input.
--   Essentially, it permits better error messages for why something failed to
--   parse.  It is rather important that @parse@ can read back exactly what
--   is generated by the corresponding instance of @show@.  To apply a parser
--   to some text, use @runParser@.
class Parse a where
    -- | A straightforward parser for an item.  (A minimal definition of
    --   a class instance requires either |parse| or |parsePrec|.)
    parse     :: TextParser a
    parse       = Int -> TextParser a
forall a. Parse a => Int -> TextParser a
parsePrec Int
0
    -- | A straightforward parser for an item, given the precedence of
    --   any surrounding expression.  (Precedence determines whether
    --   parentheses are mandatory or optional.)
    parsePrec :: Int -> TextParser a
    parsePrec Int
_ = TextParser a -> TextParser a
forall a. TextParser a -> TextParser a
optionalParens TextParser a
forall a. Parse a => TextParser a
parse
    -- | Parsing a list of items by default accepts the [] and comma syntax,
    --   except when the list is really a character string using \"\".
    parseList :: TextParser [a]	-- only to distinguish [] and ""
    parseList  = do { String -> TextParser String
isWord String
"[]"; [a] -> TextParser [a]
forall (m :: * -> *) a. Monad m => a -> m a
return [] }
                   TextParser [a] -> TextParser [a] -> TextParser [a]
forall t a. Parser t a -> Parser t a -> Parser t a
`onFail`
                 do { String -> TextParser String
isWord String
"["; String -> TextParser String
isWord String
"]"; [a] -> TextParser [a]
forall (m :: * -> *) a. Monad m => a -> m a
return [] }
                   TextParser [a] -> TextParser [a] -> TextParser [a]
forall t a. Parser t a -> Parser t a -> Parser t a
`onFail`
                 TextParser String
-> TextParser String
-> TextParser String
-> TextParser a
-> TextParser [a]
forall (p :: * -> *) bra sep ket a.
PolyParse p =>
p bra -> p sep -> p ket -> p a -> p [a]
bracketSep (String -> TextParser String
isWord String
"[") (String -> TextParser String
isWord String
",") (String -> TextParser String
isWord String
"]")
                            (TextParser a -> TextParser a
forall a. TextParser a -> TextParser a
optionalParens TextParser a
forall a. Parse a => TextParser a
parse)
                   TextParser [a] -> (String -> String) -> TextParser [a]
forall (p :: * -> *) a.
Commitment p =>
p a -> (String -> String) -> p a
`adjustErr` (String
"Expected a list, but\n"String -> String -> String
forall a. [a] -> [a] -> [a]
++)

-- | If there already exists a Read instance for a type, then we can make
--   a Parser for it, but with only poor error-reporting.  The string argument
--   is the expected type or value (for error-reporting only).
parseByRead :: Read a => String -> TextParser a
parseByRead :: String -> TextParser a
parseByRead String
name =
    (String -> Result String a) -> TextParser a
forall t a. ([t] -> Result [t] a) -> Parser t a
P (\String
s-> case ReadS a
forall a. Read a => ReadS a
reads String
s of
                []       -> String -> String -> Result String a
forall z a. z -> String -> Result z a
Failure String
s (String
"no parse, expected a "String -> String -> String
forall a. [a] -> [a] -> [a]
++String
name)
                [(a
a,String
s')] -> String -> a -> Result String a
forall z a. z -> a -> Result z a
Success String
s' a
a
                [(a, String)]
_        -> String -> String -> Result String a
forall z a. z -> String -> Result z a
Failure String
s (String
"ambiguous parse, expected a "String -> String -> String
forall a. [a] -> [a] -> [a]
++String
name)
      )

-- | If you have a TextParser for a type, you can easily make it into
--   a Read instance, by throwing away any error messages.
readByParse :: TextParser a -> ReadS a
readByParse :: TextParser a -> ReadS a
readByParse TextParser a
p = \String
inp->
    case TextParser a -> String -> (Either String a, String)
forall t a. Parser t a -> [t] -> (Either String a, [t])
runParser TextParser a
p String
inp of
        (Left String
err,  String
rest) -> []
        (Right a
val, String
rest) -> [(a
val,String
rest)]

-- | If you have a TextParser for a type, you can easily make it into
--   a Read instance, by throwing away any error messages.
readsPrecByParsePrec :: (Int -> TextParser a) -> Int -> ReadS a
readsPrecByParsePrec :: (Int -> TextParser a) -> Int -> ReadS a
readsPrecByParsePrec Int -> TextParser a
p = \Int
prec String
inp->
    case TextParser a -> String -> (Either String a, String)
forall t a. Parser t a -> [t] -> (Either String a, [t])
runParser (Int -> TextParser a
p Int
prec) String
inp of
        (Left String
err,  String
rest) -> []
        (Right a
val, String
rest) -> [(a
val,String
rest)]

-- | One lexical chunk.  This is Haskell'98-style lexing - the result
--   should match Prelude.lex apart from better error-reporting.
word :: TextParser String
word :: TextParser String
word = (String -> Result String String) -> TextParser String
forall t a. ([t] -> Result [t] a) -> Parser t a
P String -> Result String String
p
  where
    p :: String -> Result String String
p String
""       = String -> String -> Result String String
forall z a. z -> String -> Result z a
Failure String
"" String
"end of input"
    p (Char
c:String
s)    | Char -> Bool
isSpace Char
c = String -> Result String String
p ((Char -> Bool) -> String -> String
forall a. (a -> Bool) -> [a] -> [a]
dropWhile Char -> Bool
isSpace String
s)
    p (Char
'\'':String
s) = let (P String -> Result String Char
lit) = Parser Char Char
parseLitChar' in (Char -> String) -> Result String Char -> Result String String
forall (f :: * -> *) a b. Functor f => (a -> b) -> f a -> f b
fmap Char -> String
forall a. Show a => a -> String
show (String -> Result String Char
lit (Char
'\''Char -> String -> String
forall a. a -> [a] -> [a]
:String
s))
    p (Char
'"':String
s)  = String -> String -> Result String String
lexString String
"\"" String
s
             where lexString :: String -> String -> Result String String
lexString String
acc (Char
'"':String
s)      = String -> String -> Result String String
forall z a. z -> a -> Result z a
Success String
s (String -> String
forall a. [a] -> [a]
reverse (Char
'"'Char -> String -> String
forall a. a -> [a] -> [a]
:String
acc))
                   lexString String
acc []           = String -> String -> Result String String
forall z a. z -> String -> Result z a
Failure [] (String
"end of input in "
                                                           String -> String -> String
forall a. [a] -> [a] -> [a]
++String
"string literal "
                                                           String -> String -> String
forall a. [a] -> [a] -> [a]
++String
acc)
                   lexString String
acc String
s = let (P String -> Result String Char
lit) = Parser Char Char
parseLitChar
                                     in case String -> Result String Char
lit String
s of
                                          Failure String
a String
b -> String -> String -> Result String String
forall z a. z -> String -> Result z a
Failure String
a String
b
                                          Success String
t Char
c -> String -> String -> Result String String
lexString (Char
cChar -> String -> String
forall a. a -> [a] -> [a]
:String
acc) String
t
    p (Char
'0':Char
'x':String
s) = String -> String -> Result String String
forall z a. z -> a -> Result z a
Success String
t (Char
'0'Char -> String -> String
forall a. a -> [a] -> [a]
:Char
'x'Char -> String -> String
forall a. a -> [a] -> [a]
:String
ds) where (String
ds,String
t) = (Char -> Bool) -> String -> (String, String)
forall a. (a -> Bool) -> [a] -> ([a], [a])
span Char -> Bool
isHexDigit String
s
    p (Char
'0':Char
'X':String
s) = String -> String -> Result String String
forall z a. z -> a -> Result z a
Success String
t (Char
'0'Char -> String -> String
forall a. a -> [a] -> [a]
:Char
'X'Char -> String -> String
forall a. a -> [a] -> [a]
:String
ds) where (String
ds,String
t) = (Char -> Bool) -> String -> (String, String)
forall a. (a -> Bool) -> [a] -> ([a], [a])
span Char -> Bool
isHexDigit String
s
    p (Char
'0':Char
'o':String
s) = String -> String -> Result String String
forall z a. z -> a -> Result z a
Success String
t (Char
'0'Char -> String -> String
forall a. a -> [a] -> [a]
:Char
'o'Char -> String -> String
forall a. a -> [a] -> [a]
:String
ds) where (String
ds,String
t) = (Char -> Bool) -> String -> (String, String)
forall a. (a -> Bool) -> [a] -> ([a], [a])
span Char -> Bool
isOctDigit String
s
    p (Char
'0':Char
'O':String
s) = String -> String -> Result String String
forall z a. z -> a -> Result z a
Success String
t (Char
'0'Char -> String -> String
forall a. a -> [a] -> [a]
:Char
'O'Char -> String -> String
forall a. a -> [a] -> [a]
:String
ds) where (String
ds,String
t) = (Char -> Bool) -> String -> (String, String)
forall a. (a -> Bool) -> [a] -> ([a], [a])
span Char -> Bool
isOctDigit String
s
    p (Char
c:String
s) | Char -> Bool
isSingle Char
c = String -> String -> Result String String
forall z a. z -> a -> Result z a
Success String
s [Char
c]
            | Char -> Bool
isSym    Char
c = let (String
sym,String
t) = (Char -> Bool) -> String -> (String, String)
forall a. (a -> Bool) -> [a] -> ([a], [a])
span Char -> Bool
isSym String
s in String -> String -> Result String String
forall z a. z -> a -> Result z a
Success String
t (Char
cChar -> String -> String
forall a. a -> [a] -> [a]
:String
sym)
            | Char -> Bool
isIdInit Char
c = let (String
nam,String
t) = (Char -> Bool) -> String -> (String, String)
forall a. (a -> Bool) -> [a] -> ([a], [a])
span Char -> Bool
isIdChar String
s in String -> String -> Result String String
forall z a. z -> a -> Result z a
Success String
t (Char
cChar -> String -> String
forall a. a -> [a] -> [a]
:String
nam)
            | Char -> Bool
isDigit  Char
c = let (String
ds,String
t)  = (Char -> Bool) -> String -> (String, String)
forall a. (a -> Bool) -> [a] -> ([a], [a])
span Char -> Bool
isDigit String
s in
                           String -> String -> Result String String
lexFracExp (Char
cChar -> String -> String
forall a. a -> [a] -> [a]
:String
ds) String
t
            | Bool
otherwise  = String -> String -> Result String String
forall z a. z -> String -> Result z a
Failure (Char
cChar -> String -> String
forall a. a -> [a] -> [a]
:String
s) (String
"Bad character: "String -> String -> String
forall a. [a] -> [a] -> [a]
++Char -> String
forall a. Show a => a -> String
show Char
c)
             where isSingle :: Char -> Bool
isSingle Char
c  =  Char
c Char -> String -> Bool
forall (t :: * -> *) a. (Foldable t, Eq a) => a -> t a -> Bool
`elem` String
",;()[]{}`"
                   isSym :: Char -> Bool
isSym    Char
c  =  Char
c Char -> String -> Bool
forall (t :: * -> *) a. (Foldable t, Eq a) => a -> t a -> Bool
`elem` String
"!@#$%&*+./<=>?\\^|:-~"
                   isIdInit :: Char -> Bool
isIdInit Char
c  =  Char -> Bool
isAlpha Char
c Bool -> Bool -> Bool
|| Char
c Char -> Char -> Bool
forall a. Eq a => a -> a -> Bool
== Char
'_'
                   isIdChar :: Char -> Bool
isIdChar Char
c  =  Char -> Bool
isAlphaNum Char
c Bool -> Bool -> Bool
|| Char
c Char -> String -> Bool
forall (t :: * -> *) a. (Foldable t, Eq a) => a -> t a -> Bool
`elem` String
"_'"
                   lexFracExp :: String -> String -> Result String String
lexFracExp String
acc (Char
'.':Char
d:String
s) | Char -> Bool
isDigit Char
d   =
                                      String -> String -> Result String String
lexExp (String
accString -> String -> String
forall a. [a] -> [a] -> [a]
++Char
'.'Char -> String -> String
forall a. a -> [a] -> [a]
:Char
dChar -> String -> String
forall a. a -> [a] -> [a]
:String
ds) String
t
                                              where (String
ds,String
t) = (Char -> Bool) -> String -> (String, String)
forall a. (a -> Bool) -> [a] -> ([a], [a])
span Char -> Bool
isDigit String
s
                   lexFracExp String
acc String
s = String -> String -> Result String String
lexExp String
acc String
s
                   lexExp :: String -> String -> Result String String
lexExp     String
acc (Char
e:String
s) | Char
eChar -> String -> Bool
forall (t :: * -> *) a. (Foldable t, Eq a) => a -> t a -> Bool
`elem`String
"eE" =
                                      case String
s of
                                        (Char
'+':Char
d:String
t) | Char -> Bool
isDigit Char
d ->
                                                    let (String
ds,String
u)=(Char -> Bool) -> String -> (String, String)
forall a. (a -> Bool) -> [a] -> ([a], [a])
span Char -> Bool
isDigit String
t in
                                                    String -> String -> Result String String
forall z a. z -> a -> Result z a
Success String
u (String
accString -> String -> String
forall a. [a] -> [a] -> [a]
++String
"e+"String -> String -> String
forall a. [a] -> [a] -> [a]
++Char
dChar -> String -> String
forall a. a -> [a] -> [a]
:String
ds)
                                        (Char
'-':Char
d:String
t) | Char -> Bool
isDigit Char
d ->
                                                    let (String
ds,String
u)=(Char -> Bool) -> String -> (String, String)
forall a. (a -> Bool) -> [a] -> ([a], [a])
span Char -> Bool
isDigit String
t in
                                                    String -> String -> Result String String
forall z a. z -> a -> Result z a
Success String
u (String
accString -> String -> String
forall a. [a] -> [a] -> [a]
++String
"e-"String -> String -> String
forall a. [a] -> [a] -> [a]
++Char
dChar -> String -> String
forall a. a -> [a] -> [a]
:String
ds)
                                        (Char
d:String
t) |Char -> Bool
isDigit Char
d ->
                                                    let (String
ds,String
u)=(Char -> Bool) -> String -> (String, String)
forall a. (a -> Bool) -> [a] -> ([a], [a])
span Char -> Bool
isDigit String
t in
                                                    String -> String -> Result String String
forall z a. z -> a -> Result z a
Success String
u (String
accString -> String -> String
forall a. [a] -> [a] -> [a]
++String
"e"String -> String -> String
forall a. [a] -> [a] -> [a]
++Char
dChar -> String -> String
forall a. a -> [a] -> [a]
:String
ds)
                                        String
_ -> String -> String -> Result String String
forall z a. z -> String -> Result z a
Failure String
s (String
"missing +/-/digit "
                                                       String -> String -> String
forall a. [a] -> [a] -> [a]
++String
"after e in float "
                                                       String -> String -> String
forall a. [a] -> [a] -> [a]
++String
"literal: "
                                                       String -> String -> String
forall a. [a] -> [a] -> [a]
++String -> String
forall a. Show a => a -> String
show (String
accString -> String -> String
forall a. [a] -> [a] -> [a]
++String
"e"String -> String -> String
forall a. [a] -> [a] -> [a]
++String
"..."))
                   lexExp     String
acc String
s     = String -> String -> Result String String
forall z a. z -> a -> Result z a
Success String
s String
acc



-- | One lexical chunk (Haskell'98-style lexing - the result should match
--   Prelude.lex apart from error-reporting).
oldword :: TextParser String
oldword :: TextParser String
oldword = (String -> Result String String) -> TextParser String
forall t a. ([t] -> Result [t] a) -> Parser t a
P (\String
s-> case ReadS String
lex String
s of
                   []         -> String -> String -> Result String String
forall z a. z -> String -> Result z a
Failure String
s  (String
"no input? (impossible)")
                   [(String
"",String
"")]  -> String -> String -> Result String String
forall z a. z -> String -> Result z a
Failure String
"" (String
"no input?")
                   [(String
"",String
s')]  -> String -> String -> Result String String
forall z a. z -> String -> Result z a
Failure String
s  (String
"lexing failed?")
                   ((String
x,String
s'):[(String, String)]
_) -> String -> String -> Result String String
forall z a. z -> a -> Result z a
Success String
s' String
x
         )

-- | Ensure that the next input word is the given string.  (Note the input
--   is lexed as haskell, so wordbreaks at spaces, symbols, etc.)
isWord :: String -> TextParser String
isWord :: String -> TextParser String
isWord String
w = do { String
w' <- TextParser String
word
              ; if String
w'String -> String -> Bool
forall a. Eq a => a -> a -> Bool
==String
w then String -> TextParser String
forall (m :: * -> *) a. Monad m => a -> m a
return String
w else String -> TextParser String
forall (m :: * -> *) a. MonadFail m => String -> m a
fail (String
"expected "String -> String -> String
forall a. [a] -> [a] -> [a]
++String
wString -> String -> String
forall a. [a] -> [a] -> [a]
++String
" got "String -> String -> String
forall a. [a] -> [a] -> [a]
++String
w')
              }

-- | Ensure that the next input word is the given string.  (No
--   lexing, so mixed spaces, symbols, are accepted.)
literal :: String -> TextParser String
literal :: String -> TextParser String
literal String
w = do { String
w' <- String -> TextParser String
forall a. Eq a => [a] -> Parser a String
walk String
w
               ; if String
w'String -> String -> Bool
forall a. Eq a => a -> a -> Bool
==String
w then String -> TextParser String
forall (m :: * -> *) a. Monad m => a -> m a
return String
w else String -> TextParser String
forall (m :: * -> *) a. MonadFail m => String -> m a
fail (String
"expected "String -> String -> String
forall a. [a] -> [a] -> [a]
++String
wString -> String -> String
forall a. [a] -> [a] -> [a]
++String
" got "String -> String -> String
forall a. [a] -> [a] -> [a]
++String
w')
               }
  where walk :: [a] -> Parser a String
walk []     = String -> Parser a String
forall (m :: * -> *) a. Monad m => a -> m a
return String
w
        walk (a
c:[a]
cs) = do { a
x <- Parser a a
forall t. Parser t t
next
                         ; if a
xa -> a -> Bool
forall a. Eq a => a -> a -> Bool
==a
c then [a] -> Parser a String
walk [a]
cs
                                   else String -> Parser a String
forall (m :: * -> *) a. Monad m => a -> m a
return []
                         }

-- | Allow nested parens around an item.
optionalParens :: TextParser a -> TextParser a
optionalParens :: TextParser a -> TextParser a
optionalParens TextParser a
p = Bool -> TextParser a -> TextParser a
forall a. Bool -> TextParser a -> TextParser a
parens Bool
False TextParser a
p

-- | Allow nested parens around an item (one set required when Bool is True).
parens :: Bool -> TextParser a -> TextParser a
parens :: Bool -> TextParser a -> TextParser a
parens Bool
True  TextParser a
p = TextParser String
-> TextParser String -> TextParser a -> TextParser a
forall (p :: * -> *) bra ket a.
PolyParse p =>
p bra -> p ket -> p a -> p a
bracket (String -> TextParser String
isWord String
"(") (String -> TextParser String
isWord String
")") (Bool -> TextParser a -> TextParser a
forall a. Bool -> TextParser a -> TextParser a
parens Bool
False TextParser a
p)
parens Bool
False TextParser a
p = Bool -> TextParser a -> TextParser a
forall a. Bool -> TextParser a -> TextParser a
parens Bool
True TextParser a
p TextParser a -> TextParser a -> TextParser a
forall t a. Parser t a -> Parser t a -> Parser t a
`onFail` TextParser a
p

-- | Deal with named field syntax.  The string argument is the field name,
--   and the parser returns the value of the field.
field :: Parse a => String -> TextParser a
field :: String -> TextParser a
field String
name = do { String -> TextParser String
isWord String
name; TextParser a -> TextParser a
forall (p :: * -> *) a. Commitment p => p a -> p a
commit (TextParser a -> TextParser a) -> TextParser a -> TextParser a
forall a b. (a -> b) -> a -> b
$ do { String -> TextParser String
isWord String
"="; TextParser a
forall a. Parse a => TextParser a
parse } }

-- | Parse one of a bunch of alternative constructors.  In the list argument,
--   the first element of the pair is the constructor name, and
--   the second is the parser for the rest of the value.  The first matching
--   parse is returned.
constructors :: [(String,TextParser a)] -> TextParser a
constructors :: [(String, TextParser a)] -> TextParser a
constructors [(String, TextParser a)]
cs = [(String, TextParser a)] -> TextParser a
forall (p :: * -> *) a. Commitment p => [(String, p a)] -> p a
oneOf' (((String, TextParser a) -> (String, TextParser a))
-> [(String, TextParser a)] -> [(String, TextParser a)]
forall a b. (a -> b) -> [a] -> [b]
map (String, TextParser a) -> (String, TextParser a)
forall b. (String, Parser Char b) -> (String, Parser Char b)
cons [(String, TextParser a)]
cs)
    where cons :: (String, Parser Char b) -> (String, Parser Char b)
cons (String
name,Parser Char b
p) =
               ( String
name
               , do { String -> TextParser String
isWord String
name
                    ; Parser Char b
p Parser Char b -> (String -> String) -> Parser Char b
forall (p :: * -> *) a.
PolyParse p =>
p a -> (String -> String) -> p a
`adjustErrBad` ((String
"got constructor, but within "
                                        String -> String -> String
forall a. [a] -> [a] -> [a]
++String
nameString -> String -> String
forall a. [a] -> [a] -> [a]
++String
",\n")String -> String -> String
forall a. [a] -> [a] -> [a]
++)
                    }
               )

-- | Parse one of the given nullary constructors (an enumeration).
--   The string argument is the name of the type, and the list argument
--   should contain all of the possible enumeration values.
enumeration :: (Show a) => String -> [a] -> TextParser a
enumeration :: String -> [a] -> TextParser a
enumeration String
typ [a]
cs = [TextParser a] -> TextParser a
forall (p :: * -> *) a. PolyParse p => [p a] -> p a
oneOf ((a -> TextParser a) -> [a] -> [TextParser a]
forall a b. (a -> b) -> [a] -> [b]
map (\a
c-> do { String -> TextParser String
isWord (a -> String
forall a. Show a => a -> String
show a
c); a -> TextParser a
forall (m :: * -> *) a. Monad m => a -> m a
return a
c }) [a]
cs)
                         TextParser a -> (String -> String) -> TextParser a
forall (p :: * -> *) a.
Commitment p =>
p a -> (String -> String) -> p a
`adjustErr`
                     (String -> String -> String
forall a. [a] -> [a] -> [a]
++(String
"\n  expected "String -> String -> String
forall a. [a] -> [a] -> [a]
++String
typString -> String -> String
forall a. [a] -> [a] -> [a]
++String
" value ("String -> String -> String
forall a. [a] -> [a] -> [a]
++String
eString -> String -> String
forall a. [a] -> [a] -> [a]
++String
")"))
    where e :: String
e = [String] -> String
forall (t :: * -> *) a. Foldable t => t [a] -> [a]
concat (String -> [String] -> [String]
forall a. a -> [a] -> [a]
intersperse String
", " ((a -> String) -> [a] -> [String]
forall a b. (a -> b) -> [a] -> [b]
map a -> String
forall a. Show a => a -> String
show ([a] -> [a]
forall a. [a] -> [a]
init [a]
cs)))
              String -> String -> String
forall a. [a] -> [a] -> [a]
++ String
", or " String -> String -> String
forall a. [a] -> [a] -> [a]
++ a -> String
forall a. Show a => a -> String
show ([a] -> a
forall a. [a] -> a
last [a]
cs)

------------------------------------------------------------------------
-- Instances for all the Standard Prelude types.

-- Numeric types
parseSigned :: Real a => TextParser a -> TextParser a
parseSigned :: TextParser a -> TextParser a
parseSigned TextParser a
p = do Char
'-' <- Parser Char Char
forall t. Parser t t
next; TextParser a -> TextParser a
forall (p :: * -> *) a. Commitment p => p a -> p a
commit ((a -> a) -> TextParser a -> TextParser a
forall (f :: * -> *) a b. Functor f => (a -> b) -> f a -> f b
fmap a -> a
forall a. Num a => a -> a
negate TextParser a
p)
                TextParser a -> TextParser a -> TextParser a
forall t a. Parser t a -> Parser t a -> Parser t a
`onFail`
                do TextParser a
p

parseInt :: (Integral a) => String ->
                            a -> (Char -> Bool) -> (Char -> Int) ->
                            TextParser a
parseInt :: String -> a -> (Char -> Bool) -> (Char -> Int) -> TextParser a
parseInt String
base a
radix Char -> Bool
isDigit Char -> Int
digitToInt =
                 do String
cs <- Parser Char Char -> TextParser String
forall (p :: * -> *) a. PolyParse p => p a -> p [a]
many1 ((Char -> Bool) -> Parser Char Char
forall t. (t -> Bool) -> Parser t t
satisfy Char -> Bool
isDigit)
                    a -> TextParser a
forall (m :: * -> *) a. Monad m => a -> m a
return ((a -> a -> a) -> [a] -> a
forall (t :: * -> *) a. Foldable t => (a -> a -> a) -> t a -> a
foldl1 (\a
n a
d-> a
na -> a -> a
forall a. Num a => a -> a -> a
*a
radixa -> a -> a
forall a. Num a => a -> a -> a
+a
d)
                                   ((Char -> a) -> String -> [a]
forall a b. (a -> b) -> [a] -> [b]
map (Int -> a
forall a b. (Integral a, Num b) => a -> b
fromIntegral(Int -> a) -> (Char -> Int) -> Char -> a
forall b c a. (b -> c) -> (a -> b) -> a -> c
.Char -> Int
digitToInt) String
cs))
                 TextParser a -> (String -> String) -> TextParser a
forall (p :: * -> *) a.
Commitment p =>
p a -> (String -> String) -> p a
`adjustErr` (String -> String -> String
forall a. [a] -> [a] -> [a]
++(String
"\nexpected one or more "String -> String -> String
forall a. [a] -> [a] -> [a]
++String
baseString -> String -> String
forall a. [a] -> [a] -> [a]
++String
" digits"))
parseDec, parseOct, parseHex :: (Integral a) => TextParser a
parseDec :: TextParser a
parseDec = String -> a -> (Char -> Bool) -> (Char -> Int) -> TextParser a
forall a.
Integral a =>
String -> a -> (Char -> Bool) -> (Char -> Int) -> TextParser a
parseInt String
"decimal" a
10 Char -> Bool
Char.isDigit    Char -> Int
Char.digitToInt
parseOct :: TextParser a
parseOct = String -> a -> (Char -> Bool) -> (Char -> Int) -> TextParser a
forall a.
Integral a =>
String -> a -> (Char -> Bool) -> (Char -> Int) -> TextParser a
parseInt String
"octal"    a
8 Char -> Bool
Char.isOctDigit Char -> Int
Char.digitToInt
parseHex :: TextParser a
parseHex = String -> a -> (Char -> Bool) -> (Char -> Int) -> TextParser a
forall a.
Integral a =>
String -> a -> (Char -> Bool) -> (Char -> Int) -> TextParser a
parseInt String
"hex"     a
16 Char -> Bool
Char.isHexDigit Char -> Int
Char.digitToInt

parseFloat :: (RealFrac a) => TextParser a
parseFloat :: TextParser a
parseFloat = do String
ds   <- Parser Char Char -> TextParser String
forall (p :: * -> *) a. PolyParse p => p a -> p [a]
many1 ((Char -> Bool) -> Parser Char Char
forall t. (t -> Bool) -> Parser t t
satisfy Char -> Bool
isDigit)
                String
frac <- (do Char
'.' <- Parser Char Char
forall t. Parser t t
next
                            Parser Char Char -> TextParser String
forall (f :: * -> *) a. Alternative f => f a -> f [a]
many ((Char -> Bool) -> Parser Char Char
forall t. (t -> Bool) -> Parser t t
satisfy Char -> Bool
isDigit)
                              TextParser String -> (String -> String) -> TextParser String
forall (p :: * -> *) a.
PolyParse p =>
p a -> (String -> String) -> p a
`adjustErrBad` (String -> String -> String
forall a. [a] -> [a] -> [a]
++String
"expected digit after .")
                         TextParser String -> TextParser String -> TextParser String
forall t a. Parser t a -> Parser t a -> Parser t a
`onFail` String -> TextParser String
forall (m :: * -> *) a. Monad m => a -> m a
return [] )
                Int
exp  <- Parser Char Int
exponent Parser Char Int -> Parser Char Int -> Parser Char Int
forall t a. Parser t a -> Parser t a -> Parser t a
`onFail` Int -> Parser Char Int
forall (m :: * -> *) a. Monad m => a -> m a
return Int
0
                ( a -> TextParser a
forall (m :: * -> *) a. Monad m => a -> m a
return (a -> TextParser a) -> (String -> a) -> String -> TextParser a
forall b c a. (b -> c) -> (a -> b) -> a -> c
. Rational -> a
forall a. Fractional a => Rational -> a
fromRational (Rational -> a) -> (String -> Rational) -> String -> a
forall b c a. (b -> c) -> (a -> b) -> a -> c
. (Rational -> Rational -> Rational
forall a. Num a => a -> a -> a
* (Rational
10Rational -> Int -> Rational
forall a b. (Fractional a, Integral b) => a -> b -> a
^^(Int
exp Int -> Int -> Int
forall a. Num a => a -> a -> a
- String -> Int
forall (t :: * -> *) a. Foldable t => t a -> Int
length String
frac)))
                  (Rational -> Rational)
-> (String -> Rational) -> String -> Rational
forall b c a. (b -> c) -> (a -> b) -> a -> c
. (Integer -> Integer -> Rational
forall a. Integral a => a -> a -> Ratio a
%Integer
1) (Integer -> Rational) -> (String -> Integer) -> String -> Rational
forall b c a. (b -> c) -> (a -> b) -> a -> c
.  (\ (Right Integer
x)->Integer
x) (Either String Integer -> Integer)
-> (String -> Either String Integer) -> String -> Integer
forall b c a. (b -> c) -> (a -> b) -> a -> c
. (Either String Integer, String) -> Either String Integer
forall a b. (a, b) -> a
fst
                  ((Either String Integer, String) -> Either String Integer)
-> (String -> (Either String Integer, String))
-> String
-> Either String Integer
forall b c a. (b -> c) -> (a -> b) -> a -> c
. Parser Char Integer -> String -> (Either String Integer, String)
forall t a. Parser t a -> [t] -> (Either String a, [t])
runParser Parser Char Integer
forall a. Integral a => TextParser a
parseDec ) (String
dsString -> String -> String
forall a. [a] -> [a] -> [a]
++String
frac)
             TextParser a -> TextParser a -> TextParser a
forall t a. Parser t a -> Parser t a -> Parser t a
`onFail`
             do String
w <- Parser Char Char -> TextParser String
forall (f :: * -> *) a. Alternative f => f a -> f [a]
many ((Char -> Bool) -> Parser Char Char
forall t. (t -> Bool) -> Parser t t
satisfy (Bool -> Bool
not(Bool -> Bool) -> (Char -> Bool) -> Char -> Bool
forall b c a. (b -> c) -> (a -> b) -> a -> c
.Char -> Bool
isSpace))
                case (Char -> Char) -> String -> String
forall a b. (a -> b) -> [a] -> [b]
map Char -> Char
toLower String
w of
                  String
"nan"      -> a -> TextParser a
forall (m :: * -> *) a. Monad m => a -> m a
return (a
0a -> a -> a
forall a. Fractional a => a -> a -> a
/a
0)
                  String
"infinity" -> a -> TextParser a
forall (m :: * -> *) a. Monad m => a -> m a
return (a
1a -> a -> a
forall a. Fractional a => a -> a -> a
/a
0)
                  String
_          -> String -> TextParser a
forall (m :: * -> *) a. MonadFail m => String -> m a
fail String
"expected a floating point number"
  where exponent :: Parser Char Int
exponent = do Char
'e' <- (Char -> Char) -> Parser Char Char -> Parser Char Char
forall (f :: * -> *) a b. Functor f => (a -> b) -> f a -> f b
fmap Char -> Char
toLower Parser Char Char
forall t. Parser t t
next
                      Parser Char Int -> Parser Char Int
forall (p :: * -> *) a. Commitment p => p a -> p a
commit (do Char
'+' <- Parser Char Char
forall t. Parser t t
next; Parser Char Int
forall a. Integral a => TextParser a
parseDec
                              Parser Char Int -> Parser Char Int -> Parser Char Int
forall t a. Parser t a -> Parser t a -> Parser t a
`onFail`
                              Parser Char Int -> Parser Char Int
forall a. Real a => TextParser a -> TextParser a
parseSigned Parser Char Int
forall a. Integral a => TextParser a
parseDec )

-- | Parse a Haskell character literal, including the surrounding single quotes.
parseLitChar' :: TextParser Char
parseLitChar' :: Parser Char Char
parseLitChar' = do Char
'\'' <- Parser Char Char
forall t. Parser t t
next Parser Char Char -> (String -> String) -> Parser Char Char
forall (p :: * -> *) a.
Commitment p =>
p a -> (String -> String) -> p a
`adjustErr` (String -> String -> String
forall a. [a] -> [a] -> [a]
++String
"expected a literal char")
                   Char
char <- Parser Char Char
parseLitChar
                   Char
'\'' <- Parser Char Char
forall t. Parser t t
next Parser Char Char -> (String -> String) -> Parser Char Char
forall (p :: * -> *) a.
PolyParse p =>
p a -> (String -> String) -> p a
`adjustErrBad` (String -> String -> String
forall a. [a] -> [a] -> [a]
++String
"literal char has no final '")
                   Char -> Parser Char Char
forall (m :: * -> *) a. Monad m => a -> m a
return Char
char

-- | Parse a Haskell character literal, excluding the surrounding single quotes.
parseLitChar :: TextParser Char
parseLitChar :: Parser Char Char
parseLitChar = do Char
c <- Parser Char Char
forall t. Parser t t
next
                  Char
char <- case Char
c of
                            Char
'\\' -> Parser Char Char
forall t. Parser t t
next Parser Char Char -> (Char -> Parser Char Char) -> Parser Char Char
forall (m :: * -> *) a b. Monad m => m a -> (a -> m b) -> m b
>>= Char -> Parser Char Char
escape
                            Char
'\'' -> String -> Parser Char Char
forall (m :: * -> *) a. MonadFail m => String -> m a
fail String
"expected a literal char, got ''"
                            Char
_    -> Char -> Parser Char Char
forall (m :: * -> *) a. Monad m => a -> m a
return Char
c
                  Char -> Parser Char Char
forall (m :: * -> *) a. Monad m => a -> m a
return Char
char

  where
    escape :: Char -> Parser Char Char
escape Char
'a'  = Char -> Parser Char Char
forall (m :: * -> *) a. Monad m => a -> m a
return Char
'\a'
    escape Char
'b'  = Char -> Parser Char Char
forall (m :: * -> *) a. Monad m => a -> m a
return Char
'\b'
    escape Char
'f'  = Char -> Parser Char Char
forall (m :: * -> *) a. Monad m => a -> m a
return Char
'\f'
    escape Char
'n'  = Char -> Parser Char Char
forall (m :: * -> *) a. Monad m => a -> m a
return Char
'\n'
    escape Char
'r'  = Char -> Parser Char Char
forall (m :: * -> *) a. Monad m => a -> m a
return Char
'\r'
    escape Char
't'  = Char -> Parser Char Char
forall (m :: * -> *) a. Monad m => a -> m a
return Char
'\t'
    escape Char
'v'  = Char -> Parser Char Char
forall (m :: * -> *) a. Monad m => a -> m a
return Char
'\v'
    escape Char
'\\' = Char -> Parser Char Char
forall (m :: * -> *) a. Monad m => a -> m a
return Char
'\\'
    escape Char
'"'  = Char -> Parser Char Char
forall (m :: * -> *) a. Monad m => a -> m a
return Char
'"'
    escape Char
'\'' = Char -> Parser Char Char
forall (m :: * -> *) a. Monad m => a -> m a
return Char
'\''
    escape Char
'^'  = do Char
ctrl <- Parser Char Char
forall t. Parser t t
next
                     if Char
ctrl Char -> Char -> Bool
forall a. Ord a => a -> a -> Bool
>= Char
'@' Bool -> Bool -> Bool
&& Char
ctrl Char -> Char -> Bool
forall a. Ord a => a -> a -> Bool
<= Char
'_'
                       then Char -> Parser Char Char
forall (m :: * -> *) a. Monad m => a -> m a
return (Int -> Char
chr (Char -> Int
ord Char
ctrl Int -> Int -> Int
forall a. Num a => a -> a -> a
- Char -> Int
ord Char
'@'))
                       else String -> Parser Char Char
forall (m :: * -> *) a. MonadFail m => String -> m a
fail (String
"literal char ctrl-escape malformed: \\^"
                                   String -> String -> String
forall a. [a] -> [a] -> [a]
++[Char
ctrl])
    escape Char
d | Char -> Bool
isDigit Char
d
                = (Int -> Char) -> Parser Char Int -> Parser Char Char
forall (f :: * -> *) a b. Functor f => (a -> b) -> f a -> f b
fmap Int -> Char
chr (Parser Char Int -> Parser Char Char)
-> Parser Char Int -> Parser Char Char
forall a b. (a -> b) -> a -> b
$  (String -> Parser Char ()
forall t. [t] -> Parser t ()
reparse [Char
d] Parser Char () -> Parser Char Int -> Parser Char Int
forall (m :: * -> *) a b. Monad m => m a -> m b -> m b
>> Parser Char Int
forall a. Integral a => TextParser a
parseDec)
    escape Char
'o'  = (Int -> Char) -> Parser Char Int -> Parser Char Char
forall (f :: * -> *) a b. Functor f => (a -> b) -> f a -> f b
fmap Int -> Char
chr (Parser Char Int -> Parser Char Char)
-> Parser Char Int -> Parser Char Char
forall a b. (a -> b) -> a -> b
$  Parser Char Int
forall a. Integral a => TextParser a
parseOct
    escape Char
'x'  = (Int -> Char) -> Parser Char Int -> Parser Char Char
forall (f :: * -> *) a b. Functor f => (a -> b) -> f a -> f b
fmap Int -> Char
chr (Parser Char Int -> Parser Char Char)
-> Parser Char Int -> Parser Char Char
forall a b. (a -> b) -> a -> b
$  Parser Char Int
forall a. Integral a => TextParser a
parseHex
    escape Char
c | Char -> Bool
isUpper Char
c
                = Char -> Parser Char Char
mnemonic Char
c
    escape Char
c    = String -> Parser Char Char
forall (m :: * -> *) a. MonadFail m => String -> m a
fail (String
"unrecognised escape sequence in literal char: \\"String -> String -> String
forall a. [a] -> [a] -> [a]
++[Char
c])

    mnemonic :: Char -> Parser Char Char
mnemonic Char
'A' = do Char
'C' <- Parser Char Char
forall t. Parser t t
next; Char
'K' <- Parser Char Char
forall t. Parser t t
next; Char -> Parser Char Char
forall (m :: * -> *) a. Monad m => a -> m a
return Char
'\ACK'
                   Parser Char Char -> String -> Parser Char Char
forall t a. Parser t a -> String -> Parser t a
`wrap` String
"'\\ACK'"
    mnemonic Char
'B' = do Char
'E' <- Parser Char Char
forall t. Parser t t
next; Char
'L' <- Parser Char Char
forall t. Parser t t
next; Char -> Parser Char Char
forall (m :: * -> *) a. Monad m => a -> m a
return Char
'\BEL'
                   Parser Char Char -> Parser Char Char -> Parser Char Char
forall t a. Parser t a -> Parser t a -> Parser t a
`onFail`
                   do Char
'S' <- Parser Char Char
forall t. Parser t t
next; Char -> Parser Char Char
forall (m :: * -> *) a. Monad m => a -> m a
return Char
'\BS'
                   Parser Char Char -> String -> Parser Char Char
forall t a. Parser t a -> String -> Parser t a
`wrap` String
"'\\BEL' or '\\BS'"
    mnemonic Char
'C' = do Char
'R' <- Parser Char Char
forall t. Parser t t
next; Char -> Parser Char Char
forall (m :: * -> *) a. Monad m => a -> m a
return Char
'\CR'
                   Parser Char Char -> Parser Char Char -> Parser Char Char
forall t a. Parser t a -> Parser t a -> Parser t a
`onFail`
                   do Char
'A' <- Parser Char Char
forall t. Parser t t
next; Char
'N' <- Parser Char Char
forall t. Parser t t
next; Char -> Parser Char Char
forall (m :: * -> *) a. Monad m => a -> m a
return Char
'\CAN'
                   Parser Char Char -> String -> Parser Char Char
forall t a. Parser t a -> String -> Parser t a
`wrap` String
"'\\CR' or '\\CAN'"
    mnemonic Char
'D' = do Char
'E' <- Parser Char Char
forall t. Parser t t
next; Char
'L' <- Parser Char Char
forall t. Parser t t
next; Char -> Parser Char Char
forall (m :: * -> *) a. Monad m => a -> m a
return Char
'\DEL'
                   Parser Char Char -> Parser Char Char -> Parser Char Char
forall t a. Parser t a -> Parser t a -> Parser t a
`onFail`
                   do Char
'L' <- Parser Char Char
forall t. Parser t t
next; Char
'E' <- Parser Char Char
forall t. Parser t t
next; Char -> Parser Char Char
forall (m :: * -> *) a. Monad m => a -> m a
return Char
'\DLE'
                   Parser Char Char -> Parser Char Char -> Parser Char Char
forall t a. Parser t a -> Parser t a -> Parser t a
`onFail`
                   do Char
'C' <- Parser Char Char
forall t. Parser t t
next; ( do Char
'1' <- Parser Char Char
forall t. Parser t t
next; Char -> Parser Char Char
forall (m :: * -> *) a. Monad m => a -> m a
return Char
'\DC1'
                                     Parser Char Char -> Parser Char Char -> Parser Char Char
forall t a. Parser t a -> Parser t a -> Parser t a
`onFail`
                                     do Char
'2' <- Parser Char Char
forall t. Parser t t
next; Char -> Parser Char Char
forall (m :: * -> *) a. Monad m => a -> m a
return Char
'\DC2'
                                     Parser Char Char -> Parser Char Char -> Parser Char Char
forall t a. Parser t a -> Parser t a -> Parser t a
`onFail`
                                     do Char
'3' <- Parser Char Char
forall t. Parser t t
next; Char -> Parser Char Char
forall (m :: * -> *) a. Monad m => a -> m a
return Char
'\DC3'
                                     Parser Char Char -> Parser Char Char -> Parser Char Char
forall t a. Parser t a -> Parser t a -> Parser t a
`onFail`
                                     do Char
'4' <- Parser Char Char
forall t. Parser t t
next; Char -> Parser Char Char
forall (m :: * -> *) a. Monad m => a -> m a
return Char
'\DC4' )
                   Parser Char Char -> String -> Parser Char Char
forall t a. Parser t a -> String -> Parser t a
`wrap` String
"'\\DEL' or '\\DLE' or '\\DC[1..4]'"
    mnemonic Char
'E' = do Char
'T' <- Parser Char Char
forall t. Parser t t
next; Char
'X' <- Parser Char Char
forall t. Parser t t
next; Char -> Parser Char Char
forall (m :: * -> *) a. Monad m => a -> m a
return Char
'\ETX'
                   Parser Char Char -> Parser Char Char -> Parser Char Char
forall t a. Parser t a -> Parser t a -> Parser t a
`onFail`
                   do Char
'O' <- Parser Char Char
forall t. Parser t t
next; Char
'T' <- Parser Char Char
forall t. Parser t t
next; Char -> Parser Char Char
forall (m :: * -> *) a. Monad m => a -> m a
return Char
'\EOT'
                   Parser Char Char -> Parser Char Char -> Parser Char Char
forall t a. Parser t a -> Parser t a -> Parser t a
`onFail`
                   do Char
'N' <- Parser Char Char
forall t. Parser t t
next; Char
'Q' <- Parser Char Char
forall t. Parser t t
next; Char -> Parser Char Char
forall (m :: * -> *) a. Monad m => a -> m a
return Char
'\ENQ'
                   Parser Char Char -> Parser Char Char -> Parser Char Char
forall t a. Parser t a -> Parser t a -> Parser t a
`onFail`
                   do Char
'T' <- Parser Char Char
forall t. Parser t t
next; Char
'B' <- Parser Char Char
forall t. Parser t t
next; Char -> Parser Char Char
forall (m :: * -> *) a. Monad m => a -> m a
return Char
'\ETB'
                   Parser Char Char -> Parser Char Char -> Parser Char Char
forall t a. Parser t a -> Parser t a -> Parser t a
`onFail`
                   do Char
'M' <- Parser Char Char
forall t. Parser t t
next; Char -> Parser Char Char
forall (m :: * -> *) a. Monad m => a -> m a
return Char
'\EM'
                   Parser Char Char -> Parser Char Char -> Parser Char Char
forall t a. Parser t a -> Parser t a -> Parser t a
`onFail`
                   do Char
'S' <- Parser Char Char
forall t. Parser t t
next; Char
'C' <- Parser Char Char
forall t. Parser t t
next; Char -> Parser Char Char
forall (m :: * -> *) a. Monad m => a -> m a
return Char
'\ESC'
                   Parser Char Char -> String -> Parser Char Char
forall t a. Parser t a -> String -> Parser t a
`wrap` String
"one of '\\ETX' '\\EOT' '\\ENQ' '\\ETB' '\\EM' or '\\ESC'"
    mnemonic Char
'F' = do Char
'F' <- Parser Char Char
forall t. Parser t t
next; Char -> Parser Char Char
forall (m :: * -> *) a. Monad m => a -> m a
return Char
'\FF'
                   Parser Char Char -> Parser Char Char -> Parser Char Char
forall t a. Parser t a -> Parser t a -> Parser t a
`onFail`
                   do Char
'S' <- Parser Char Char
forall t. Parser t t
next; Char -> Parser Char Char
forall (m :: * -> *) a. Monad m => a -> m a
return Char
'\FS'
                   Parser Char Char -> String -> Parser Char Char
forall t a. Parser t a -> String -> Parser t a
`wrap` String
"'\\FF' or '\\FS'"
    mnemonic Char
'G' = do Char
'S' <- Parser Char Char
forall t. Parser t t
next; Char -> Parser Char Char
forall (m :: * -> *) a. Monad m => a -> m a
return Char
'\GS'
                   Parser Char Char -> String -> Parser Char Char
forall t a. Parser t a -> String -> Parser t a
`wrap` String
"'\\GS'"
    mnemonic Char
'H' = do Char
'T' <- Parser Char Char
forall t. Parser t t
next; Char -> Parser Char Char
forall (m :: * -> *) a. Monad m => a -> m a
return Char
'\HT'
                   Parser Char Char -> String -> Parser Char Char
forall t a. Parser t a -> String -> Parser t a
`wrap` String
"'\\HT'"
    mnemonic Char
'L' = do Char
'F' <- Parser Char Char
forall t. Parser t t
next; Char -> Parser Char Char
forall (m :: * -> *) a. Monad m => a -> m a
return Char
'\LF'
                   Parser Char Char -> String -> Parser Char Char
forall t a. Parser t a -> String -> Parser t a
`wrap` String
"'\\LF'"
    mnemonic Char
'N' = do Char
'U' <- Parser Char Char
forall t. Parser t t
next; Char
'L' <- Parser Char Char
forall t. Parser t t
next; Char -> Parser Char Char
forall (m :: * -> *) a. Monad m => a -> m a
return Char
'\NUL'
                   Parser Char Char -> Parser Char Char -> Parser Char Char
forall t a. Parser t a -> Parser t a -> Parser t a
`onFail`
                   do Char
'A' <- Parser Char Char
forall t. Parser t t
next; Char
'K' <- Parser Char Char
forall t. Parser t t
next; Char -> Parser Char Char
forall (m :: * -> *) a. Monad m => a -> m a
return Char
'\NAK'
                   Parser Char Char -> String -> Parser Char Char
forall t a. Parser t a -> String -> Parser t a
`wrap` String
"'\\NUL' or '\\NAK'"
    mnemonic Char
'R' = do Char
'S' <- Parser Char Char
forall t. Parser t t
next; Char -> Parser Char Char
forall (m :: * -> *) a. Monad m => a -> m a
return Char
'\RS'
                   Parser Char Char -> String -> Parser Char Char
forall t a. Parser t a -> String -> Parser t a
`wrap` String
"'\\RS'"
    mnemonic Char
'S' = do Char
'O' <- Parser Char Char
forall t. Parser t t
next; Char
'H' <- Parser Char Char
forall t. Parser t t
next; Char -> Parser Char Char
forall (m :: * -> *) a. Monad m => a -> m a
return Char
'\SOH'
                   Parser Char Char -> Parser Char Char -> Parser Char Char
forall t a. Parser t a -> Parser t a -> Parser t a
`onFail`
                   do Char
'O' <- Parser Char Char
forall t. Parser t t
next; Char -> Parser Char Char
forall (m :: * -> *) a. Monad m => a -> m a
return Char
'\SO'
                   Parser Char Char -> Parser Char Char -> Parser Char Char
forall t a. Parser t a -> Parser t a -> Parser t a
`onFail`
                   do Char
'T' <- Parser Char Char
forall t. Parser t t
next; Char
'X' <- Parser Char Char
forall t. Parser t t
next; Char -> Parser Char Char
forall (m :: * -> *) a. Monad m => a -> m a
return Char
'\STX'
                   Parser Char Char -> Parser Char Char -> Parser Char Char
forall t a. Parser t a -> Parser t a -> Parser t a
`onFail`
                   do Char
'I' <- Parser Char Char
forall t. Parser t t
next; Char -> Parser Char Char
forall (m :: * -> *) a. Monad m => a -> m a
return Char
'\SI'
                   Parser Char Char -> Parser Char Char -> Parser Char Char
forall t a. Parser t a -> Parser t a -> Parser t a
`onFail`
                   do Char
'Y' <- Parser Char Char
forall t. Parser t t
next; Char
'N' <- Parser Char Char
forall t. Parser t t
next; Char -> Parser Char Char
forall (m :: * -> *) a. Monad m => a -> m a
return Char
'\SYN'
                   Parser Char Char -> Parser Char Char -> Parser Char Char
forall t a. Parser t a -> Parser t a -> Parser t a
`onFail`
                   do Char
'U' <- Parser Char Char
forall t. Parser t t
next; Char
'B' <- Parser Char Char
forall t. Parser t t
next; Char -> Parser Char Char
forall (m :: * -> *) a. Monad m => a -> m a
return Char
'\SUB'
                   Parser Char Char -> Parser Char Char -> Parser Char Char
forall t a. Parser t a -> Parser t a -> Parser t a
`onFail`
                   do Char
'P' <- Parser Char Char
forall t. Parser t t
next; Char -> Parser Char Char
forall (m :: * -> *) a. Monad m => a -> m a
return Char
'\SP'
                   Parser Char Char -> String -> Parser Char Char
forall t a. Parser t a -> String -> Parser t a
`wrap` String
"'\\SOH' '\\SO' '\\STX' '\\SI' '\\SYN' '\\SUB' or '\\SP'"
    mnemonic Char
'U' = do Char
'S' <- Parser Char Char
forall t. Parser t t
next; Char -> Parser Char Char
forall (m :: * -> *) a. Monad m => a -> m a
return Char
'\US'
                   Parser Char Char -> String -> Parser Char Char
forall t a. Parser t a -> String -> Parser t a
`wrap` String
"'\\US'"
    mnemonic Char
'V' = do Char
'T' <- Parser Char Char
forall t. Parser t t
next; Char -> Parser Char Char
forall (m :: * -> *) a. Monad m => a -> m a
return Char
'\VT'
                   Parser Char Char -> String -> Parser Char Char
forall t a. Parser t a -> String -> Parser t a
`wrap` String
"'\\VT'"
    wrap :: Parser t a -> String -> Parser t a
wrap Parser t a
p String
s = Parser t a
p Parser t a -> Parser t a -> Parser t a
forall t a. Parser t a -> Parser t a -> Parser t a
`onFail` String -> Parser t a
forall (m :: * -> *) a. MonadFail m => String -> m a
fail (String
"expected literal char "String -> String -> String
forall a. [a] -> [a] -> [a]
++String
s)

-- Basic types
instance Parse Int where
 -- parse = parseByRead "Int"	-- convert from Integer, deals with minInt
    parse :: Parser Char Int
parse = (Integer -> Int) -> Parser Char Integer -> Parser Char Int
forall (f :: * -> *) a b. Functor f => (a -> b) -> f a -> f b
fmap Integer -> Int
forall a. Num a => Integer -> a
fromInteger (Parser Char Integer -> Parser Char Int)
-> Parser Char Integer -> Parser Char Int
forall a b. (a -> b) -> a -> b
$
              do Parser Char Char -> TextParser String
forall (f :: * -> *) a. Alternative f => f a -> f [a]
many ((Char -> Bool) -> Parser Char Char
forall t. (t -> Bool) -> Parser t t
satisfy Char -> Bool
isSpace); Parser Char Integer -> Parser Char Integer
forall a. Real a => TextParser a -> TextParser a
parseSigned Parser Char Integer
forall a. Integral a => TextParser a
parseDec
instance Parse Integer where
 -- parse = parseByRead "Integer"
    parse :: Parser Char Integer
parse = do Parser Char Char -> TextParser String
forall (f :: * -> *) a. Alternative f => f a -> f [a]
many ((Char -> Bool) -> Parser Char Char
forall t. (t -> Bool) -> Parser t t
satisfy Char -> Bool
isSpace); Parser Char Integer -> Parser Char Integer
forall a. Real a => TextParser a -> TextParser a
parseSigned Parser Char Integer
forall a. Integral a => TextParser a
parseDec
instance Parse Float where
 -- parse = parseByRead "Float"
    parse :: TextParser Float
parse = do Parser Char Char -> TextParser String
forall (f :: * -> *) a. Alternative f => f a -> f [a]
many ((Char -> Bool) -> Parser Char Char
forall t. (t -> Bool) -> Parser t t
satisfy Char -> Bool
isSpace); TextParser Float -> TextParser Float
forall a. Real a => TextParser a -> TextParser a
parseSigned TextParser Float
forall a. RealFrac a => TextParser a
parseFloat
instance Parse Double where
 -- parse = parseByRead "Double"
    parse :: TextParser Double
parse = do Parser Char Char -> TextParser String
forall (f :: * -> *) a. Alternative f => f a -> f [a]
many ((Char -> Bool) -> Parser Char Char
forall t. (t -> Bool) -> Parser t t
satisfy Char -> Bool
isSpace); TextParser Double -> TextParser Double
forall a. Real a => TextParser a -> TextParser a
parseSigned TextParser Double
forall a. RealFrac a => TextParser a
parseFloat
instance Parse Char where
--  parse = parseByRead "Char"
    parse :: Parser Char Char
parse = do Parser Char Char -> TextParser String
forall (f :: * -> *) a. Alternative f => f a -> f [a]
many ((Char -> Bool) -> Parser Char Char
forall t. (t -> Bool) -> Parser t t
satisfy Char -> Bool
isSpace); Parser Char Char
parseLitChar'
 -- parse = do { w <- word; if head w == '\'' then readLitChar (tail w)
 --                                           else fail "expected a char" }
 -- parseList = bracket (isWord "\"") (satisfy (=='"'))
 --                     (many (satisfy (/='"')))
	-- not totally correct for strings...
    parseList :: TextParser String
parseList = do { String
w <- TextParser String
word; if String -> Char
forall a. [a] -> a
head String
w Char -> Char -> Bool
forall a. Eq a => a -> a -> Bool
== Char
'"' then String -> TextParser String
forall (m :: * -> *) a. Monad m => a -> m a
return (String -> String
forall a. [a] -> [a]
init (String -> String
forall a. [a] -> [a]
tail String
w))
                                else String -> TextParser String
forall (m :: * -> *) a. MonadFail m => String -> m a
fail String
"not a string" }

instance Parse Bool where
    parse :: TextParser Bool
parse = String -> [Bool] -> TextParser Bool
forall a. Show a => String -> [a] -> TextParser a
enumeration String
"Bool" [Bool
False,Bool
True]

instance Parse Ordering where
    parse :: TextParser Ordering
parse = String -> [Ordering] -> TextParser Ordering
forall a. Show a => String -> [a] -> TextParser a
enumeration String
"Ordering" [Ordering
LT,Ordering
EQ,Ordering
GT]

-- Structural types
instance Parse () where
    parse :: Parser Char ()
parse = (String -> Result String ()) -> Parser Char ()
forall t a. ([t] -> Result [t] a) -> Parser t a
P String -> Result String ()
p
      where p :: String -> Result String ()
p []       = String -> String -> Result String ()
forall z a. z -> String -> Result z a
Failure [] String
"no input: expected a ()"
            p (Char
'(':String
cs) = case (Char -> Bool) -> String -> String
forall a. (a -> Bool) -> [a] -> [a]
dropWhile Char -> Bool
isSpace String
cs of
                             (Char
')':String
s) -> String -> () -> Result String ()
forall z a. z -> a -> Result z a
Success String
s ()
                             String
_       -> String -> String -> Result String ()
forall z a. z -> String -> Result z a
Failure String
cs String
"Expected ) after ("
            p (Char
c:String
cs) | Char -> Bool
isSpace Char
c = String -> Result String ()
p String
cs
                     | Bool
otherwise = String -> String -> Result String ()
forall z a. z -> String -> Result z a
Failure (Char
cChar -> String -> String
forall a. a -> [a] -> [a]
:String
cs) (String
"Expected a (), got "String -> String -> String
forall a. [a] -> [a] -> [a]
++Char -> String
forall a. Show a => a -> String
show Char
c)

instance (Parse a, Parse b) => Parse (a,b) where
    parse :: TextParser (a, b)
parse = do{ String -> TextParser String
isWord String
"(" TextParser String -> (String -> String) -> TextParser String
forall (p :: * -> *) a.
Commitment p =>
p a -> (String -> String) -> p a
`adjustErr` (String
"Opening a 2-tuple\n"String -> String -> String
forall a. [a] -> [a] -> [a]
++)
              ; a
x <- TextParser a
forall a. Parse a => TextParser a
parse TextParser a -> (String -> String) -> TextParser a
forall (p :: * -> *) a.
Commitment p =>
p a -> (String -> String) -> p a
`adjustErr` (String
"In 1st item of a 2-tuple\n"String -> String -> String
forall a. [a] -> [a] -> [a]
++)
              ; String -> TextParser String
isWord String
"," TextParser String -> (String -> String) -> TextParser String
forall (p :: * -> *) a.
Commitment p =>
p a -> (String -> String) -> p a
`adjustErr` (String
"Separating a 2-tuple\n"String -> String -> String
forall a. [a] -> [a] -> [a]
++)
              ; b
y <- TextParser b
forall a. Parse a => TextParser a
parse TextParser b -> (String -> String) -> TextParser b
forall (p :: * -> *) a.
Commitment p =>
p a -> (String -> String) -> p a
`adjustErr` (String
"In 2nd item of a 2-tuple\n"String -> String -> String
forall a. [a] -> [a] -> [a]
++)
              ; String -> TextParser String
isWord String
")" TextParser String -> (String -> String) -> TextParser String
forall (p :: * -> *) a.
Commitment p =>
p a -> (String -> String) -> p a
`adjustErr` (String
"Closing a 2-tuple\n"String -> String -> String
forall a. [a] -> [a] -> [a]
++)
              ; (a, b) -> TextParser (a, b)
forall (m :: * -> *) a. Monad m => a -> m a
return (a
x,b
y) }

instance (Parse a, Parse b, Parse c) => Parse (a,b,c) where
    parse :: TextParser (a, b, c)
parse = do{ String -> TextParser String
isWord String
"(" TextParser String -> (String -> String) -> TextParser String
forall (p :: * -> *) a.
Commitment p =>
p a -> (String -> String) -> p a
`adjustErr` (String
"Opening a 3-tuple\n"String -> String -> String
forall a. [a] -> [a] -> [a]
++)
              ; a
x <- TextParser a
forall a. Parse a => TextParser a
parse TextParser a -> (String -> String) -> TextParser a
forall (p :: * -> *) a.
Commitment p =>
p a -> (String -> String) -> p a
`adjustErr` (String
"In 1st item of a 3-tuple\n"String -> String -> String
forall a. [a] -> [a] -> [a]
++)
              ; String -> TextParser String
isWord String
"," TextParser String -> (String -> String) -> TextParser String
forall (p :: * -> *) a.
Commitment p =>
p a -> (String -> String) -> p a
`adjustErr` (String
"Separating(1) a 3-tuple\n"String -> String -> String
forall a. [a] -> [a] -> [a]
++)
              ; b
y <- TextParser b
forall a. Parse a => TextParser a
parse TextParser b -> (String -> String) -> TextParser b
forall (p :: * -> *) a.
Commitment p =>
p a -> (String -> String) -> p a
`adjustErr` (String
"In 2nd item of a 3-tuple\n"String -> String -> String
forall a. [a] -> [a] -> [a]
++)
              ; String -> TextParser String
isWord String
"," TextParser String -> (String -> String) -> TextParser String
forall (p :: * -> *) a.
Commitment p =>
p a -> (String -> String) -> p a
`adjustErr` (String
"Separating(2) a 3-tuple\n"String -> String -> String
forall a. [a] -> [a] -> [a]
++)
              ; c
z <- TextParser c
forall a. Parse a => TextParser a
parse TextParser c -> (String -> String) -> TextParser c
forall (p :: * -> *) a.
Commitment p =>
p a -> (String -> String) -> p a
`adjustErr` (String
"In 3rd item of a 3-tuple\n"String -> String -> String
forall a. [a] -> [a] -> [a]
++)
              ; String -> TextParser String
isWord String
")" TextParser String -> (String -> String) -> TextParser String
forall (p :: * -> *) a.
Commitment p =>
p a -> (String -> String) -> p a
`adjustErr` (String
"Closing a 3-tuple\n"String -> String -> String
forall a. [a] -> [a] -> [a]
++)
              ; (a, b, c) -> TextParser (a, b, c)
forall (m :: * -> *) a. Monad m => a -> m a
return (a
x,b
y,c
z) }

instance Parse a => Parse (Maybe a) where
    parsePrec :: Int -> TextParser (Maybe a)
parsePrec Int
p =
            TextParser (Maybe a) -> TextParser (Maybe a)
forall a. TextParser a -> TextParser a
optionalParens (do { String -> TextParser String
isWord String
"Nothing"; Maybe a -> TextParser (Maybe a)
forall (m :: * -> *) a. Monad m => a -> m a
return Maybe a
forall a. Maybe a
Nothing })
            TextParser (Maybe a)
-> TextParser (Maybe a) -> TextParser (Maybe a)
forall t a. Parser t a -> Parser t a -> Parser t a
`onFail`
            Bool -> TextParser (Maybe a) -> TextParser (Maybe a)
forall a. Bool -> TextParser a -> TextParser a
parens (Int
pInt -> Int -> Bool
forall a. Ord a => a -> a -> Bool
>Int
9)   (do { String -> TextParser String
isWord String
"Just"
                               ; (a -> Maybe a) -> Parser Char a -> TextParser (Maybe a)
forall (f :: * -> *) a b. Functor f => (a -> b) -> f a -> f b
fmap a -> Maybe a
forall a. a -> Maybe a
Just (Parser Char a -> TextParser (Maybe a))
-> Parser Char a -> TextParser (Maybe a)
forall a b. (a -> b) -> a -> b
$ Int -> Parser Char a
forall a. Parse a => Int -> TextParser a
parsePrec Int
10
                                     Parser Char a -> (String -> String) -> Parser Char a
forall (p :: * -> *) a.
PolyParse p =>
p a -> (String -> String) -> p a
`adjustErrBad` (String
"but within Just, "String -> String -> String
forall a. [a] -> [a] -> [a]
++) })
            TextParser (Maybe a) -> (String -> String) -> TextParser (Maybe a)
forall (p :: * -> *) a.
Commitment p =>
p a -> (String -> String) -> p a
`adjustErr` ((String
"expected a Maybe (Just or Nothing)\n"String -> String -> String
forall a. [a] -> [a] -> [a]
++)(String -> String) -> (String -> String) -> String -> String
forall b c a. (b -> c) -> (a -> b) -> a -> c
.Int -> String -> String
indent Int
2)

instance (Parse a, Parse b) => Parse (Either a b) where
    parsePrec :: Int -> TextParser (Either a b)
parsePrec Int
p =
            Bool -> TextParser (Either a b) -> TextParser (Either a b)
forall a. Bool -> TextParser a -> TextParser a
parens (Int
pInt -> Int -> Bool
forall a. Ord a => a -> a -> Bool
>Int
9) (TextParser (Either a b) -> TextParser (Either a b))
-> TextParser (Either a b) -> TextParser (Either a b)
forall a b. (a -> b) -> a -> b
$
            [(String, TextParser (Either a b))] -> TextParser (Either a b)
forall a. [(String, TextParser a)] -> TextParser a
constructors [ (String
"Left",  do { (a -> Either a b) -> Parser Char a -> TextParser (Either a b)
forall (f :: * -> *) a b. Functor f => (a -> b) -> f a -> f b
fmap a -> Either a b
forall a b. a -> Either a b
Left  (Parser Char a -> TextParser (Either a b))
-> Parser Char a -> TextParser (Either a b)
forall a b. (a -> b) -> a -> b
$ Int -> Parser Char a
forall a. Parse a => Int -> TextParser a
parsePrec Int
10 } )
                         , (String
"Right", do { (b -> Either a b) -> Parser Char b -> TextParser (Either a b)
forall (f :: * -> *) a b. Functor f => (a -> b) -> f a -> f b
fmap b -> Either a b
forall a b. b -> Either a b
Right (Parser Char b -> TextParser (Either a b))
-> Parser Char b -> TextParser (Either a b)
forall a b. (a -> b) -> a -> b
$ Int -> Parser Char b
forall a. Parse a => Int -> TextParser a
parsePrec Int
10 } )
                         ]

instance Parse a => Parse [a] where
    parse :: TextParser [a]
parse = TextParser [a]
forall a. Parse a => TextParser [a]
parseList

-- | Simply return the entire remaining input String.
allAsString :: TextParser String
allAsString :: TextParser String
allAsString =  (String -> Result String String) -> TextParser String
forall t a. ([t] -> Result [t] a) -> Parser t a
P (\String
s-> String -> String -> Result String String
forall z a. z -> a -> Result z a
Success [] String
s)

------------------------------------------------------------------------