Model group ambiguities

James K. Tauber jtauber at
Tue Jul 28 19:34:03 BST 1998

> it
> is possible to build an determenistic automat equal to the
> nondetermenistic
> one. So I thing it should be possible for the XML-Parser to eliminate
> such
> ambiguities automatically, without too much trouble. Or am I wrong?

>From the spec:

"Algorithms exist which allow many but not all non-deterministic content
models to be reduced automatically to equivalent deterministic models; see
Brüggemann-Klein 1991"


James Tauber / jtauber at
Lecturer and Associate Researcher
Electronic Commerce Network             (
Curtin Business School                  (
Perth, Western Australia                (

xml-dev: A list for W3C XML Developers. To post, mailto:xml-dev at
Archived as:
To (un)subscribe, mailto:majordomo at the following message;
(un)subscribe xml-dev
To subscribe to the digests, mailto:majordomo at the following message;
subscribe xml-dev-digest
List coordinator, Henry Rzepa (mailto:rzepa at

More information about the Xml-dev mailing list