Difference between revisions of "Backus–Naur Form"
From Wiki @ Karl Jones dot com
Karl Jones (Talk | contribs) (→See also) |
Karl Jones (Talk | contribs) (→External links) |
||
| Line 36: | Line 36: | ||
* [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 programming]] | ||
[[Category:Computer science]] | [[Category:Computer science]] | ||
Latest revision as of 06:10, 11 May 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:
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
