• To: <xml-dev@l...>,"Gustaf Liljegren" <gustaf.liljegren@b...>
• Subject: Re: Non-deterministic content models
• From: "Bob Foster" <bob@o...>
• Date: Tue, 15 Jul 2003 02:32:12 -0500
• References: <3.0.6.32.20030715055242.01069350@p...>

From: "Gustaf Liljegren" <gustaf.liljegren@b...>
> This wording makes me wonder if there is any case where a
non-deterministic
> content model would acctually be useful? That is, is the restriction a
> compromise, or can a non-deterministic content model always be simplified
> (like many algebraic expressions) to something shorter with the same
meaning?

No. The example usually trotted out is:

(a|b)*a(a|b)

This matches any sequence of two or more a's and b's with an a next to last.

Bob Foster

• References:
  • Non-deterministic content models
    • From: Gustaf Liljegren <gustaf.liljegren@b...>

• Prev by Date: Re: Non-deterministic content models
• Next by Date: Re: Non-deterministic content models
• Previous by thread: Re: Non-deterministic content models
• Next by thread: Re: Non-deterministic content models
• Index(es):
  • Date
  • Thread