Difference between revisions of "Backus-Naur form"
Jump to navigation
Jump to search
m (Benkoo moved page Backus-Naur Form to Backus-Naur form) |
|||
| Line 1: | Line 1: | ||
{{WikiEntry|key=Backus-Naur Form|qCode=211577}}, often abbreviated as [[BNF]], is one of the two main notation techniques for context-free grammars in computer science. | {{WikiEntry|key=Backus-Naur Form|qCode=211577}}, 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 pair]]s. For instance: | |||
<syntaxhighlight> | |||
<symbol> ::= __expression__ | |||
</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__