Hi,
I have to install HDirect on a windows plataform but I have a lot of problems.
When I try to install the version 0.21,make boot has problems with Happy and
I've commented this line(the path is correct),latter make lib give 2 errors:
../src/ihc :command not found
[hugs/PointerPrim.hs] Error
On Thu, Dec 02, 2004 at 02:48:07PM +, Mark Carroll wrote:
Is there a way in Parsec to, within a parser, throw an error generated
by another parser? For instance, something of type
ParseError - GenParser tok st a
or whatever.
I guess no. I tried hard to find this about a month ago,
Hi,
you probably need to compile it with -O. You can use -Wall as well to see some
hint from ghc that prevents you from making silly mistakes.
Georg
On Sat, 4 Dec 2004 22:44:49 +0100, Frdric Gobry [EMAIL PROTECTED] wrote:
I'll maybe perform the actual processing I need to get the job done
first,
Mark Carroll writes:
Is there a way in Parsec to, within a parser, throw an
error generated by another parser?
How about wrapping the ParseError into your result type?
Like this:
data Foo = Bar String | ... | BadLuck ParseError
Then you could run any number of parsers (with 'runParser')
On Sun, Dec 05, 2004 at 07:36:07PM +0100, Peter Simons wrote:
Mark Carroll writes:
Is there a way in Parsec to, within a parser, throw an
error generated by another parser?
How about wrapping the ParseError into your result type?
Like this:
data Foo = Bar String | ... | BadLuck
[Newbie warning on] Here's a few random obeservations from my playing with
Haskell:
1. Switched to exploring Haskell from SML after finding out that it supports
polymorphism in contrast to SML and has nicer syntax. Good.
2. Frequently saw a quick sort implementation in Haskell as a proof for
On 2004 December 05 Sunday 18:19, Rolf Wilms wrote:
[Newbie warning on] Here's a few random obeservations from my playing with
Haskell:
You've got into Haskell with unusual rapidity. Most of your observations are
fairly aimed.
Recently found a memoization modulue in Hugs, but no docs.
Scott Turner reacts:
7. There's a lot of discussion w.r.t state, at least on this list. Is
threading state through many functions respectivley polluting many
functions with monads the solution?
If a function is pure, there's never any need to involve it with a monad.
Monads don't cause
G'day all.
Quoting Marcin 'Qrczak' Kowalczyk [EMAIL PROTECTED]:
2. Use a persistent data structure with logarithmic cost of most
operations: a balanced tree of text fragments, called a rope
(Hans Boehm has made one for C). Undo can be made by simply
keeping old versions.
Hard
