frown 0.6.1-12 source package in Ubuntu

Changelog

frown (0.6.1-12) unstable; urgency=low


  * GHC 7.4.1 compatibility, Closes: #643120, I hope. 
  * Debian compat level 7, for debian/clean

 -- Joachim Breitner <email address hidden>  Thu, 15 Mar 2012 14:24:47 +0100

Upload details

Uploaded by:
Debian Haskell Group on 2012-03-15
Uploaded to:
Sid
Original maintainer:
Debian Haskell Group
Architectures:
any all
Section:
devel
Urgency:
Low Urgency

See full publishing history Publishing

Series Pocket Published Component Section
Precise release on 2012-04-02 universe devel

Downloads

File Size SHA-256 Checksum
frown_0.6.1-12.dsc 1.4 KiB 82937a98d31a0484b50f9241882164857132e7ca2648b1f9a6ed25f1f33d0548
frown_0.6.1.orig.tar.gz 1.2 MiB bfb5a7a84527624a605342cf739ebbef078a25721ca5af4fb7998590d76a9c05
frown_0.6.1-12.debian.tar.gz 14.9 KiB cde3465d0641e41dbc6e26a3aea9748ffac980ccb32e073be25c5c0cecff3700

Available diffs

No changes file available.

Binary packages built by this source

frown: LALR(k) parser generator for Haskell 98

 Frown is inspired by the parser generator Happy and uses a syntax
 quite simular as the syntax used by Happy. Happy only handles LALR(1)
 grammars while Frown can use more extensive LALR(k) grammars and the
 parsers generated by Frown are also faster than the parsers generated
 by Happy.
 .
 The salient features of Frown are:
   - The generated parsers are time and space efficient. On the
     downside, the parsers are quite large.
   - Frown generates four different types of parsers. As a common
     characteristic, the parsers are genuinely functional
     (ie 'table-free'); the states of the underlying LR automaton are
     encoded as mutually recursive functions. Three output formats use
     a typed stack representation, one format due to Ross Paterson
     (code=stackless) works even without a stack.
   - Encoding states as functions means that each state can be treated
     individually as opposed to a table driven-approach, which
     necessitates a uniform treatment of states. For instance,
     look-ahead is only used when necessary to resolve conflicts.
   - Frown comes with debugging and tracing facilities; the standard
     output format due to Doaitse Swierstra (code=standard) may be
     useful for teaching LR parsing.
   - Common grammatical patterns such as repetition of symbols can be
     captured using rule schemata. There are several predefined rule
     schemata.
   - Terminal symbols are arbitrary variable-free Haskell patterns or
     guards. Both terminal and nonterminal symbols may have an
     arbitrary number of synthesized attributes.
   - Frown comes with extensive documentation; several example grammars
     are included.
 .
 Furthermore, Frown supports the use of monadic lexers, monadic
 semantic actions, precedences and associativity, the generation of
 backtracking parsers, multiple start symbols, error reporting and a
 weak form of error correction.

frown-doc: Manual of the frown parser generator for Haskell 98

 The manual and examples of the frown LALR(k) parser generator.
 ,
 Frown is inspired by the parser generator Happy and uses a syntax
 quite simular as the syntax used by Happy. Happy only handles LALR(1)
 grammars while Frown can use more extensive LALR(k) grammars and the
 parsers generated by Frown are also faster than the parsers generated
 by Happy.
 .
 The salient features of Frown are:
   - The generated parsers are time and space efficient. On the
     downside, the parsers are quite large.
   - Frown generates four different types of parsers. As a common
     characteristic, the parsers are genuinely functional
     (ie 'table-free'); the states of the underlying LR automaton are
     encoded as mutually recursive functions. Three output formats use
     a typed stack representation, one format due to Ross Paterson
     (code=stackless) works even without a stack.
   - Encoding states as functions means that each state can be treated
     individually as opposed to a table driven-approach, which
     necessitates a uniform treatment of states. For instance,
     look-ahead is only used when necessary to resolve conflicts.
   - Frown comes with debugging and tracing facilities; the standard
     output format due to Doaitse Swierstra (code=standard) may be
     useful for teaching LR parsing.
   - Common grammatical patterns such as repetition of symbols can be
     captured using rule schemata. There are several predefined rule
     schemata.
   - Terminal symbols are arbitrary variable-free Haskell patterns or
     guards. Both terminal and nonterminal symbols may have an
     arbitrary number of synthesized attributes.
   - Frown comes with extensive documentation; several example grammars
     are included.
 .
 Furthermore, Frown supports the use of monadic lexers, monadic
 semantic actions, precedences and associativity, the generation of
 backtracking parsers, multiple start symbols, error reporting and a
 weak form of error correction.