[Haskell-cafe] [ANN] new version of uu-parsinglib
Version 2.7.0 was uploaded to hackage. From the CHANGELOG: Version 2.7.0 Improvement: change of error correction at end of amb (which deals with ambiguous parsers) combinator; available lookahead is better taken into account Relatively large change: • Change to Data.ListLike inputs, so a general stream input structure is possible; hence we can now parse all instances from Data.ListLike • Simplified and generalised implementation of merging/permuting parsers; any kind of parsers can now be merged/permuted • New class IsParser was introduced which captures the basic properties of our parsers, thus simplifying the types • Inclusion of a module Text.ParserCombinators.UU.Utils containing common Char based parsers • Removal of the class Provides, and replaced by separate pSym, pSatisfy and pRange; this may require some rewriting of existing parsers. Readability is supposed to improve from that. Types become simpler. For an example see the module Text.ParserCombinators.UU.Utils. • Included a Demo directory, with one module for demonstrating normal parsers and one aimed at showing merging parsers • Added the module Text.ParserCombinaors.UU.Idioms, which contains specialised version for the idiomatic notation; it infers the sequental composition operators from the types of the operands; String-s and Char-s are not supposed to contribute to the result (hence *), function parameters are lifted using `pure`, and normal parsers are composed with `*`. • Many other small changes, mostly upwards compatible or invisible (code cleanup) For some examples see: http://hackage.haskell.org/packages/archive/uu-parsinglib/2.7.0/doc/html/Text-ParserCombinators-UU-Demo-Examples.html and: http://hackage.haskell.org/packages/archive/uu-parsinglib/2.7.0/doc/html/Text-ParserCombinators-UU-Demo-MergeAndPermute.html and: http://hackage.haskell.org/packages/archive/uu-parsinglib/2.7.0/doc/html/Text-ParserCombinators-UU-Idioms.html ___ Haskell-Cafe mailing list Haskell-Cafe@haskell.org http://www.haskell.org/mailman/listinfo/haskell-cafe
Re: [Haskell-cafe] ANN: new version of uu-parsinglib
On Sun, May 31, 2009 at 7:21 PM, Ross Paterson r...@soi.city.ac.uk wrote: Perhaps we should make some and many methods of Alternative, * and * methods of Applicative and $ a method of Functor, all with the current definitions as defaults. (John Meacham was also asking for the first of these.) +1 As a justification, (*) and () serve much the same purpose, and () is already exposed via Monad to permit the same kinds of optimizations that an explicit override of (*) proffers. -Edward Kmett ___ Haskell-Cafe mailing list Haskell-Cafe@haskell.org http://www.haskell.org/mailman/listinfo/haskell-cafe
Re: [Haskell-cafe] ANN: new version of uu-parsinglib
On Mon, Jun 01, 2009 at 08:27:05PM +0200, S. Doaitse Swierstra wrote: And rename empty to fail? You managed to confuse me since I always use pSucceed to recognise the empty string. That would clash with the existing and widely used fail. One could view empty as the parser for the empty language. And some of us are also interested in Alternatives that aren't parsers. ___ Haskell-Cafe mailing list Haskell-Cafe@haskell.org http://www.haskell.org/mailman/listinfo/haskell-cafe
Re: [Haskell-cafe] ANN: new version of uu-parsinglib
And rename empty to fail? You managed to confuse me since I always use pSucceed to recognise the empty string. Doaitse On 1 jun 2009, at 01:21, Ross Paterson wrote: On Sun, May 31, 2009 at 09:40:38PM +0200, S. Doaitse Swierstra wrote: A new version of the uu-parsinglib has been uploaded to hackage. It is now based on Control.Applicative where possible. Be warned that functions like some and many will be redefined in the future. Perhaps we should make some and many methods of Alternative, * and * methods of Applicative and $ a method of Functor, all with the current definitions as defaults. (John Meacham was also asking for the first of these.) ___ Haskell-Cafe mailing list Haskell-Cafe@haskell.org http://www.haskell.org/mailman/listinfo/haskell-cafe ___ Haskell-Cafe mailing list Haskell-Cafe@haskell.org http://www.haskell.org/mailman/listinfo/haskell-cafe
[Haskell-cafe] ANN: new version of uu-parsinglib
A new version of the uu-parsinglib has been uploaded to hackage. It is now based on Control.Applicative where possible. Be warned that functions like some and many will be redefined in the future. Doaitse Swierstra ___ Haskell-Cafe mailing list Haskell-Cafe@haskell.org http://www.haskell.org/mailman/listinfo/haskell-cafe
Re: [Haskell-cafe] ANN: new version of uu-parsinglib
On 31 May 2009, at 20:40, S. Doaitse Swierstra wrote: A new version of the uu-parsinglib has been uploaded to hackage. It is now based on Control.Applicative where possible. It's mutual. Cheers Conor ___ Haskell-Cafe mailing list Haskell-Cafe@haskell.org http://www.haskell.org/mailman/listinfo/haskell-cafe
Re: [Haskell-cafe] ANN: new version of uu-parsinglib
On Sun, May 31, 2009 at 09:40:38PM +0200, S. Doaitse Swierstra wrote: A new version of the uu-parsinglib has been uploaded to hackage. It is now based on Control.Applicative where possible. Be warned that functions like some and many will be redefined in the future. Perhaps we should make some and many methods of Alternative, * and * methods of Applicative and $ a method of Functor, all with the current definitions as defaults. (John Meacham was also asking for the first of these.) ___ Haskell-Cafe mailing list Haskell-Cafe@haskell.org http://www.haskell.org/mailman/listinfo/haskell-cafe
