Re: Fwd: Wired 4.09 p. 130: Lost in Translation

From: Michael Everson (
Date: Wed Aug 28 1996 - 11:57:03 EDT

At 16:30 1996-08-28, Martin J Duerst wrote:
>Please be careful. To know whether an A is just only an A, you only have
>to check the next position. If that next position is not a combining
>character, you know it is an A, if it is a combining character, you
>know it is "something else".

Yes, but it's not a once-off look, is it? Because you can stack combining
characters. So you know it's not an A, but you have to keep looking and
looking and looking, don't you? Doesn't this make processing much more
complex than Level 1 processing?


This archive was generated by hypermail 2.1.2 : Tue Jul 10 2001 - 17:20:31 EDT