Parsing Haskell list comprehensions deterministically ((LA)LR) is currently very
hard, since both "pat - exp" (or also "pat gd - exp", as suggested by Thomas)
and "exp" are allowed as qualifiers in a list comprehension. Patterns and
expressions can look very much alike. Could one
Stefan Kahrs writes:
[About Miranda] This works, because patterns
are syntactically a subclass of expressions.
But this is not true for Haskell (@ and _ are only
in patterns), but the technique still works. You
just have to work harder and join pat and exp and
then always have a semantic
Patterns and
expressions can look very much alike. Could one possibly expand "exp" to
"if exp" in Haskell 1.3 list comprehensions? Only to make deterministic
parsing easier...
One should not make the parsing method too
