frisby-0.1: frisby.cabal

name:                frisby
version:             0.1
cabal-version:       >=1.1.6
license:             BSD3
copyright:           John Meacham (2006)
author:              John Meacham <john@repetae.net>
maintainer:          John Meacham <john@repetae.net>
stability:           experimental
homepage:            http://repetae.net/computer/frisby/
package-url:         http://repetae.net/repos/frisby
synopsis:            Linear time composable parser for PEG grammars.
description:         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.
category:            Text
tested-with:         GHC==6.12.1
exposed-modules:     Text.Parsers.Frisby, Text.Parsers.Frisby.Char
build-type:          Simple
build-depends:       base>=4 && <5, containers, mtl, array
license-file:        LICENSE