' 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