The table below shows nondeterministic rules for transforming an abstract syntax tree into an RDF graph.
The rules produce triples as side effects.
Each rule takes 0 or 1 arguments, and may return a result. Such arguments or results are nodes in the resulting graph. The argument allows for downwards propogation of nodes, whereas the result allows for upwards propogation.
Where the abstract syntax form has optional or repeated elements the corresponding part of the mapping rule is optional or repeated (or one of the special sequence rules).
The symbols in the rules either directly reflect abstract syntax trees, or reflect terms from the grammar to refer to a tree portion generated by the corresponding rule. When two or three tree portions are generated by the same rule subscripts are used to disambiguate.
subj rdf:type owl:ObjectProperty .are optional, but may only be omitted when the complete transformation generates one of the following triples:
subj rdf:type owl:SymmetricProperty . subj rdf:type owl:TransitiveProperty . subj rdf:type owl:InverseFunctionalProperty .