' Formal method of specifying context-free grammars. BNF was first used in the ALGOL-60 report, 1963. See Language and Grammar.

A standard form for representing formal grammars or other language models.

Is a way of representing a language and its grammar. A BNF grammar consists of production rules. These rules themselves are made up of terminal and non-terminal symbols. These are used to generate sentences. An example of a simple BNF grammar is as follows: ::= a | b b this grammar would generate sentences as such: a b aab abb aabb ababb

A language that is used to describe another language.

A formal notation for specifying the production rules of a syntax devised by John Backus and Peter Naur.

A meta-language for describing other languages, particularly computer languages.

A metalanguage used to formally describe the syntax of a language.

Formal method of specifying context-free grammars. BNF was first used in the ALGOL-60 report, 1963. See Languages and Context-Free Grammars.

A formal language used to define context-free grammars where a formal grammer consists of a set of rules with a left and right side separated by the symbol '::='. The left hand side is a nonterminal symbol and the right-hand side is a sequence of nonterminal symbols.