[XML-DEV Mailing List Archive Home] [By Thread] [By Date] [Recent Entries] [Reply To This Message]

Re: should all XML parsers reject non-deterministic content models?

  • From: Daniel Veillard <Daniel.Veillard@i...>
  • To: James Clark <jjc@j...>
  • Date: Sun, 14 Jan 2001 12:39:02 +0100

Re: should all XML parsers reject non-deterministic content models?
On Sun, Jan 14, 2001 at 05:42:16PM +0700, James Clark wrote:
> Daniel Veillard wrote:
>  
> > On Sun, Jan 14, 2001 at 04:42:55PM +0900, TAKAHASHI Hideo(BSD-13G) wrote:
> > > Hello.
> > >
> > > I understand that the XML 1.0 spec prohibits non-deterministic (or,
> > > ambiguous) content models (for compatibility, to be precise).
> > 
> >   Note also that this is stated in a non-normative appendix.
> 
> It is also stated normatively in the body of the spec
> (http://www.w3.org/TR/REC-xml#sec-element-content): "For compatibility,
> it is an error if an element in the document can match more than one
> occurrence of an element type in the content model."

  Oops, right, I missed this sentence, sorry.

> >   In practice this is a very good rule because it allows to simplify
> > the validation of a content model a lot.
> 
> Complicating things for the user to make things simpler for the parser
> writer seems in general a bad trade-off to me.  Also this decreases
> interoperability (as you've observed). The only justification is
> compatibility with SGML.

  I'm more convinced by the agument that some content models may
not be expressable in an 1-unambiguous languages. But I'm still
a bit worried that either way interoperability will be a concern.
In this case compatibility with SGML generates risk of interoperability
problems between XML tools, "results are undefined" doesn't sound good
(http://www.w3.org/TR/REC-xml#dt-error).

> In fact, there is a very simple algorithm available that handles
> non-determinism just fine (it doesn't require you to construct a NFA and
> then do the subset construction).  See
> http://www.flightlab.com/~joe/sgml/validate.html (TREX uses a variation
> on this).

  Thanks for the pointer !
  
> The thesis proves the opposite: that there are some regular expressions
> that do not denote 1-unambiguous languages (see p52). She gives the
> example of
> 
>   (a|b)*,a,(a|b)

  Hum, right, this makes sense and is also stated in Appendix E.

    thanks a lot,

Daniel

-- 
Daniel Veillard      | Red Hat Network http://redhat.com/products/network/
daniel@v...  | libxml Gnome XML toolkit  http://xmlsoft.org/
http://veillard.com/ | Rpmfind RPM search engine http://rpmfind.net/

PURCHASE STYLUS STUDIO ONLINE TODAY!

Purchasing Stylus Studio from our online shop is Easy, Secure and Value Priced!

Buy Stylus Studio Now

Download The World's Best XML IDE!

Accelerate XML development with our award-winning XML IDE - Download a free trial today!

Don't miss another message! Subscribe to this list today.
Email
First Name
Last Name
Company
Subscribe in XML format
RSS 2.0
Atom 0.3
 

Stylus Studio has published XML-DEV in RSS and ATOM formats, enabling users to easily subcribe to the list from their preferred news reader application.


Stylus Studio Sponsored Links are added links designed to provide related and additional information to the visitors of this website. they were not included by the author in the initial post. To view the content without the Sponsor Links please click here.

Site Map | Privacy Policy | Terms of Use | Trademarks
Free Stylus Studio XML Training:
W3C Member
Stylus Studio® and DataDirect XQuery ™are products from DataDirect Technologies, is a registered trademark of Progress Software Corporation, in the U.S. and other countries. © 2004-2013 All Rights Reserved.