Manuel M. T. Chakravarty writes:
Lars Henrik Mathiesen [EMAIL PROTECTED] wrote,
From: "Manuel M. T. Chakravarty" [EMAIL PROTECTED]
Date: Fri, 29 Sep 2000 10:17:56 +1100
I agree that usually the predicates as proposed by you would
be better. The problem is that a scanner
From: "Manuel M. T. Chakravarty" [EMAIL PROTECTED]
Date: Fri, 29 Sep 2000 10:17:56 +1100
I agree that usually the predicates as proposed by you would
be better. The problem is that a scanner that wants to use
the usual finite deterministic automation techniques for
scanning, needs to be
[EMAIL PROTECTED] (Marcin 'Qrczak' Kowalczyk) wrote,
Wed, 27 Sep 2000 00:22:05 +1100, Manuel M. T. Chakravarty [EMAIL PROTECTED]
pisze:
Hmm, this seems like a shortcoming in the Haskell spec. We have all
these isAlpha, isDigit, etc functions, but I can't get at a list of,
say, all
Lennart Augustsson [EMAIL PROTECTED] wrote,
"Manuel M. T. Chakravarty" wrote:
Currently, most Haskell systems don't support unicode anyway
(I think, hbc is the only exception), so I guess this is not
a pressing issue. As soon as, we have unicode support and
there is a need for lexers
Lars Henrik Mathiesen [EMAIL PROTECTED] wrote,
From: "Manuel M. T. Chakravarty" [EMAIL PROTECTED]
Date: Tue, 26 Sep 2000 15:11:23 +1100
For 16bit character ranges, it would be necessary to
directly store negated character sets (such as [^abc]).
From what he told me, Doitse Swierstra
There is no need for "." or [^abc] as Haskell list operators
can be used to "simulate" them. The following is from the C
lexer and matches all visible characters and all characters
except newline, respectively:
visible = alt [' '..'\127']
anyButNL = alt (['\0'..'\255'] \\
Doug Ransom [EMAIL PROTECTED] wrote,
There is no need for "." or [^abc] as Haskell list operators
can be used to "simulate" them. The following is from the C
lexer and matches all visible characters and all characters
except newline, respectively:
visible = alt [' '..'\127']
