Front page | perl.perl6.internals |
Postings from January 2002
RE: on parrot strings
Thread Previous
|
Thread Next
From:
Hong Zhang
Date:
January 18, 2002 12:09
Subject:
RE: on parrot strings
Message ID:
400CE9390E334A4393CEECDD6863120A01A10726@ussccm003.corp.palm.com
> > preprocessing. Another example, if I want to search for /resume/e,
> > (equivalent matching), the regex engine can normalize the case, fully
> > decompose input string, strip off any combining character, and do 8-bit
>
> Hmmm. The above sounds complicated not quite what I had in mind
> for equivalence matching: I would have just said "both the pattern
> and the target need to normalized, as defined by Unicode". Then
> the comparison and searching reduce to the trivial cases of byte
> equivalence and searching (of which B-M is the most popular example).
You are right in some sense. But "normalized, as defined by Unicode"
may not be simple. I look at unicode regex tr18. It does not specify
equivalence of "resume" vs "re`sume`", but user may want or may not
want this kind of normalization.
Hong
Thread Previous
|
Thread Next