Backus–Naur Form

In computer science, BNF (Backus Normal Form or Backus–Naur Form) is one of the two main notation techniques for context-free grammars.

Description

Context-free grammars are often used to describe the syntax of languages used in computing, such as:

• Computer programming languages
• Document formats
• Instruction sets
• Communication protocols

They are applied wherever exact descriptions of languages are needed. for instance in:

• Official language specifications
• Manuals
• Textbooks on programming language theory

Extensions and variants

Many extensions and variants of the original Backus–Naur notation are used; some are exactly defined, including Extended Backus–Naur Form (EBNF) and Augmented Backus–Naur Form (ABNF).

van Wijngaarden form

The other main technique for writing context-free grammars is the van Wijngaarden form.

See also

• Attribute grammar
• Computer science
• Formal grammar
• Syntax (programming languages)
• Van Wijngaarden grammar

External links

• Backus–Naur Form @ Wikipedia