@prefix rdf: . @prefix owl: . @prefix rdfs: . @prefix xml: . @prefix xsd: . ; rdfs:comment """ 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. """; . rdfs:comment """A terminal, aka atomic, production, defined as string or regexp"""; rdfs:label "token"; rdfs:subClassOf . a rdf:Property; rdfs:comment """The production can only start with the given representative character. In the case that a token starts with always the same character, that is the one given. In th eevent that it can start with alpha character, 'a' is given; if it can start with a numeric, '0' is given as the value for this predicate. This predicate is used only when a predictive parser is possible and desired."""; rdfs:domain ; rdfs:label "can start with"; rdfs:range . rdfs:domain ; rdfs:label "comma-separated period-terminated list of"; rdfs:range . a rdf:Property; rdfs:comment """The given token is defined by the regular expression which a token must match"""; rdfs:domain ; rdfs:label "matches"; rdfs:range . rdfs:domain ; rdfs:range . a rdf:Property; rdfs:comment """This is the core property you need to define a BNF production. It defines the list of the only sequences to which a given term may expand. Each sequence is just a list of other productions in order. """; rdfs:domain ; rdfs:label "productions"; rdfs:range . rdfs:domain ; rdfs:label "zero or more"; rdfs:range .