úÎ=|;$      !"#-non-portable (local universal quantification) provisionalgracjanpolak@gmail.com-$%&'()*A parser for a type a), represented as a function that takes a  +* and returns a list of possible parses as (a,+) pairs. @Note that this kind of backtracking parser is very inefficient; 1 reading a large structure may be quite slow (cf ). ,-)Consumes and returns the next character. $ Fails if there is no input left. @Look-ahead: returns the part of the input that is left, without  consuming it. Always fails. Symmetric choice. 5Local, exclusive, left-biased choice: If left parser < locally produces any result at all, then right parser is  not used. 5Transforms a parser into one that does the same, but 2 in addition returns the exact characters read.  IMPORTANT NOTE: - gives a runtime error if its first argument 1 is built using any occurrences of readS_to_P. 5Transforms a parser into one that does the same, but < in addition returns the exact number of characters read.  IMPORTANT NOTE:  - gives a runtime error if its first argument 1 is built using any occurrences of readS_to_P. =Consumes and returns the next character, if it satisfies the  specified predicate. ,Parses and returns the specified character. )Parses and returns the specified string. CParses the first zero or more characters satisfying the predicate. BParses the first one or more characters satisfying the predicate. ,Combines all parsers in the specified list. Skips all whitespace.  count n p parses n occurrences of p in sequence. A list of  results is returned. between open close p parses open, followed by p and finally  close. Only the value of p is returned.  option x p will either parse p or return x without consuming  any input.  optional p optionally parses p and always returns (). 5Parses zero or more occurrences of the given parser. 4Parses one or more occurrences of the given parser. Like , but discards the result. Like , but discards the result.  sepBy p sep$ parses zero or more occurrences of p, separated by sep. ( Returns a list of values returned by p.  sepBy1 p sep# parses one or more occurrences of p, separated by sep. ( Returns a list of values returned by p.  endBy p sep$ parses zero or more occurrences of p, separated and ended  by sep.  endBy p sep# parses one or more occurrences of p, separated and ended  by sep.  chainr p op x$ parses zero or more occurrences of p, separated by op. ! Returns a value produced by a right associative application of all  functions returned by op!. If there are no occurrences of p, x is  returned.  chainl p op x$ parses zero or more occurrences of p, separated by op. ! Returns a value produced by a left associative application of all  functions returned by op!. If there are no occurrences of p, x is  returned. Like (, but parses one or more occurrences of p. Like (, but parses one or more occurrences of p. !manyTill p end$ parses zero or more occurrences of p, until end 2 succeeds. Returns a list of values returned by p. "7Converts a parser into a Haskell ReadS-style function. ) This is the main way in which you can "run" a  parser:  the expanded type is  7 readP_to_S :: ReadP a -> ByteString -> [(a,ByteString)]  #7Converts a Haskell ReadS-style function into a parser. @ Warning: This introduces local backtracking in the resulting 2 parser, and therefore a possible inefficiency. $  !"#$    !"#$  !"#.      !"#$%&'()*+,-./012bytestringreadp-0.1'Text.ParserCombinators.ReadP.ByteStringReadPReadSskipgetlookpfail+++<++gathercountsymsatisfycharstringmunchmunch1choice skipSpacescountbetweenoptionoptionalmanymany1skipMany skipMany1sepBysepBy1endByendBy1chainrchainlchainr1chainl1manyTill readP_to_S readS_to_PRPFinalResultFailLookSkipbytestring-0.9.1.7Data.ByteString.Internal ByteStringfinalrun