RE: Model group ambiguities

James K. Tauber (jtauber@jtauber.com)
Wed, 29 Jul 1998 01:34:38 +0800

> 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; se=
e
Br=FCggemann-Klein 1991"
-- http://www.w3.org/TR/1998/REC-xml-19980210#determinism

James

--
James Tauber / jtauber@jtauber.com      http://www.jtauber.com/
Lecturer and Associate Researcher
Electronic Commerce Network             ( http://www.xmlinfo.com/
Curtin Business School                  ( http://www.xmlsoftware.com/
Perth, Western Australia                ( http://www.schema.net/