{"prefix":"bnf","name":"Backus-Naur form","description":"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.","uri_format":"https://www.w3.org/2000/10/swap/grammar/bnf#$1","rdf_uri_format":"https://www.w3.org/2000/10/swap/grammar/bnf#$1","providers":[],"homepage":"https://www.w3.org/Addressing/BNF.html","example":"canStartWith","example_extras":[],"download_rdf":"https://www.w3.org/2000/10/swap/grammar/bnf","deprecated":false,"mappings":{},"synonyms":[],"keywords":["computing","language","linguistics","w3"],"publications":[],"appears_in":[],"depends_on":[],"namespace_in_lui":false,"contributor":{"name":"Charles Tapley Hoyt","orcid":"0000-0003-4423-4370","email":"cthoyt@gmail.com","github":"cthoyt"},"preferred_prefix":"bnf","github_request_issue":2016}