The first widely used formal notation for describing the syntax of a programming language; it was invented by John Backus. BNF was introduced as a defining mechanism in the Algol 60 Report (editor Peter Naur, 1928–2016) to describe the syntax of Algol 60. BNF is capable of describing any context-free language, and variants of it are still in use today.
A BNF grammar consists of a number of production rules, which define syntactic categories in terms of other syntactic categories, and of the terminal symbols of the language. Examples are shown in the diagram. The name of the syntactic category that is being defined is placed on the left, its definition on the right; the two are separated by the symbol ::=, read as ‘is defined to be’. The names of syntactic categories are enclosed by angle brackets. The symbol | is read as ‘or’.
See also extended BNF.
BNF. Production rules of a BNF grammar
- decimal system
- decimation
- decision analysis
- decision feedback equalizer
- decision gate
- decision-making
- decision nodes
- decision problem
- decision procedure
- decision rule
- decision support system
- decision surface
- decision table
- decision theory
- decision threshold
- decision tree
- decision tree analysis
- decision variables
- deci-(symbol: d)
- deci‐
- deck
- declaration
- Declaration of Independence
- Declarations of Indulgence
- declarative languages