homepage: http://repetae.net/computer/frisby/
changelog-type: ''
hash: fd4609d36c8150929840a25f198d5501b4f178bcc8250e267b3dea43ecb0b652
test-bench-deps: {}
maintainer: John Meacham <john@repetae.net>, Chris Done <chrisdone@gmail.com>
synopsis: Linear time composable parser for PEG grammars
changelog: ''
basic-deps:
  base: ! '>=4 && <5'
  array: -any
  containers: -any
  mtl: -any
all-versions:
- '0.1'
- '0.2'
author: John Meacham <john@repetae.net>
latest: '0.2'
description-type: haddock
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.'
license-name: BSD3

homepage: http://repetae.net/computer/frisby/
changelog-type: ''
hash: 12db65dfa550e3fb99cf8924ebf71c9308465391ee91a897741fdbcca65fe1c6
test-bench-deps: {}
maintainer: John Meacham <john@repetae.net>, Chris Done <chrisdone@gmail.com>
synopsis: Linear time composable parser for PEG grammars
changelog: ''
basic-deps:
  base: ! '>=4.6 && <5'
  array: <0.6
  containers: <0.6
  mtl: <2.3
all-versions:
- '0.1'
- '0.2'
author: John Meacham <john@repetae.net>
latest: '0.2'
description-type: haddock
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.'
license-name: BSD3

Update from Hackage at 2016-12-07T20:37:42Z
Update from Hackage at 2016-12-07T20:37:42Z