> Date: Wed, 23 Apr 2014 00:35:02 -0700 > From: Ilya Zakharevich <[email protected]> > Cc: Eli Zaretskii <[email protected]>, [email protected], unicode Unicode Discussion > <[email protected]>, James Clark <[email protected]> > > On Tue, Apr 22, 2014 at 09:06:27AM -0700, Asmus Freytag wrote: > > if you read UAX#9, the way the algorithm works is by pushing openers > > on a stack, then, on finding the first closer, going down the stack > > and attempting to locate a match, then, on finding a match, > > discarding any enclosed openers, on not finding a match, discarding > > the closer. > > I think I LOVE this definition.
Probably because you yourself wrote it ;-) > Simple, beautiful, and IMO following people’s expectations very > closely. I see nothing in your definition that is significantly different from our attempts. It does feel more complex, mainly because you have much more conditions, combining which in one's mind might not be easy at first reading. _______________________________________________ Unicode mailing list [email protected] http://unicode.org/mailman/listinfo/unicode
