[Date Prev][Date Next][Thread Prev][Thread Next][Date Index][Thread Index]
Re: Non-deterministic content model
- From: Francis Norton <email@example.com>
- To: Robin Cover <firstname.lastname@example.org>
- Date: Fri, 15 Jun 2001 08:29:25 +0100
Robin Cover wrote:
> On Thu, 14 Jun 2001, Marcus Carr wrote:
> > Sam Willmott from OmniMark released a white paper on content model algebra
> > in the early nineties. He concluded that there was only one content model
> > that cannot be disambiguated and I have yet to see proof to the contrary.
> > The model is:
> > (x, (y, x)*, y?)
I'm trying to iterpret this interesting theory thread in the light of
existing validation technologies.
Taking the chess moves interpretation, the ambigous model above can be
implemented in Schematron as:
>The game must start with a white move.</sch:assert>
<sch:assert test="count(*) = count(white) + count(black)"
>The game may contain only black and white moves.</sch:assert>
>White moves must alternate with black moves.</sch:assert>
>Black moves must alternate with white moves.</sch:assert>
Is it equally simple to implement this ambiguous model in other schema