On Mon Nov 30 10:13:09 EST 2009, jason.cat...@gmail.com wrote: > > it turns out that doing regular expressions is difficult, since > > it's not clear to me what [a-z] should match when unfolded. > > I have discovered a truly marvellous proof of this, which this memory > is too narrow to contain. > > 209 runes in an unfolded a-Ǯ superclass later... > 12498: signal: sys: segmentation violation
size isn't the real issue. the real issue is determining what the ranges are for other than the base character. if a maps to [aa'...] and z maps to [zz'...] it's not clear that [a'-z'] is a sensible set. for example what does [e-f] map to? [e-f], clearly but [ë-what?] - erik
