Source: haskell-frisby
Priority: optional
Section: misc
Maintainer: Jeremy Shaw <jeremy@seereason.com>
Build-Depends: debhelper (>= 7.0),
               haskell-devscripts (>= 0.6.15+nmu7),
               hscolour,
               cdbs,
               ghc (>= 6.8),
               ghc-prof,
               libghc-mtl-prof (>= 1.0)
Build-Depends-Indep: ghc-doc,
                     haddock,
                     libghc-mtl-doc (>= 1.0)
Standards-Version: 3.8.1
Homepage: http://repetae.net/computer/frisby/

Package: libghc-frisby-dev
Architecture: any
Section: haskell
Depends: ${haskell:Depends},
         ${misc:Depends}
Description: Linear time composable parser for PEG grammars.
 frisby is a parser library that can parse arbitrary PEG
 grammars in linear time. Unlike other parsers of PEG grammars,
 frisby need not be supplied with all possible rules up front,
 allowing composition of smaller parsers.
 .
 PEG parsers are never ambiguous and allow infinite lookahead
 with no backtracking penalty. Since PEG parsers can look ahead
 arbitrarily, they can easily express rules such as the maximal
 munch rule used in lexers, meaning no separate lexer is needed.
 .
 In addition to many standard combinators, frisby provides
 routines to translate standard regex syntax into frisby parsers.
 .
  Author: John Meacham <john@repetae.net>
  Upstream-Maintainer: John Meacham <john@repetae.net>
  Url: http://repetae.net/repos/frisby
 .
 This package contains the normal library files.

Package: libghc-frisby-prof
Architecture: any
Section: haskell
Depends: ${haskell:Depends},
         ${misc:Depends},
         libghc-frisby-dev
Description: Linear time composable parser for PEG grammars.
 frisby is a parser library that can parse arbitrary PEG
 grammars in linear time. Unlike other parsers of PEG grammars,
 frisby need not be supplied with all possible rules up front,
 allowing composition of smaller parsers.
 .
 PEG parsers are never ambiguous and allow infinite lookahead
 with no backtracking penalty. Since PEG parsers can look ahead
 arbitrarily, they can easily express rules such as the maximal
 munch rule used in lexers, meaning no separate lexer is needed.
 .
 In addition to many standard combinators, frisby provides
 routines to translate standard regex syntax into frisby parsers.
 .
  Author: John Meacham <john@repetae.net>
  Upstream-Maintainer: John Meacham <john@repetae.net>
  Url: http://repetae.net/repos/frisby
 .
 This package contains the libraries compiled with profiling enabled.

Package: haskell-frisby-doc
Architecture: all
Section: doc
Depends: ${haskell:Depends},
         ${misc:Depends},
         ghc-doc
Description: Linear time composable parser for PEG grammars.
 frisby is a parser library that can parse arbitrary PEG
 grammars in linear time. Unlike other parsers of PEG grammars,
 frisby need not be supplied with all possible rules up front,
 allowing composition of smaller parsers.
 .
 PEG parsers are never ambiguous and allow infinite lookahead
 with no backtracking penalty. Since PEG parsers can look ahead
 arbitrarily, they can easily express rules such as the maximal
 munch rule used in lexers, meaning no separate lexer is needed.
 .
 In addition to many standard combinators, frisby provides
 routines to translate standard regex syntax into frisby parsers.
 .
  Author: John Meacham <john@repetae.net>
  Upstream-Maintainer: John Meacham <john@repetae.net>
  Url: http://repetae.net/repos/frisby
 .
 This package contains the documentation files.