HTML Microdata document

This HTML5 document contains 41 embedded RDF statements represented using HTML+Microdata notation.

The embedded RDF content will be recognized by any processor of HTML5 Microdata.

Namespace Prefixes

Prefix	IRI
dcterms	http://purl.org/dc/terms/
dbo	http://dbpedia.org/ontology/
foaf	http://xmlns.com/foaf/0.1/
n7	https://global.dbpedia.org/id/
dbt	http://dbpedia.org/resource/Template:
rdfs	http://www.w3.org/2000/01/rdf-schema#
rdf	http://www.w3.org/1999/02/22-rdf-syntax-ns#
owl	http://www.w3.org/2002/07/owl#
wikipedia-en	http://en.wikipedia.org/wiki/
dbc	http://dbpedia.org/resource/Category:
dbp	http://dbpedia.org/property/
prov	http://www.w3.org/ns/prov#
xsdh	http://www.w3.org/2001/XMLSchema#
wikidata	http://www.wikidata.org/entity/
dbr	http://dbpedia.org/resource/

Statements

Subject Item: dbr:Translational_Backus-Naur_Form
dbo:wikiPageWikiLink: dbr:Translational_Backus–Naur_form
dbo:wikiPageRedirects: dbr:Translational_Backus–Naur_form

Subject Item: dbr:Translational_Backus–Naur_Form
dbo:wikiPageWikiLink: dbr:Translational_Backus–Naur_form
dbo:wikiPageRedirects: dbr:Translational_Backus–Naur_form

Subject Item: dbr:Backus–Naur_form
dbo:wikiPageWikiLink: dbr:Translational_Backus–Naur_form

Subject Item: dbr:Translational_Backus-Naur_form
dbo:wikiPageWikiLink: dbr:Translational_Backus–Naur_form
dbo:wikiPageRedirects: dbr:Translational_Backus–Naur_form

Subject Item: dbr:TBNF
dbo:wikiPageWikiLink: dbr:Translational_Backus–Naur_form
dbo:wikiPageRedirects: dbr:Translational_Backus–Naur_form

Subject Item: dbr:Translational_Backus–Naur_form
rdfs:label: Translational Backus–Naur form
rdfs:comment: Translational Backus–Naur Form (TBNF or Translational BNF) refers to Backus–Naur form, which is a formal grammar notation used to define the syntax of computer languages, such as Algol, Ada, C++, COBOL, Fortran, Java, Perl, Python, and many others. TBNF goes beyond BNF and extended BNF (EBNF) grammar notation because it not only defines the syntax of a language, but also defines the structure of the abstract syntax tree (AST) to be created in memory and the output intermediate code to be generated. Thus TBNF defines the complete translation process from input source code to intermediate code. Specification of the output intermediate code is optional, in which case you will still get automatic AST creation and have the ability to define its structure in the grammar.
dcterms:subject: dbc:Compiler_construction dbc:Compiling_tools dbc:Parser_generators
dbo:wikiPageID: 10095889
dbo:wikiPageRevisionID: 956146648
dbo:wikiPageWikiLink: dbc:Parser_generators dbr:Java_(language) dbr:Python_(language) dbr:Extended_Backus–Naur_form dbr:Association_for_Computing_Machinery dbr:Algol dbc:Compiling_tools dbr:COBOL dbr:Perl_(language) dbr:Backus–Naur_form dbr:Fortran dbr:C++ dbr:Ada_(programming_language) dbr:Abstract_syntax_tree dbc:Compiler_construction
owl:sameAs: wikidata:Q17142101 n7:g9ak
dbp:wikiPageUsesTemplate: dbt:Metasyntax_notations dbt:More_citations_needed dbt:Reflist
dbo:abstract: Translational Backus–Naur Form (TBNF or Translational BNF) refers to Backus–Naur form, which is a formal grammar notation used to define the syntax of computer languages, such as Algol, Ada, C++, COBOL, Fortran, Java, Perl, Python, and many others. TBNF goes beyond BNF and extended BNF (EBNF) grammar notation because it not only defines the syntax of a language, but also defines the structure of the abstract syntax tree (AST) to be created in memory and the output intermediate code to be generated. Thus TBNF defines the complete translation process from input source code to intermediate code. Specification of the output intermediate code is optional, in which case you will still get automatic AST creation and have the ability to define its structure in the grammar.
prov:wasDerivedFrom: wikipedia-en:Translational_Backus–Naur_form?oldid=956146648&ns=0
dbo:wikiPageLength: 5297
foaf:isPrimaryTopicOf: wikipedia-en:Translational_Backus–Naur_form

Subject Item: wikipedia-en:Translational_Backus–Naur_form
foaf:primaryTopic: dbr:Translational_Backus–Naur_form