Backus-Naur form

Hello, you have come here looking for the meaning of the word Backus-Naur form. In DICTIOUS you will not only get to know all the dictionary meanings for the word Backus-Naur form, but we will also tell you about its etymology, its characteristics and you will know how to say Backus-Naur form in singular and plural. Everything you need to know about the word Backus-Naur form you have here. The definition of the word Backus-Naur form will help you to be more precise and correct when speaking or writing your texts. Knowing the definition ofBackus-Naur form, as well as those of other words, enriches your vocabulary and provides you with more and better linguistic resources.

English

English Wikipedia has an article on:
Wikipedia

Etymology

From the names of computer science pioneers John Backus and Peter Naur. The notation was developed by Backus in 1959 (as Backus normal form) to describe computer languages, specifically ALGOL 58, and expanded and used by Naur in the ALGOL 60 report (the result of a January 1960 meeting). The name change to Backus-Naur form was at the suggestion of Donald Knuth.[1]

Pronunciation

Noun

Backus-Naur form (countable and uncountable, plural Backus-Naur forms)

  1. (computing) A formal notation for context-free grammars.
    • 1991, Bernd Teufel, Organization of Programming Languages, Springer, page 26:
      While context-free grammars (which, by the way, directly correspond to Backus-Naur forms) define the syntax of declarations, statements, and expressions, etc. (i.e. the structure of a program), the regular grammars define the syntax of identifiers, numbers, strings, etc. (i.e., the basic symbols of the language).
    • 2004, Jason H. Moore, Lance W. Hahn, Systems Biology Modeling in Human Genetics Using Petri Nets and Grammatical Evolution, Kalyanmoy Deb, et. al. (editors), Genetic and Evolutionary Computation, GECCO 2004, Proceedings, Part 1, Springer, LNCS 3102, page 396,
      Here, a Backus-Naur Form (BNF) grammar is specified that allows a computer program or model to be constructed by a simple genetic algorithm operating on an array of bits.
    • 2011, Airi Salminen, Frank Tompa, Communicating with XML, Springer, page 215:
      The most common syntactic metalanguage adopted in the computing world is Extended Backus-Naur Form (EBNF). There are many slightly different variants of EBNF, but all of them are based on Backus-Naur Form (BNF), developed in the 1960s for describing the syntax of the Fortran and Algol 60 programming languages.

Usage notes

The plural may be used when referring to instances of the notation's use (as a form of description of specific grammars) or to specific versions (especially extensions) of the notation.

In computer science, Backus-Naur form is now superseded by extended Backus-Naur form, a family of metasyntax notations encompassing BNF. An EBNF standard was adopted by the International Organization for Standardization (ISO) in 1996 as ISO/IEC 14977. Also in 1996, the World Wide Web Consortium (W3C) used an EBNF to specify XML.

Synonyms

Derived terms

Translations

See also

References

  1. ^ 1964, Donald E. Knuth, Backus normal Form vs Backus Naur Form, Communications of the ACM 7:12, pages 735–6.

Further reading

Wikious
Boobota
Sagapedia