This ontology contains terms for defining a context-free grammar. The basic property is mustBeOneSequence which is equivalent to the expression of a production in the original simple BNF. Rules can be used to convert into and out of shorthand forms such as optional, repeating and token-separated list forms. Terminals are described either as a string, which is represented by itself, or are defined by a regular expression using cfg:matches.

Prefix

bnf

Keywords

computing language linguistics w3

Links

Homepage RDF Request Discussion

Pattern for Local Unique Identifiers

Missing LUI pattern

Example Local Unique Identifier

canStartWith   Resolve

Example CURIE

bnf:canStartWith

Pattern for RDF URIs

https://www.w3.org/2000/10/swap/grammar/bnf#$1

Example RDF URI

https://www.w3.org/2000/10/swap/grammar/bnf#canStartWith

Contact

Missing Contact

Contributors

submitter Charles Tapley Hoyt   0000-0003-4423-4370   cthoyt

A provider turns a local unique identifiers from a resource into a URI. Many providers are also resolvable as URLs (i.e., they can be used in a web browser).

The local unique identifier canStartWith is used to demonstrate the providers available for Backus-Naur form. Some providers may use a different example, which is displayed in the table below. A guide for curating additional providers can be found here.