Re: Regular Expressions NSString and Omni Foundation

On Thursday, May 1, 2003, at 17:44 US/Eastern, Ben Dougall wrote:
> i don't think any there is any implementation of regular expressions 
> that fully covers unicode yet. even the most developed has got a long 
> way to go on full unicode support in regex. it's a pretty tall order i 
> think: how different languages operate differently on a character by 
> character basis - combining characters, different types of 
> categorisations for different subsets in unicode.

At the moment, though, I think Perl itself has the best support I have 
seen.  It does many of the slower Unicode matches incredibly quickly, 
and handles multiple languages quite well.  It has had most of the 
Unicode character classes available for quite some time, and is very 
reliable, in my experience.

Kyle Moffett

-----BEGIN GEEK CODE BLOCK-----
Version: 3.12
GCM/CS/IT/U d- s++:- a16 C++++>$ UB/L/X/*++++(+)>$ P+++(++++)>$
L+++(++) E W++(+) N+++(++) o? K? w---(-) O? M++ V? PS+() PE+(-) Y+
PGP? t+(+++) 5 X R? tv-(--) b++++(++) DI+ D+ G e->++++$ h! !r-- !y?
------END GEEK CODE BLOCK------