Plan 9 from Bell Labs’s /usr/web/sources/contrib/fernan/nhc98/include/packages/polyparse/Text/Parse.hi

Copyright © 2021 Plan 9 Foundation.
Distributed under the MIT License.
Download the Plan 9 distribution.


interface Text.Parse where {
infixl  3 `Text.ParserCombinators.Poly.apply`;
infixl  3 `Text.ParserCombinators.Poly.discard`;
infixl  6 `Text.ParserCombinators.Poly.onFail`;

{-# NEED #-}
instance (Parse a,Parse b,Parse c) => Parse (a,b,c);

{-# NEED #-}
instance Parse Prelude.Ordering;

{-# NEED #-}
instance Parse Prelude.Integer;

{-# NEED #-}
instance Parse Prelude.Float;

{-# NEED #-}
instance Parse Prelude.Double;

{-# NEED #-}
instance (Parse a,Parse b) => Parse (Prelude.Either a b);

{-# NEED #-}
instance (Parse a,Parse b) => Parse (a,b);

{-# NEED #-}
instance (Parse a) => Parse (Prelude.Maybe a);

{-# NEED #-}
instance Parse Prelude.Int;

{-# NEED #-}
instance Parse ();

{-# NEED #-}
instance (Parse a) => Parse [a];

{-# NEED #-}
instance Parse Prelude.Bool;

{-# NEED #-}
instance Parse Prelude.Char;

{-# NEED #-}
instance Prelude.Monad (Text.ParserCombinators.Poly.Parser a);

{-# NEED #-}
instance Prelude.Monad NHC.Internal.IO;

{-# NEED #-}
instance Prelude.Functor (Text.ParserCombinators.Poly.Parser a);

{-# NEED #-}
instance Prelude.Functor NHC.Internal.IO;

{-# NEED #-}
instance (Prelude.Integral a) => Prelude.Fractional (Ratio.Ratio a);

{-# NEED #-}
instance (Prelude.Integral a) => Prelude.Num (Ratio.Ratio a);

{-# NEED #-}
instance (Prelude.Integral a) => Prelude.Real (Ratio.Ratio a);

{-# NEED #-}
instance (Prelude.Integral a) => Prelude.RealFrac (Ratio.Ratio a);

{-# NEED #-}
instance (Prelude.Integral a) => Prelude.Enum (Ratio.Ratio a);

{-# NEED #-}
instance (Prelude.Read a,Prelude.Integral a) => Prelude.Read (Ratio.Ratio a);

{-# NEED #-}
instance (Prelude.Integral a) => Prelude.Eq (Ratio.Ratio a);

{-# NEED #-}
instance (Prelude.Integral a) => Prelude.Ord (Ratio.Ratio a);

{-# NEED #-}
instance (Prelude.Show a) => Prelude.Show (NHC.Internal.IO a);

{-# NEED #-}
instance (Prelude.Integral a) => Prelude.Show (Ratio.Ratio a);
interface NHC.Internal
{-# NEED IO #-}
newtype {-#  #-} IO a;

{-# NEED World #-}
data World;
interface Ratio
{-# NEED Ratio #-}
data Ratio a;
interface ! Text.Parse
{-# NEED enumeration #-}
enumeration{-# 2 #-}::(Prelude.Show a) => (Prelude.String -> ([a] -> (TextParser a)));

{-# NEED constructors #-}
constructors{-# 1 #-}::([(Prelude.String,(TextParser a))] -> (TextParser a));

{-# NEED field #-}
field{-# 1 #-}::(Parse a) => (Prelude.String -> (TextParser a));

{-# NEED optionalParens #-}
optionalParens{-# 1 #-}::((TextParser a) -> (TextParser a));

{-# NEED isWord #-}
isWord{-# 1 #-}::(Prelude.String -> (TextParser Prelude.String));

{-# NEED word #-}
word{-# 0 #-}::(TextParser Prelude.String);

{-# NEED parseByRead #-}
parseByRead{-# 1 #-}::(Prelude.Read a) => (Prelude.String -> (TextParser a));

{-# NEED {Parse parseList parse} #-}
class Parse a where {
  parseList{-# 0 #-}::(TextParser [a]);
  parse{-# 0 #-}::(TextParser a);
};

{-# NEED TextParser #-}
type {-# 1 #-} TextParser a = (Text.ParserCombinators.Poly.Parser Prelude.Char a);
interface ! Text.ParserCombinators.Poly
{-# NEED runParser #-}
runParser{-# 1 #-}::((Text.ParserCombinators.Poly.Parser a b) -> ([a] -> ((Prelude.Either Prelude.String b),[a])));

{-# NEED failBad #-}
failBad{-# 1 #-}::(Prelude.String -> (Text.ParserCombinators.Poly.Parser a b));

{-# NEED commit #-}
commit{-# 1 #-}::((Text.ParserCombinators.Poly.Parser a b) -> (Text.ParserCombinators.Poly.Parser a b));

{-# NEED next #-}
next{-# 0 #-}::(Text.ParserCombinators.Poly.Parser a a);

{-# NEED satisfy #-}
satisfy{-# 1 #-}::((a -> Prelude.Bool) -> (Text.ParserCombinators.Poly.Parser a a));

{-# NEED apply #-}
apply{-# 2 #-}::((Text.ParserCombinators.Poly.Parser a (b -> c)) -> ((Text.ParserCombinators.Poly.Parser a b) -> (Text.ParserCombinators.Poly.Parser a c)));

{-# NEED discard #-}
discard{-# 2 #-}::((Text.ParserCombinators.Poly.Parser a b) -> ((Text.ParserCombinators.Poly.Parser a c) -> (Text.ParserCombinators.Poly.Parser a b)));

{-# NEED adjustErr #-}
adjustErr{-# 2 #-}::((Text.ParserCombinators.Poly.Parser a b) -> ((Prelude.String -> Prelude.String) -> (Text.ParserCombinators.Poly.Parser a b)));

{-# NEED adjustErrBad #-}
adjustErrBad{-# 2 #-}::((Text.ParserCombinators.Poly.Parser a b) -> ((Prelude.String -> Prelude.String) -> (Text.ParserCombinators.Poly.Parser a b)));

{-# NEED onFail #-}
onFail{-# 2 #-}::((Text.ParserCombinators.Poly.Parser a b) -> ((Text.ParserCombinators.Poly.Parser a b) -> (Text.ParserCombinators.Poly.Parser a b)));

{-# NEED oneOf #-}
oneOf{-# 1 #-}::([(Text.ParserCombinators.Poly.Parser a b)] -> (Text.ParserCombinators.Poly.Parser a b));

{-# NEED oneOf' #-}
oneOf'{-# 0 #-}::([(Prelude.String,(Text.ParserCombinators.Poly.Parser a b))] -> (Text.ParserCombinators.Poly.Parser a b));

{-# NEED indent #-}
indent{-# 1 #-}::(Prelude.Int -> (Prelude.String -> Prelude.String));

{-# NEED optional #-}
optional{-# 1 #-}::((Text.ParserCombinators.Poly.Parser a b) -> (Text.ParserCombinators.Poly.Parser a (Prelude.Maybe b)));

{-# NEED exactly #-}
exactly{-# 2 #-}::(Prelude.Int -> ((Text.ParserCombinators.Poly.Parser a b) -> (Text.ParserCombinators.Poly.Parser a [b])));

{-# NEED many #-}
many{-# 1 #-}::((Text.ParserCombinators.Poly.Parser a b) -> (Text.ParserCombinators.Poly.Parser a [b]));

{-# NEED many1 #-}
many1{-# 1 #-}::((Text.ParserCombinators.Poly.Parser a b) -> (Text.ParserCombinators.Poly.Parser a [b]));

{-# NEED sepBy #-}
sepBy{-# 2 #-}::((Text.ParserCombinators.Poly.Parser a b) -> ((Text.ParserCombinators.Poly.Parser a c) -> (Text.ParserCombinators.Poly.Parser a [b])));

{-# NEED sepBy1 #-}
sepBy1{-# 2 #-}::((Text.ParserCombinators.Poly.Parser a b) -> ((Text.ParserCombinators.Poly.Parser a c) -> (Text.ParserCombinators.Poly.Parser a [b])));

{-# NEED bracketSep #-}
bracketSep{-# 4 #-}::((Text.ParserCombinators.Poly.Parser a b) -> ((Text.ParserCombinators.Poly.Parser a c) -> ((Text.ParserCombinators.Poly.Parser a d) -> ((Text.ParserCombinators.Poly.Parser a e) -> (Text.ParserCombinators.Poly.Parser a [e])))));

{-# NEED bracket #-}
bracket{-# 3 #-}::((Text.ParserCombinators.Poly.Parser a b) -> ((Text.ParserCombinators.Poly.Parser a c) -> ((Text.ParserCombinators.Poly.Parser a d) -> (Text.ParserCombinators.Poly.Parser a d))));

{-# NEED manyFinally #-}
manyFinally{-# 2 #-}::((Text.ParserCombinators.Poly.Parser a b) -> ((Text.ParserCombinators.Poly.Parser a c) -> (Text.ParserCombinators.Poly.Parser a [b])));

{-# NEED reparse #-}
reparse{-# 1 #-}::([a] -> (Text.ParserCombinators.Poly.Parser a ()));

{-# NEED {Parser P} #-}
newtype {-#  #-} Parser a b
  = P ([a] -> ((Text.ParserCombinators.Poly.EitherE Prelude.String b),[a]));
interface Text.ParserCombinators.Poly
{-# NEED EitherE #-}
type {-# 1 #-} EitherE a b = (Prelude.Either (Prelude.Bool,a) b);
}

Bell Labs OSI certified Powered by Plan 9

(Return to Plan 9 Home Page)

Copyright © 2021 Plan 9 Foundation. All Rights Reserved.
Comments to webmaster@9p.io.