Difference between revisions of "Backus-Naur form"
Jump to navigation
Jump to search
| Line 2: | Line 2: | ||
[[BNF]] is a formal language that can be denoted in a collection of [[key-value pair]]s. For instance: | [[BNF]] is a formal language that can be denoted in a collection of [[key-value pair]]s. For instance: | ||
<syntaxhighlight> | <syntaxhighlight lang=BNF> | ||
<symbol> ::= __expression__ | <symbol> ::= __expression__ | ||
</syntaxhighlight> | </syntaxhighlight> | ||
Revision as of 11:24, 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__