Sophie: ghc-0:6.10.4-1mdv2010.0 i586

ghc-6.10.4-1mdv2010.0.i586.rpm

<!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.Parsec.Perm</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-Parsec-Perm.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"
>parsec-2.1.0.1: Monadic parser combinators</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.Parsec.Perm</FONT
></TD
><TD ALIGN="right"
><TABLE CLASS="narrow" CELLSPACING="0" CELLPADDING="0"
><TR
><TD CLASS="infohead"
>Portability</TD
><TD CLASS="infoval"
>non-portable (uses existentially quantified data constructors)</TD
></TR
><TR
><TD CLASS="infohead"
>Stability</TD
><TD CLASS="infoval"
>provisional</TD
></TR
><TR
><TD CLASS="infohead"
>Maintainer</TD
><TD CLASS="infoval"
>daan@cs.uu.nl</TD
></TR
></TABLE
></TD
></TR
></TABLE
></TD
></TR
><TR
><TD CLASS="s15"
></TD
></TR
><TR
><TD CLASS="section1"
>Description</TD
></TR
><TR
><TD CLASS="doc"
><P
>This module implements permutation parsers. The algorithm used
 is fairly complex since we push the type system to its limits :-)
 The algorithm is described in:
</P
><P
><EM
>Parsing Permutation Phrases,</EM
>
 by Arthur Baars, Andres Loh and Doaitse Swierstra.
 Published as a functional pearl at the Haskell Workshop 2001.
</P
></TD
></TR
><TR
><TD CLASS="s15"
></TD
></TR
><TR
><TD CLASS="s15"
></TD
></TR
><TR
><TD CLASS="section1"
>Documentation</TD
></TR
><TR
><TD CLASS="s15"
></TD
></TR
><TR
><TD CLASS="decl"
><SPAN CLASS="keyword"
>data</SPAN
>  <A NAME="t:PermParser"
><A NAME="t%3APermParser"
></A
></A
><B
>PermParser</B
> tok st a </TD
></TR
><TR
><TD CLASS="s15"
></TD
></TR
><TR
><TD CLASS="decl"
><A NAME="v:permute"
><A NAME="v%3Apermute"
></A
></A
><B
>permute</B
> ::  <A HREF="Text-ParserCombinators-Parsec-Perm.html#t%3APermParser"
>PermParser</A
> tok st a -&gt; <A HREF="Text-ParserCombinators-Parsec-Prim.html#t%3AGenParser"
>GenParser</A
> tok st a</TD
></TR
><TR
><TD CLASS="s15"
></TD
></TR
><TR
><TD CLASS="decl"
><A NAME="v:<||>"
><A NAME="v%3A%3C%7C%7C%3E"
></A
></A
><B
>(&lt;||&gt;)</B
> ::  <A HREF="Text-ParserCombinators-Parsec-Perm.html#t%3APermParser"
>PermParser</A
> tok st (a -&gt; b) -&gt; <A HREF="Text-ParserCombinators-Parsec-Prim.html#t%3AGenParser"
>GenParser</A
> tok st a -&gt; <A HREF="Text-ParserCombinators-Parsec-Perm.html#t%3APermParser"
>PermParser</A
> tok st b</TD
></TR
><TR
><TD CLASS="s15"
></TD
></TR
><TR
><TD CLASS="decl"
><A NAME="v:<$$>"
><A NAME="v%3A%3C%24%24%3E"
></A
></A
><B
>(&lt;$$&gt;)</B
> ::  (a -&gt; b) -&gt; <A HREF="Text-ParserCombinators-Parsec-Prim.html#t%3AGenParser"
>GenParser</A
> tok st a -&gt; <A HREF="Text-ParserCombinators-Parsec-Perm.html#t%3APermParser"
>PermParser</A
> tok st b</TD
></TR
><TR
><TD CLASS="s15"
></TD
></TR
><TR
><TD CLASS="decl"
><A NAME="v:<|?>"
><A NAME="v%3A%3C%7C%3F%3E"
></A
></A
><B
>(&lt;|?&gt;)</B
> ::  <A HREF="Text-ParserCombinators-Parsec-Perm.html#t%3APermParser"
>PermParser</A
> tok st (a -&gt; b) -&gt; (a, <A HREF="Text-ParserCombinators-Parsec-Prim.html#t%3AGenParser"
>GenParser</A
> tok st a) -&gt; <A HREF="Text-ParserCombinators-Parsec-Perm.html#t%3APermParser"
>PermParser</A
> tok st b</TD
></TR
><TR
><TD CLASS="s15"
></TD
></TR
><TR
><TD CLASS="decl"
><A NAME="v:<$?>"
><A NAME="v%3A%3C%24%3F%3E"
></A
></A
><B
>(&lt;$?&gt;)</B
> ::  (a -&gt; b) -&gt; (a, <A HREF="Text-ParserCombinators-Parsec-Prim.html#t%3AGenParser"
>GenParser</A
> tok st a) -&gt; <A HREF="Text-ParserCombinators-Parsec-Perm.html#t%3APermParser"
>PermParser</A
> tok st b</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
>