Thanks for your comments.
Check whether it is GC-bound by using +RTS -sstderr.
Well yes, it does a lot of GC (there's no way for the compiler
to optimize away the list of primes) because that was the point
of the example: to confirm (or disprove)
that GC hurts parallelism (at the moment).
-BEGIN PGP SIGNED MESSAGE-
Hash: SHA1
On Apr 28, 2009, at 01:24 , Scott Michel wrote:
I've been hacking along on a NetBeans Haskell plugin (*) Looking at
Parser.y.pp, because both Eclipse and NetBeans work with antlr, it
seems like there are interesting cases in which chimeric
2009/4/28 Scott Michel scooter@gmail.com:
This got me to thinking that either ghc has issues or I have some
fundamental misunderstanding of Haskell syntax. Or, maybe I should use
someone else's grammar.
GHC's parser is over-generous by design. See
On Tue, Apr 28, 2009 at 1:09 PM, Max Bolingbroke
batterseapo...@hotmail.com wrote:
2009/4/28 Scott Michel scooter@gmail.com:
This got me to thinking that either ghc has issues or I have some
fundamental misunderstanding of Haskell syntax. Or, maybe I should use
someone else's grammar.
