Let’s say I’m writing a program that strips combining characters and grapheme extenders from an input string.
For combining marks, I’m looking for any non-combining marks (e.g. `a`) followed by one or more combining marks (e.g. `̃`), and then I remove everything but the non-combining mark (e.g. leaving only `a`). Is this a correct approach?
What should the approach be for grapheme extenders? Should the program only look for `Grapheme_Base` characters followed by `Grapheme_Extend` characters (which includes the code points in `Other_Grapheme_Extend`)?
_______________________________________________
Unicode mailing list
Unicode_at_unicode.org
http://unicode.org/mailman/listinfo/unicode
Received on Wed Apr 23 2014 - 15:17:45 CDT
This archive was generated by hypermail 2.2.0 : Wed Apr 23 2014 - 15:17:46 CDT