Difference between revisions of "Backus-Naur form"
Jump to navigation
Jump to search
| Line 5: | Line 5: | ||
<symbol> ::= __expression__ | <symbol> ::= __expression__ | ||
</syntaxhighlight> | </syntaxhighlight> | ||
In the example shown above, '''<symbol>''' denotes a key, and the '''__expression__''' denotes a value. | |||
Revision as of 11:26, 13 May 2022
Backus-Naur Form(Q211577), often abbreviated as BNF, is one of the two main notation techniques for context-free grammars in computer science.
BNF is a formal language that can be denoted in a collection of key-value pairs. For instance:
<symbol> ::= __expression__
In the example shown above, <symbol> denotes a key, and the __expression__ denotes a value.