RE: The dreaded layout rule

[Manuel M. T. Chakravarty]

Malcolm Wallace <[EMAIL PROTECTED]> wrote,

[...]
> Simon Marlow replies:
> 
> > GHC and Hugs both make use of yacc-style error recovery, albeit in a very
> > limited form.
> 
> And nhc uses parser combinators, which give you backtracking on error
> conditions for free.  We actually do almost all layout processing at
> the lexical stage, but where the parser expects a } and doesn't get
> one, we just insert the }, and re-lex the remaining input.  I suppose
> having to re-lex is a bit of a chore, but laziness comes to the rescue
> somewhat.

How about the Carl Witty's

  do a == b == c

does NHC handle this correctly?

Manuel