A while back, I made some
XML-related Regular Expressions for testing to see if a string is a legal XML identifier.
Easy to do in Perl, once you list all the ranges. Let the regex engine do the rest.
But now I need to do that in C++. I've been thinking of different ways to do it, ballancing both high-speed and compact representation.
A 64K bitmap (8K bytes) would be a simple lookup, but rather large. A list of pairs would be compact but slower to search. I'm leaning toward a hiarachial table of bitmaps.
So... how does Perl5 do it? In the old days, a 256-bit bitmap was a great character class implementation. But with Unicode, things change. I wonder if anyone knows what ideas were bantered around and dismissed, and why the implementors like the way they settled on (if they do)? Will Perl6 do it the same way?
—John
Posts are HTML formatted. Put <p> </p> tags around your paragraphs. Put <code> </code> tags around your code and data!
Titles consisting of a single word are discouraged, and in most cases are disallowed outright.
Read Where should I post X? if you're not absolutely sure you're posting in the right place.
Please read these before you post! —
Posts may use any of the Perl Monks Approved HTML tags:
- a, abbr, b, big, blockquote, br, caption, center, col, colgroup, dd, del, details, div, dl, dt, em, font, h1, h2, h3, h4, h5, h6, hr, i, ins, li, ol, p, pre, readmore, small, span, spoiler, strike, strong, sub, summary, sup, table, tbody, td, tfoot, th, thead, tr, tt, u, ul, wbr
You may need to use entities for some characters, as follows. (Exception: Within code tags, you can put the characters literally.)
| |
For: |
|
Use: |
| & | | & |
| < | | < |
| > | | > |
| [ | | [ |
| ] | | ] |
Link using PerlMonks shortcuts! What shortcuts can I use for linking?
See Writeup Formatting Tips and other pages linked from there for more info.