- From: fantasai <fantasai.lists@inkedblade.net>
- Date: Wed, 06 Jun 2012 13:44:46 -0700
- To: "public-i18n-bidi@w3.org" <public-i18n-bidi@w3.org>
Thought this might be of interest to people here. -------- Original Message -------- Subject: PRI #231: Bidi Parenthesis Algorithm Date: Wed, 06 Jun 2012 13:00:35 -0700 From: announcements@unicode.org Reply-To: root@unicode.org To: announcements@unicode.org The Unicode Technical Committee is seeking feedback on a proposal to enhance the Unicode Bidirectional Algorithm (UAX #9) with additional logic--a bidirectional parenthesis algorithm (BPA)--for processing paired punctuation marks such as parentheses. This proposal is intended to produce better bidi-layout results in common text sequences that involve paired punctuation marks. Details of the proposal, with questions for reviewers and a detailed background document are available through the PRI #231 page: http://www.unicode.org/review/pri231/
Received on Wednesday, 6 June 2012 20:45:20 UTC