Dear GHC,
You compile the following program for several minutes, with -Onot.
But is it really a hard business to parse them 40 expressions below,
of which e1 is the largest one?
I need this as just reading of the input data for other program.
Only please, do not write the compiler in C !
What I ask is maybe, an easy compilation key, easier than -Onot,
just parse minimally, do not check or build expensive things.
The key like -CompileEasyLike_Hugs.
If this will work in STG-Hugs
(and if STG-Hugs will work reliably), then this would suffice.
------------------
Sergey Mechveliani
[EMAIL PROTECTED]
--------------------------------------------------------------------
yFields = [e1, e2, e3, e4, e5, e6, e7, e8, e9, e10,
e11,e12,e13,e14,e15,e16,e17,e18,e19,e20,
e21,e22,e23,e24,e25,e26,e27,e28,e29,e30,
e31,e32,e33,e34,e35,e36,e37,e38,e39,e40
] :: [ [(Int,(Int,Int,Int),[Int])] ]
e1 = -- the largest of all e_i
[(3,(2,0,2),[3,0,0,0]), (4,(2,0,1),[3,0,0,1]), (1,(2,0,0),[3,0,0,2]),
(5,(1,1,1),[3,0,0,0]), (3,(1,1,0),[3,0,0,1]), (1,(1,0,4),[]),
(1,(1,0,3),[2,0,0,0]), (2,(1,0,2),[3,1,0,0]), (1,(1,0,2),[2,0,0,1]),
(3,(1,0,1),[3,1,0,1]), (5,(0,1,1),[3,1,0,0]), (3,(0,1,0),[3,1,0,1]),
(1,(0,0,3),[2,1,0,0]), (1,(0,0,2),[3,2,0,0]), (1,(0,0,2),[2,1,0,1])
]
e2 = ...
...
