in reply to Re: Verifying Unicode (The mother of all regex).
in thread Verifying Unicode (The mother of all regex).

Thanks, but I already have regex's for all the rules, with a couple of editor macros doing most of the donkey work.

My question was really about finding better (by some definition of the term) way of validating such large sets of unicode character ranges. I looked at negating the regex to see if that would reduce the complexity size, its not really complicated, but the result is no better. I also tried to discern some pattern in the ranges and see if might use bitwise boolean logic to accept/reject them in the same way that you can grep{ ord & 32 } @chars; to exclude uppercase alpha, but I don't see anything obvious.

I thought that maybe someone else had tackled the problem and found a more elegant solution.

Examine what is said, not who speaks.
1) When a distinguished but elderly scientist states that something is possible, he is almost certainly right. When he states that something is impossible, he is very probably wrong.
2) The only way of discovering the limits of the possible is to venture a little way past them into the impossible
3) Any sufficiently advanced technology is indistinguishable from magic.
Arthur C. Clarke.

Replies are listed 'Best First'.
Re: Re: Re: Verifying Unicode (The mother of all regex).
by diotalevi (Canon) on May 02, 2003 at 19:38 UTC
[reply]

In Section Seekers of Perl Wisdom