polyparse-1.4.1: docs/haddock/Text-ParserCombinators-Poly-Base.html
<!DOCTYPE HTML PUBLIC "-//W3C//DTD HTML 4.01 Transitional//EN" "http://www.w3.org/TR/html4/loose.dtd">
<!--Rendered using the Haskell Html Library v0.2-->
<HTML
><HEAD
><META HTTP-EQUIV="Content-Type" CONTENT="text/html; charset=UTF-8"
><TITLE
>Text.ParserCombinators.Poly.Base</TITLE
><LINK HREF="haddock.css" REL="stylesheet" TYPE="text/css"
><SCRIPT SRC="haddock-util.js" TYPE="text/javascript"
></SCRIPT
><SCRIPT TYPE="text/javascript"
>window.onload = function () {setSynopsis("mini_Text-ParserCombinators-Poly-Base.html")};</SCRIPT
></HEAD
><BODY
><TABLE CLASS="vanilla" CELLSPACING="0" CELLPADDING="0"
><TR
><TD CLASS="topbar"
><TABLE CLASS="vanilla" CELLSPACING="0" CELLPADDING="0"
><TR
><TD
><IMG SRC="haskell_icon.gif" WIDTH="16" HEIGHT="16" ALT=" "
></TD
><TD CLASS="title"
>polyparse</TD
><TD CLASS="topbut"
><A HREF="src/Text/ParserCombinators/Poly/Base.html"
>Source code</A
></TD
><TD CLASS="topbut"
><A HREF="index.html"
>Contents</A
></TD
><TD CLASS="topbut"
><A HREF="doc-index.html"
>Index</A
></TD
></TR
></TABLE
></TD
></TR
><TR
><TD CLASS="modulebar"
><TABLE CLASS="vanilla" CELLSPACING="0" CELLPADDING="0"
><TR
><TD
><FONT SIZE="6"
>Text.ParserCombinators.Poly.Base</FONT
></TD
></TR
></TABLE
></TD
></TR
><TR
><TD CLASS="s15"
></TD
></TR
><TR
><TD
><TABLE CLASS="vanilla" CELLSPACING="0" CELLPADDING="0"
><TR
><TD CLASS="section4"
><B
>Contents</B
></TD
></TR
><TR
><TD
><DL
><DT
><A HREF="#1"
>The PolyParse class
</A
></DT
><DT
><A HREF="#2"
>Combinators general to all parser types.
</A
></DT
><DD
><DL
><DT
><A HREF="#3"
>Simple combinators
</A
></DT
><DT
><A HREF="#4"
>Error-handling
</A
></DT
><DT
><A HREF="#5"
>Choices
</A
></DT
><DT
><A HREF="#6"
>Sequences
</A
></DT
></DL
></DD
></DL
></TD
></TR
></TABLE
></TD
></TR
><TR
><TD CLASS="s15"
></TD
></TR
><TR
><TD CLASS="s15"
></TD
></TR
><TR
><TD CLASS="section1"
>Synopsis</TD
></TR
><TR
><TD CLASS="s15"
></TD
></TR
><TR
><TD CLASS="body"
><TABLE CLASS="vanilla" CELLSPACING="0" CELLPADDING="0"
><TR
><TD CLASS="decl"
><SPAN CLASS="keyword"
>class</SPAN
> (Functor p, Monad p) => <A HREF="#t%3APolyParse"
>PolyParse</A
> p <SPAN CLASS="keyword"
>where</SPAN
></TD
></TR
><TR
><TD CLASS="body"
><TABLE CLASS="vanilla" CELLSPACING="0" CELLPADDING="0"
><TR
><TD CLASS="decl"
><A HREF="#v%3Acommit"
>commit</A
> :: p a -> p a</TD
></TR
><TR
><TD CLASS="decl"
><A HREF="#v%3AadjustErr"
>adjustErr</A
> :: p a -> (String -> String) -> p a</TD
></TR
><TR
><TD CLASS="decl"
><A HREF="#v%3AonFail"
>onFail</A
> :: p a -> p a -> p a</TD
></TR
><TR
><TD CLASS="decl"
><A HREF="#v%3AoneOf%27"
>oneOf'</A
> :: [(String, p a)] -> p a</TD
></TR
><TR
><TD CLASS="decl"
><A HREF="#v%3Aapply"
>apply</A
> :: p (a -> b) -> p a -> p b</TD
></TR
></TABLE
></TD
></TR
><TR
><TD CLASS="s8"
></TD
></TR
><TR
><TD CLASS="decl"
><A HREF="#v%3Adiscard"
>discard</A
> :: <A HREF="Text-ParserCombinators-Poly-Base.html#t%3APolyParse"
>PolyParse</A
> p => p a -> p b -> p a</TD
></TR
><TR
><TD CLASS="s8"
></TD
></TR
><TR
><TD CLASS="decl"
><A HREF="#v%3AfailBad"
>failBad</A
> :: <A HREF="Text-ParserCombinators-Poly-Base.html#t%3APolyParse"
>PolyParse</A
> p => String -> p a</TD
></TR
><TR
><TD CLASS="s8"
></TD
></TR
><TR
><TD CLASS="decl"
><A HREF="#v%3AadjustErrBad"
>adjustErrBad</A
> :: <A HREF="Text-ParserCombinators-Poly-Base.html#t%3APolyParse"
>PolyParse</A
> p => p a -> (String -> String) -> p a</TD
></TR
><TR
><TD CLASS="s8"
></TD
></TR
><TR
><TD CLASS="decl"
><A HREF="#v%3Aindent"
>indent</A
> :: Int -> String -> String</TD
></TR
><TR
><TD CLASS="s8"
></TD
></TR
><TR
><TD CLASS="decl"
><A HREF="#v%3AoneOf"
>oneOf</A
> :: <A HREF="Text-ParserCombinators-Poly-Base.html#t%3APolyParse"
>PolyParse</A
> p => [p a] -> p a</TD
></TR
><TR
><TD CLASS="s8"
></TD
></TR
><TR
><TD CLASS="decl"
><A HREF="#v%3Aoptional"
>optional</A
> :: <A HREF="Text-ParserCombinators-Poly-Base.html#t%3APolyParse"
>PolyParse</A
> p => p a -> p (Maybe a)</TD
></TR
><TR
><TD CLASS="s8"
></TD
></TR
><TR
><TD CLASS="decl"
><A HREF="#v%3Aexactly"
>exactly</A
> :: <A HREF="Text-ParserCombinators-Poly-Base.html#t%3APolyParse"
>PolyParse</A
> p => Int -> p a -> p [a]</TD
></TR
><TR
><TD CLASS="s8"
></TD
></TR
><TR
><TD CLASS="decl"
><A HREF="#v%3Amany"
>many</A
> :: <A HREF="Text-ParserCombinators-Poly-Base.html#t%3APolyParse"
>PolyParse</A
> p => p a -> p [a]</TD
></TR
><TR
><TD CLASS="s8"
></TD
></TR
><TR
><TD CLASS="decl"
><A HREF="#v%3Amany1"
>many1</A
> :: <A HREF="Text-ParserCombinators-Poly-Base.html#t%3APolyParse"
>PolyParse</A
> p => p a -> p [a]</TD
></TR
><TR
><TD CLASS="s8"
></TD
></TR
><TR
><TD CLASS="decl"
><A HREF="#v%3AsepBy"
>sepBy</A
> :: <A HREF="Text-ParserCombinators-Poly-Base.html#t%3APolyParse"
>PolyParse</A
> p => p a -> p sep -> p [a]</TD
></TR
><TR
><TD CLASS="s8"
></TD
></TR
><TR
><TD CLASS="decl"
><A HREF="#v%3AsepBy1"
>sepBy1</A
> :: <A HREF="Text-ParserCombinators-Poly-Base.html#t%3APolyParse"
>PolyParse</A
> p => p a -> p sep -> p [a]</TD
></TR
><TR
><TD CLASS="s8"
></TD
></TR
><TR
><TD CLASS="decl"
><A HREF="#v%3AbracketSep"
>bracketSep</A
> :: <A HREF="Text-ParserCombinators-Poly-Base.html#t%3APolyParse"
>PolyParse</A
> p => p bra -> p sep -> p ket -> p a -> p [a]</TD
></TR
><TR
><TD CLASS="s8"
></TD
></TR
><TR
><TD CLASS="decl"
><A HREF="#v%3Abracket"
>bracket</A
> :: <A HREF="Text-ParserCombinators-Poly-Base.html#t%3APolyParse"
>PolyParse</A
> p => p bra -> p ket -> p a -> p a</TD
></TR
><TR
><TD CLASS="s8"
></TD
></TR
><TR
><TD CLASS="decl"
><A HREF="#v%3AmanyFinally"
>manyFinally</A
> :: <A HREF="Text-ParserCombinators-Poly-Base.html#t%3APolyParse"
>PolyParse</A
> p => p a -> p z -> p [a]</TD
></TR
></TABLE
></TD
></TR
><TR
><TD CLASS="s15"
></TD
></TR
><TR
><TD CLASS="s15"
></TD
></TR
><TR
><TD CLASS="section1"
><A NAME="1"
><A NAME="1"
>The PolyParse class
</A
></A
></TD
></TR
><TR
><TD CLASS="s15"
></TD
></TR
><TR
><TD CLASS="topdecl"
><TABLE CLASS="declbar"
><TR
><TD CLASS="declname"
><SPAN CLASS="keyword"
>class</SPAN
> (Functor p, Monad p) => <A NAME="t:PolyParse"
><A NAME="t%3APolyParse"
></A
></A
><B
>PolyParse</B
> p <SPAN CLASS="keyword"
>where</SPAN
></TD
><TD CLASS="declbut"
><A HREF="src/Text/ParserCombinators/Poly/Base.html#PolyParse"
>Source</A
></TD
></TR
></TABLE
></TD
></TR
><TR
><TD CLASS="body"
><TABLE CLASS="vanilla" CELLSPACING="0" CELLPADDING="0"
><TR
><TD CLASS="ndoc"
><P
>The <TT
>PolyParse</TT
> class is an abstraction over all the current
concrete representations of monadic parser combinators in this
package. The common feature is two-level error-handling.
Some primitives must be implemented specific to each parser type
(e.g. depending on whether the parser has a running state, or
whether it is lazy). But given those primitives, large numbers of
combinators do not depend any further on the internal structure of
the particular parser.
</P
><P
>There are two additional basic combinators that we expect to be implemented
afresh for every concrete type, but which (for technical reasons)
cannot be class methods. They are <TT
>next</TT
> and <TT
>satisfy</TT
>.
</P
></TD
></TR
><TR
><TD CLASS="s8"
></TD
></TR
><TR
><TD CLASS="section4"
>Methods</TD
></TR
><TR
><TD CLASS="body"
><TABLE CLASS="vanilla" CELLSPACING="0" CELLPADDING="0"
><TR
><TD CLASS="topdecl"
><TABLE CLASS="declbar"
><TR
><TD CLASS="declname"
><A NAME="v:commit"
><A NAME="v%3Acommit"
></A
></A
><B
>commit</B
> :: p a -> p a</TD
><TD CLASS="declbut"
><A HREF="src/Text/ParserCombinators/Poly/Base.html#commit"
>Source</A
></TD
></TR
></TABLE
></TD
></TR
><TR
><TD CLASS="doc"
>Commit is a way of raising the severity of any errors found within
its argument. Used in the middle of a parser definition, it means that
any operations prior to commitment fail softly, but after commitment,
they fail hard.
</TD
></TR
><TR
><TD CLASS="s8"
></TD
></TR
><TR
><TD CLASS="topdecl"
><TABLE CLASS="declbar"
><TR
><TD CLASS="declname"
><A NAME="v:adjustErr"
><A NAME="v%3AadjustErr"
></A
></A
><B
>adjustErr</B
> :: p a -> (String -> String) -> p a</TD
><TD CLASS="declbut"
><A HREF="src/Text/ParserCombinators/Poly/Base.html#adjustErr"
>Source</A
></TD
></TR
></TABLE
></TD
></TR
><TR
><TD CLASS="doc"
><TT
>p <TT
><A HREF="Text-ParserCombinators-Poly-Base.html#v%3AadjustErr"
>adjustErr</A
></TT
> f</TT
> applies the transformation <TT
>f</TT
> to any error message
generated in <TT
>p</TT
>, having no effect if <TT
>p</TT
> succeeds.
</TD
></TR
><TR
><TD CLASS="s8"
></TD
></TR
><TR
><TD CLASS="topdecl"
><TABLE CLASS="declbar"
><TR
><TD CLASS="declname"
><A NAME="v:onFail"
><A NAME="v%3AonFail"
></A
></A
><B
>onFail</B
> :: p a -> p a -> p a</TD
><TD CLASS="declbut"
><A HREF="src/Text/ParserCombinators/Poly/Base.html#onFail"
>Source</A
></TD
></TR
></TABLE
></TD
></TR
><TR
><TD CLASS="doc"
><TT
>p <TT
><A HREF="Text-ParserCombinators-Poly-Base.html#v%3AonFail"
>onFail</A
></TT
> q</TT
> means parse p, unless p fails, in which case
parse q instead.
Can be chained together to give multiple attempts to parse something.
(Note that q could itself be a failing parser, e.g. to change the error
message from that defined in p to something different.)
However, a severe failure in p cannot be ignored.
</TD
></TR
><TR
><TD CLASS="s8"
></TD
></TR
><TR
><TD CLASS="topdecl"
><TABLE CLASS="declbar"
><TR
><TD CLASS="declname"
><A NAME="v:oneOf'"
><A NAME="v%3AoneOf%27"
></A
></A
><B
>oneOf'</B
> :: [(String, p a)] -> p a</TD
><TD CLASS="declbut"
><A HREF="src/Text/ParserCombinators/Poly/Base.html#oneOf%27"
>Source</A
></TD
></TR
></TABLE
></TD
></TR
><TR
><TD CLASS="doc"
>Parse the first alternative that succeeds, but if none succeed,
report only the severe errors, and if none of those, then report
all the soft errors.
</TD
></TR
><TR
><TD CLASS="s8"
></TD
></TR
><TR
><TD CLASS="topdecl"
><TABLE CLASS="declbar"
><TR
><TD CLASS="declname"
><A NAME="v:apply"
><A NAME="v%3Aapply"
></A
></A
><B
>apply</B
> :: p (a -> b) -> p a -> p b</TD
><TD CLASS="declbut"
><A HREF="src/Text/ParserCombinators/Poly/Base.html#apply"
>Source</A
></TD
></TR
></TABLE
></TD
></TR
><TR
><TD CLASS="doc"
>Apply a parsed function to a parsed value.
Rather like ordinary function application lifted into parsers.
</TD
></TR
></TABLE
></TD
></TR
><TR
><TD CLASS="s8"
></TD
></TR
><TR
><TD CLASS="section4"
><IMG SRC="minus.gif" CLASS="coll" ONCLICK="toggle(this,'i:PolyParse')" ALT="show/hide"
> Instances</TD
></TR
><TR
><TD CLASS="body"
><DIV ID="i:PolyParse" STYLE="display:block;"
><TABLE CLASS="vanilla" CELLSPACING="1" CELLPADDING="0"
><TR
><TD CLASS="decl"
><A HREF="Text-ParserCombinators-Poly-Base.html#t%3APolyParse"
>PolyParse</A
> <A HREF="Text-ParserCombinators-Poly-ByteString.html#t%3AParser"
>Parser</A
></TD
></TR
><TR
><TD CLASS="decl"
><A HREF="Text-ParserCombinators-Poly-Base.html#t%3APolyParse"
>PolyParse</A
> (<A HREF="Text-ParserCombinators-Poly-Plain.html#t%3AParser"
>Parser</A
> t)</TD
></TR
><TR
><TD CLASS="decl"
><A HREF="Text-ParserCombinators-Poly-Base.html#t%3APolyParse"
>PolyParse</A
> (<A HREF="Text-ParserCombinators-Poly-Lazy.html#t%3AParser"
>Parser</A
> t)</TD
></TR
><TR
><TD CLASS="decl"
><A HREF="Text-ParserCombinators-Poly-Base.html#t%3APolyParse"
>PolyParse</A
> (<A HREF="Text-ParserCombinators-Poly-State.html#t%3AParser"
>Parser</A
> s t)</TD
></TR
><TR
><TD CLASS="decl"
><A HREF="Text-ParserCombinators-Poly-Base.html#t%3APolyParse"
>PolyParse</A
> (<A HREF="Text-ParserCombinators-Poly-StateLazy.html#t%3AParser"
>Parser</A
> s t)</TD
></TR
></TABLE
></DIV
></TD
></TR
></TABLE
></TD
></TR
><TR
><TD CLASS="s15"
></TD
></TR
><TR
><TD CLASS="section1"
><A NAME="2"
><A NAME="2"
>Combinators general to all parser types.
</A
></A
></TD
></TR
><TR
><TD CLASS="s15"
></TD
></TR
><TR
><TD CLASS="section2"
><A NAME="3"
><A NAME="3"
>Simple combinators
</A
></A
></TD
></TR
><TR
><TD CLASS="s15"
></TD
></TR
><TR
><TD CLASS="topdecl"
><TABLE CLASS="declbar"
><TR
><TD CLASS="declname"
><A NAME="v:discard"
><A NAME="v%3Adiscard"
></A
></A
><B
>discard</B
> :: <A HREF="Text-ParserCombinators-Poly-Base.html#t%3APolyParse"
>PolyParse</A
> p => p a -> p b -> p a</TD
><TD CLASS="declbut"
><A HREF="src/Text/ParserCombinators/Poly/Base.html#discard"
>Source</A
></TD
></TR
></TABLE
></TD
></TR
><TR
><TD CLASS="doc"
><TT
>x <TT
><A HREF="Text-ParserCombinators-Poly-Base.html#v%3Adiscard"
>discard</A
></TT
> y</TT
> parses both x and y, but discards the result of y.
Rather like <TT
>const</TT
> lifted into parsers.
</TD
></TR
><TR
><TD CLASS="s15"
></TD
></TR
><TR
><TD CLASS="section2"
><A NAME="4"
><A NAME="4"
>Error-handling
</A
></A
></TD
></TR
><TR
><TD CLASS="s15"
></TD
></TR
><TR
><TD CLASS="topdecl"
><TABLE CLASS="declbar"
><TR
><TD CLASS="declname"
><A NAME="v:failBad"
><A NAME="v%3AfailBad"
></A
></A
><B
>failBad</B
> :: <A HREF="Text-ParserCombinators-Poly-Base.html#t%3APolyParse"
>PolyParse</A
> p => String -> p a</TD
><TD CLASS="declbut"
><A HREF="src/Text/ParserCombinators/Poly/Base.html#failBad"
>Source</A
></TD
></TR
></TABLE
></TD
></TR
><TR
><TD CLASS="doc"
>When a simple fail is not strong enough, use failBad for emphasis.
An emphasised (severe) error cannot be overridden by choice
operators.
</TD
></TR
><TR
><TD CLASS="s15"
></TD
></TR
><TR
><TD CLASS="topdecl"
><TABLE CLASS="declbar"
><TR
><TD CLASS="declname"
><A NAME="v:adjustErrBad"
><A NAME="v%3AadjustErrBad"
></A
></A
><B
>adjustErrBad</B
> :: <A HREF="Text-ParserCombinators-Poly-Base.html#t%3APolyParse"
>PolyParse</A
> p => p a -> (String -> String) -> p a</TD
><TD CLASS="declbut"
><A HREF="src/Text/ParserCombinators/Poly/Base.html#adjustErrBad"
>Source</A
></TD
></TR
></TABLE
></TD
></TR
><TR
><TD CLASS="doc"
><TT
>adjustErrBad</TT
> is just like <TT
>adjustErr</TT
> except it also raises the
severity of the error.
</TD
></TR
><TR
><TD CLASS="s15"
></TD
></TR
><TR
><TD CLASS="topdecl"
><TABLE CLASS="declbar"
><TR
><TD CLASS="declname"
><A NAME="v:indent"
><A NAME="v%3Aindent"
></A
></A
><B
>indent</B
> :: Int -> String -> String</TD
><TD CLASS="declbut"
><A HREF="src/Text/ParserCombinators/Poly/Base.html#indent"
>Source</A
></TD
></TR
></TABLE
></TD
></TR
><TR
><TD CLASS="doc"
>Helper for formatting error messages: indents all lines by a fixed amount.
</TD
></TR
><TR
><TD CLASS="s15"
></TD
></TR
><TR
><TD CLASS="section2"
><A NAME="5"
><A NAME="5"
>Choices
</A
></A
></TD
></TR
><TR
><TD CLASS="s15"
></TD
></TR
><TR
><TD CLASS="topdecl"
><TABLE CLASS="declbar"
><TR
><TD CLASS="declname"
><A NAME="v:oneOf"
><A NAME="v%3AoneOf"
></A
></A
><B
>oneOf</B
> :: <A HREF="Text-ParserCombinators-Poly-Base.html#t%3APolyParse"
>PolyParse</A
> p => [p a] -> p a</TD
><TD CLASS="declbut"
><A HREF="src/Text/ParserCombinators/Poly/Base.html#oneOf"
>Source</A
></TD
></TR
></TABLE
></TD
></TR
><TR
><TD CLASS="doc"
>Parse the first alternative in the list that succeeds.
</TD
></TR
><TR
><TD CLASS="s15"
></TD
></TR
><TR
><TD CLASS="topdecl"
><TABLE CLASS="declbar"
><TR
><TD CLASS="declname"
><A NAME="v:optional"
><A NAME="v%3Aoptional"
></A
></A
><B
>optional</B
> :: <A HREF="Text-ParserCombinators-Poly-Base.html#t%3APolyParse"
>PolyParse</A
> p => p a -> p (Maybe a)</TD
><TD CLASS="declbut"
><A HREF="src/Text/ParserCombinators/Poly/Base.html#optional"
>Source</A
></TD
></TR
></TABLE
></TD
></TR
><TR
><TD CLASS="doc"
><TT
><A HREF="Text-ParserCombinators-Poly-Base.html#v%3Aoptional"
>optional</A
></TT
> indicates whether the parser succeeded through the Maybe type.
</TD
></TR
><TR
><TD CLASS="s15"
></TD
></TR
><TR
><TD CLASS="section2"
><A NAME="6"
><A NAME="6"
>Sequences
</A
></A
></TD
></TR
><TR
><TD CLASS="s15"
></TD
></TR
><TR
><TD CLASS="topdecl"
><TABLE CLASS="declbar"
><TR
><TD CLASS="declname"
><A NAME="v:exactly"
><A NAME="v%3Aexactly"
></A
></A
><B
>exactly</B
> :: <A HREF="Text-ParserCombinators-Poly-Base.html#t%3APolyParse"
>PolyParse</A
> p => Int -> p a -> p [a]</TD
><TD CLASS="declbut"
><A HREF="src/Text/ParserCombinators/Poly/Base.html#exactly"
>Source</A
></TD
></TR
></TABLE
></TD
></TR
><TR
><TD CLASS="doc"
>'exactly n p' parses precisely n items, using the parser p, in sequence.
</TD
></TR
><TR
><TD CLASS="s15"
></TD
></TR
><TR
><TD CLASS="topdecl"
><TABLE CLASS="declbar"
><TR
><TD CLASS="declname"
><A NAME="v:many"
><A NAME="v%3Amany"
></A
></A
><B
>many</B
> :: <A HREF="Text-ParserCombinators-Poly-Base.html#t%3APolyParse"
>PolyParse</A
> p => p a -> p [a]</TD
><TD CLASS="declbut"
><A HREF="src/Text/ParserCombinators/Poly/Base.html#many"
>Source</A
></TD
></TR
></TABLE
></TD
></TR
><TR
><TD CLASS="doc"
>'many p' parses a list of elements with individual parser p.
Cannot fail, since an empty list is a valid return value.
</TD
></TR
><TR
><TD CLASS="s15"
></TD
></TR
><TR
><TD CLASS="topdecl"
><TABLE CLASS="declbar"
><TR
><TD CLASS="declname"
><A NAME="v:many1"
><A NAME="v%3Amany1"
></A
></A
><B
>many1</B
> :: <A HREF="Text-ParserCombinators-Poly-Base.html#t%3APolyParse"
>PolyParse</A
> p => p a -> p [a]</TD
><TD CLASS="declbut"
><A HREF="src/Text/ParserCombinators/Poly/Base.html#many1"
>Source</A
></TD
></TR
></TABLE
></TD
></TR
><TR
><TD CLASS="doc"
>Parse a non-empty list of items.
</TD
></TR
><TR
><TD CLASS="s15"
></TD
></TR
><TR
><TD CLASS="topdecl"
><TABLE CLASS="declbar"
><TR
><TD CLASS="declname"
><A NAME="v:sepBy"
><A NAME="v%3AsepBy"
></A
></A
><B
>sepBy</B
> :: <A HREF="Text-ParserCombinators-Poly-Base.html#t%3APolyParse"
>PolyParse</A
> p => p a -> p sep -> p [a]</TD
><TD CLASS="declbut"
><A HREF="src/Text/ParserCombinators/Poly/Base.html#sepBy"
>Source</A
></TD
></TR
></TABLE
></TD
></TR
><TR
><TD CLASS="doc"
>Parse a list of items separated by discarded junk.
</TD
></TR
><TR
><TD CLASS="s15"
></TD
></TR
><TR
><TD CLASS="topdecl"
><TABLE CLASS="declbar"
><TR
><TD CLASS="declname"
><A NAME="v:sepBy1"
><A NAME="v%3AsepBy1"
></A
></A
><B
>sepBy1</B
> :: <A HREF="Text-ParserCombinators-Poly-Base.html#t%3APolyParse"
>PolyParse</A
> p => p a -> p sep -> p [a]</TD
><TD CLASS="declbut"
><A HREF="src/Text/ParserCombinators/Poly/Base.html#sepBy1"
>Source</A
></TD
></TR
></TABLE
></TD
></TR
><TR
><TD CLASS="doc"
>Parse a non-empty list of items separated by discarded junk.
</TD
></TR
><TR
><TD CLASS="s15"
></TD
></TR
><TR
><TD CLASS="topdecl"
><TABLE CLASS="declbar"
><TR
><TD CLASS="declname"
><A NAME="v:bracketSep"
><A NAME="v%3AbracketSep"
></A
></A
><B
>bracketSep</B
> :: <A HREF="Text-ParserCombinators-Poly-Base.html#t%3APolyParse"
>PolyParse</A
> p => p bra -> p sep -> p ket -> p a -> p [a]</TD
><TD CLASS="declbut"
><A HREF="src/Text/ParserCombinators/Poly/Base.html#bracketSep"
>Source</A
></TD
></TR
></TABLE
></TD
></TR
><TR
><TD CLASS="doc"
>Parse a list of items, discarding the start, end, and separator
items.
</TD
></TR
><TR
><TD CLASS="s15"
></TD
></TR
><TR
><TD CLASS="topdecl"
><TABLE CLASS="declbar"
><TR
><TD CLASS="declname"
><A NAME="v:bracket"
><A NAME="v%3Abracket"
></A
></A
><B
>bracket</B
> :: <A HREF="Text-ParserCombinators-Poly-Base.html#t%3APolyParse"
>PolyParse</A
> p => p bra -> p ket -> p a -> p a</TD
><TD CLASS="declbut"
><A HREF="src/Text/ParserCombinators/Poly/Base.html#bracket"
>Source</A
></TD
></TR
></TABLE
></TD
></TR
><TR
><TD CLASS="doc"
>Parse a bracketed item, discarding the brackets.
</TD
></TR
><TR
><TD CLASS="s15"
></TD
></TR
><TR
><TD CLASS="topdecl"
><TABLE CLASS="declbar"
><TR
><TD CLASS="declname"
><A NAME="v:manyFinally"
><A NAME="v%3AmanyFinally"
></A
></A
><B
>manyFinally</B
> :: <A HREF="Text-ParserCombinators-Poly-Base.html#t%3APolyParse"
>PolyParse</A
> p => p a -> p z -> p [a]</TD
><TD CLASS="declbut"
><A HREF="src/Text/ParserCombinators/Poly/Base.html#manyFinally"
>Source</A
></TD
></TR
></TABLE
></TD
></TR
><TR
><TD CLASS="doc"
>'manyFinally e t' parses a possibly-empty sequence of e's,
terminated by a t. The final t is discarded. Any parse failures
could be due either to a badly-formed terminator or a badly-formed
element, so it raises both possible errors.
</TD
></TR
><TR
><TD CLASS="s15"
></TD
></TR
><TR
><TD CLASS="botbar"
>Produced by <A HREF="http://www.haskell.org/haddock/"
>Haddock</A
> version 2.4.2</TD
></TR
></TABLE
></BODY
></HTML
>