[Haskell-cafe] design question: decision tree from "Programming
S. Doaitse Swierstra
doaitse at swierstra.net
Wed Aug 4 05:27:17 EDT 2010
I have added the permutation parsers from uulib to uu-parsinglib:
where you find reference to the paper
On 22 jun 2010, at 09:24, Stephen Tetley wrote:
> Maybe "permutation trees" are a viable starting point?
> See the paper "Parsing Permutation Phrases" which appears to be on CiteSeer.
> Some slides are also here - the data type definitions and Functor
> instance for permutation trees are on page 18 (pdf index page 19):
> An alternative implementation for applicative functors is here:
> Note the use of existentials here is pretty cunning, I didn't get very
> far the time I attempted to use the technique for my own purposes.
> Best wishes
> Haskell-Cafe mailing list
> Haskell-Cafe at haskell.org
More information about the Haskell-Cafe