-
Notifications
You must be signed in to change notification settings - Fork 3
New issue
Have a question about this project? Sign up for a free GitHub account to open an issue and contact its maintainers and the community.
By clicking “Sign up for GitHub”, you agree to our terms of service and privacy statement. We’ll occasionally send you account related emails.
Already on GitHub? Sign in to your account
n-triples documents that cannot be converted to RDF graphs #33
Comments
RDF EBNF grammars have always used a simple terminal production for matching There are tests that look for bad IRIs and languages, but they could be better. In particular, a test that had a language tag that was accepted by the grammar but was invalid according to BCP47 would be good to have. There are IRI (URI) tests that pass through the grammar, but are expected to be detected as illegal. |
BCP47 is not immutable. It tracks the latest RFC.
Like any syntax deviation - it is out of scope. A similar situation occurs with the IRIREF rule. Or illegal Unicode sequences in strings. Replicating the full grammars would make the specs unwieldy even when possible. There are practicality issues for that. Programming language libraries do not always track the latest specs, preferring backwards-compatibility. URI is a moving target c.f. RFC6874, or URN changes in RFC8141 which invalidates syntax legal by RFC2141. For language tags there are also the special cases allowed by RFC 3066 and continued in RFC4646 and RFC5646. |
|
The RDF n-triples specifies language tags as
But RDF concepts specifies language tags as follows
The pointer into BCP47 ends up at a grammar that is considerably more restrictive.
What happens if the language tag in an n-triples document does not conform to this grammar?
This problem might affect other surface syntaxes for RDF.
The text was updated successfully, but these errors were encountered: