kpriv/pkgsrc-wip
1
0
Fork 0
Code Issues Pull requests Projects Releases Packages Wiki Activity
pkgsrc-wip/happy/distinfo

12 lines
587 B
Text
Raw Normal View History

Update happy to version 1.16; changes since 1.15: * Switch to a Cabal build system: you need a recent version of Cabal (1.1.6 or later). If you have GHC 6.4.2, then you need to upgrade Cabal before building Happy. GHC 6.6 is fine. * New %error directive * New production forms: {%% .. } and {%^ .. } * Added Attribute Grammar support, by Robert Dockins
2007-04-24 11:36:09 +02:00
$NetBSD: distinfo,v 1.3 2007/04/24 09:36:09 emil_s Exp $
Happy is a parser generator system for Haskell, similar to the tool `yacc' for C. Like `yacc', it takes a file containing an annotated BNF specification of a grammar and produces a Haskell module containing a parser for the grammar. Happy is flexible: you can have several Happy parsers in the same program, and several entry points to a single grammar. Happy can work in conjunction with a lexical analyser supplied by the user (either hand-written or generated by another program), or it can parse a stream of characters directly (but this isn't practical in most cases).
2005-11-16 11:39:48 +01:00
Update happy to version 1.16; changes since 1.15: * Switch to a Cabal build system: you need a recent version of Cabal (1.1.6 or later). If you have GHC 6.4.2, then you need to upgrade Cabal before building Happy. GHC 6.6 is fine. * New %error directive * New production forms: {%% .. } and {%^ .. } * Added Attribute Grammar support, by Robert Dockins
2007-04-24 11:36:09 +02:00
SHA1 (happy-1.16-html.tar.gz) = 5d5abc676896dca622481dc328da58999957cf6a
RMD160 (happy-1.16-html.tar.gz) = 51e84654769ea03e600b973e7cb3e426f1f446f3
Size (happy-1.16-html.tar.gz) = 50571 bytes
SHA1 (happy-1.16.tar.gz) = 5fbf5d61f060efb43efeae048ef1e37ab0bb1c97
RMD160 (happy-1.16.tar.gz) = ebe54b1c3ee7623de96e56bc69299dd236323781
Size (happy-1.16.tar.gz) = 226566 bytes
Happy is a parser generator system for Haskell, similar to the tool `yacc' for C. Like `yacc', it takes a file containing an annotated BNF specification of a grammar and produces a Haskell module containing a parser for the grammar. Happy is flexible: you can have several Happy parsers in the same program, and several entry points to a single grammar. Happy can work in conjunction with a lexical analyser supplied by the user (either hand-written or generated by another program), or it can parse a stream of characters directly (but this isn't practical in most cases).
2005-11-16 11:39:48 +01:00
SHA1 (happy.ps.gz) = 3d3f370375c5376f2bb52be0e9593fc0d6f60de5
RMD160 (happy.ps.gz) = 8aa89af672919f2009226c8e357369af820fdac5
Size (happy.ps.gz) = 63679 bytes
Reference in a new issue Copy permalink