- From: <bugzilla@wiggum.w3.org>
- Date: Thu, 15 Sep 2005 09:50:58 +0000
- To: public-qt-comments@w3.org
- Cc:
http://www.w3.org/Bugs/Public/show_bug.cgi?id=1850 ------- Additional Comments From davidc@nag.co.uk 2005-09-15 09:50 ------- > So this leads to the revised proposal as follows: This works for me. Only comment is that every character is a case variant of itself, so your rules 1 and 3 can be compressed to 1. When a normal character (Char) is used as an atom, it represents the set of case-variants of that character. For example, the regular expression "z" expands to "[zZ]". 3. A back-reference is compared using case-blind comparison: that is, each character must be a case-variant of the corresponding character of the previously matched string. For example, the strings "Mum", "mom", "Dad", and "DUD" all match the regular expression "([md])[aeiou]\1" when the "i" flag is used. I started to write this comment thinking that the re-write would make things clearer, highlighting that the characters are treated uniformly and there aren't really two cases here. However having done it perhaps it relies too much on the definition and the bit of extra redundancy in your wording is clearer, leave it to the editors to judge...
Received on Thursday, 15 September 2005 09:51:36 UTC