W3C home > Mailing lists > Public > xmlschema-dev@w3.org > June 2001

Re: ASN.1 => XML Schema questions

From: Martin Duerst <duerst@w3.org>
Date: Wed, 27 Jun 2001 16:01:07 +0900
Message-Id: <4.2.0.58.J.20010627155334.033cf6b0@sh.w3.mag.keio.ac.jp>
To: Geoff Elgey <elgey@dstc.qut.edu.au>
Cc: xmlschema-dev@w3.org
At 16:42 01/06/27 +1000, Geoff Elgey wrote:

>Martin Duerst wrote:

> > I'm very curious how ASN.1 solves this problem.
>
>The encoding rules (such as BER/DER) explicitly specify (using a tag and
>length) each particular SET within a SEQUENCE. So the ambiguous string
>"xyzyx" would actually be something like  "{ {xy},{zyx} }" under
>BER/DER, so that there are no ambiguities in its interpretation.
>
>I was hoping to achieve the same result by using <all>* for a sequence
>of sets, but there are still ambiguities. I'll use another method for
>representing sequence of sets, that explicitly delimits each set.

I see. ASN.1 cannot do magic, it has to use delimiters.
Why did you think XML Schema can do magic and work
without delimiters?

So what you may want is to have the same delimiter everywhere
rather than using a different delimiter for every type.
I guess this should be possible with local declarations.
Maybe you should try to work out an example.


Regards,   Martin.
Received on Wednesday, 27 June 2001 03:36:09 GMT

This archive was generated by hypermail 2.2.0+W3C-0.50 : Tuesday, 11 January 2011 00:14:21 GMT