For 2.02 I've fixed the parser to use left recusion instead of right
recursion. That will make the parser use much less stack.
The Haskell compiler itself should probably have some special case stuff
for very large literal lists. I havn't done anything about this,
but at least it'll get past the parser now!
Simon
| For haskell source with very long array definitions (like say, a big
| Happy output file), our Solaris 2.5 installation of ghc-2.01 does stuff
| like:
|
| ghc2:recompile:Input file Galileo6.hs newer than Galileo6.o
| "Galileo6.hs", line 122, column 149: parser stack overflow on input: "0"
| make: *** [Galileo6.o] Error 1
|
| Is there a compiler flag that's twiddlable to fix this, or do I need to
| do something brutal like rebuilding the whole compiler, say with a new
| 'yacc' (or bison, even)?
