Editing Backus–Naur form (section)

{{Short description|Formalism to describe programming languages}}
{{Distinguish|Boyce–Codd normal form}}In [[computer science]], '''Backus–Naur form''' ('''BNF''', pronounced {{IPAc-en|ˌ|b|æ|k|ə|s|_|ˈ|n|aʊər}}), also known as '''Backus normal form''', is a notation system for defining the [[Syntax (programming languages)|syntax]] of [[Programming language|programming languages]] and other [[Formal language|formal languages]], developed by [[John Backus]] and [[Peter Naur]]. It is a [[metasyntax]] for [[Context-free grammar|context-free grammars]], providing a precise way to outline the rules of a language's structure. 

It has been widely used in official specifications, manuals, and textbooks on [[programming language theory]], as well as to describe [[Document format|document formats]], [[Instruction set|instruction sets]], and [[Communication protocol|communication protocols]]. Over time, variations such as [[extended Backus–Naur form]] (EBNF) and [[augmented Backus–Naur form]] (ABNF) have emerged, building on the original framework with added features.