| Backus-naur Form |
Website Links For Form |
Information AboutBackus-naur Form |
|
BNF is widely used as a Notation for the Grammar s of computer Programming Language s, Command Set s and Communication Protocol s, as well as a notation for representing parts of Natural Language grammars (for example, ''meter'' In Venpa Poetry .) Most textbooks for programming language theory and/or semantics document the programming language in BNF. Some variants, such as ''augmented'' Backus-Naur Form (ABNF), have their own documentation. Overview BNF was originally named after John Backus and later (at the suggestion of Donald Knuth ) also after Peter Naur . They were two pioneers in Computer Science , especially in the art of Compiler Design . The Backus-Naur Form or BNF grammars have significant similarities to 's grammar rules, and is sometimes also referred to as Panini-Backus Form. BNF was created as part of creating the rules for Algol 60 . Introduction A BNF specification is a set of Derivation Rules , written as   |
<personal-part> :: |
<first-name> <initial> "" |
  |
<or-expression> :: |
<whitespace> <list-expression> [ "" |
  |
| "ftp://ftprfc-editororg/in-notes/rfc4234txt" class="copylinks" target="_blank">RFC 4234 Augmented BNF for Syntax Specifications: ABNF |
|
|
|