[
Lists Home |
Date Index |
Thread Index
]
>
> Is there a regular expression or BNF grammar for anyURI?
>
Who needs a grammar? Surely this, from Schema part 2, is good enough for
any implementor:
Each URI scheme imposes specialized syntax rules for URIs in that
scheme, including restrictions on the syntax of allowed fragement
identifiers. Because it is impractical for processors to check that a
value is a context-appropriate URI reference, this specification follows
the lead of [RFC 2396] (as amended by [RFC 2732]) in this matter: such
rules and restrictions are not part of type validity and are not checked
by .minimally conforming. processors. Thus in practice the above
definition imposes only very modest obligations on .minimally
conforming. processors.
I'm still waiting for someone to tell me exactly what the "modest
obligations" are.
Michael Kay
|
