Difference between revisions of "Backus–Naur Form"
Karl Jones (Talk | contribs) (→See also) |
Karl Jones (Talk | contribs) |
||
| Line 21: | Line 21: | ||
* [https://en.wikipedia.org/wiki/Backus%E2%80%93Naur_Form Backus–Naur Form] @ Wikipedia | * [https://en.wikipedia.org/wiki/Backus%E2%80%93Naur_Form Backus–Naur Form] @ Wikipedia | ||
| + | |||
| + | [[Category:Computer science]] | ||
Revision as of 06:43, 21 April 2016
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, and communication protocols.
They are applied wherever exact descriptions of languages are needed: for instance, in official language specifications, in manuals, and in textbooks on programming language theory.
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).
The other main technique for writing context-free grammars is the van Wijngaarden form.
See also
External links
- Backus–Naur Form @ Wikipedia
