Alex and Rick,
> One thing maybe this raises is that we (DSDL'ers) have lost sight of the
> need for a specialised key/keyref type validation mechanism which (I
> believe) at one time was seen as a necessary part of the Standard.
Let's make sure whether Schematron does the job.
Consider the following schema. It is correct (as defined by the RNG
spec) but not compatible (as defined by the DTD compatibility spec).
start = element foo {bar1, bar2, ttt*}
bar1 = element bar1 {baz1}
bar2 = element bar2 {baz2}
baz1 = element baz {attribute id { ID }, xsd:string}
baz2 = element baz {xsd:int}
ttt = element ttt {attribute ref { IDREF } }
In Schematron, how can we say the following conditions?
1) bar/baz/@id are identifiers
2) ttt/@ref references to the identifiers
Application programmers can easily write programs for maintaining
hath tables if they understand 1) and 2).
If Schematron can meet the challenge, I am not sure if we need something
more.
Cheers,
-- MURATA Makoto <murata@hokkaido.email.ne.jp> -- DSDL members discussion list To unsubscribe, please send a message with the command "unsubscribe" to dsdl-discuss-request@dsdl.org (mailto:dsdl-discuss-request@dsdl.org?Subject=unsubscribe)Received on Mon May 12 01:29:29 2008
This archive was generated by hypermail 2.1.8 : Mon May 12 2008 - 08:48:16 UTC