From: Mark Davis ⌛ (email@example.com)
Date: Fri Aug 07 2009 - 15:53:14 CDT
As a first pass, you could try taking the bidi_mirroring_glyph property, and
look at the intersection of those with the open/close/start/end punctuation.
However, be aware that quote marks are tricky, and don't just match the
On Fri, Aug 7, 2009 at 12:54, Hans Aberg <firstname.lastname@example.org> wrote:
> On 7 Aug 2009, at 09:46, Joachim Durchholz wrote:
> Problem group 2: How to determine that two characters match?
>> Assuming I have an opening and a closing character and know they're
>> either parentheses or quotes: On what criteria could I base that they
>> match or don't?
>> E.g. ( would match ), but ( would not match ].
> This is a parsing problem, as for example in math semi-open intervals may
> be denoted by [x, y) and (x, y].
This archive was generated by hypermail 2.1.5 : Fri Aug 07 2009 - 15:54:38 CDT