PRI #231: Bidi Parenthesis Algorithm

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/