- From: Taki Kamiya <tkamiya@us.fujitsu.com>
- Date: Wed, 15 Oct 2008 15:18:24 -0700
- To: <yury_exi@yahoo.com>, <public-exi-comments@w3.org>
Hi Yuri, Given the following schema, which is a little more complex than the one you provided: <xs:sequence minOccurs="0" maxOccurs="unbounded"> <xs:element name="a" minOccurs="0" maxOccurs="unbounded"/> <xs:element name="b" minOccurs="0" maxOccurs="unbounded"/> <xs:element name="c" minOccurs="0" maxOccurs="unbounded"/> </xs:sequence> The normalized grammar would look like this: PTA : SE(A) PTA SE(B) PTB SE(C) PTC EE PTB: SE(B) PTB SE(C) PTC SE(A) PTA EE PTC: SE(C) PTC SE(A) PTA SE(B) PTB EE When you normalize the grammar, please remove self-recursion production with no terminal symbols of the form: G: G We failed to mention to remove such production during normalization, and we appreciate that you caught this issue. Thanks! -taki
Received on Wednesday, 15 October 2008 22:19:07 UTC