In computer science, Backus–Naur form (BNF, pronounced /ˌbækəs ˈnaʊər/), also known as Backus normal form, is a notation system for defining the syntax...

In computer science, augmented Backus–Naur form (ABNF) is a metalanguage based on Backus–Naur form (BNF) but consisting of its own syntax and derivation...

In computer science, extended Backus–Naur form (EBNF) is a family of metasyntax notations, any of which can be used to express a context-free grammar....

computer languages are Backus–Naur form (BNF), extended Backus–Naur form (EBNF), Wirth syntax notation (WSN), and augmented Backus–Naur form (ABNF). Metalanguages...

grammar. They represent a graphical alternative to Backus–Naur form, EBNF, Augmented Backus–Naur form, and other text-based grammars as metalanguages. Early...

or contents. A syslog message is formatted (RFC 5424 gives the Augmented Backus–Naur form (ABNF) definition), but its MSG field is not. The network protocol...

"MUST" and "NOT RECOMMENDED" (as defined by RFC 2119 and 8174), augmented Backus–Naur form (ABNF) (RFC 5234) as a meta-language, and simple text-based formatting...

syntax are Abstract Syntax Notation One (an ISO standard) and augmented Backus–Naur form (an IETF standard). Finite-state machine models are used to formally...

protocols. The syntax of a urn: scheme URI is represented in the augmented Backus–Naur form as: namestring = assigned-name [ rq-components ] [ "#" f-component...

namespace name is usually applied as a prefix to the local name. In augmented Backus–Naur form: name = <namespace name> separator <local name> When local names...

with a JSON schema or XML schema. ASN.1 is visually similar to Augmented Backus-Naur form (ABNF), which is used to define many Internet protocols like HTTP...

modulated-frequency (touch-tone) grammars. It does not support Augmented Backus–Naur form (ABNF). Support for semantic interpretation script within grammars...

1995). "Extended Backus Naur Form". Compiler Basics. Retrieved 11 May 2011. Donald E. Knuth, "Backus Normal Form vs. Backus Naur Form", Communications...

in the 1960s. Parsing statements of the metalanguage resemble augmented Backus–Naur form with embedded tree-building directives. Unparsing rules include...

rules called a grammar. Backus–Naur form (BNF) describes the syntax of "sentences" of a language. It was developed by John Backus and used for the syntax...

Adaptive grammar Ambiguous grammar Backus–Naur form (BNF) Categorial grammar Concrete syntax tree Extended Backus–Naur form (EBNF) Grammar Grammar framework...

symbols to production rules. Production rules are commonly defined using Backus–Naur form. An LL parser is a type of parser that does top-down parsing by applying...

and constants. LOOP-programs have the following syntax in modified Backus–Naur form: P ::= x i := 0 | x i := x i + 1 | P ; P | L O O P x i D O P E N D...

graph and several connectivity matrices. The programmer may add new Backus–Naur form (BNF) productions to the graph. IMP72's syntax is extended by means...

most notably, of ALGOL 60, which introduced a syntax description in Backus–Naur form. However, context-free rules cannot express agreement or reference...

languages. Language designers often express grammars in a syntax such as Backus–Naur form; here is such a grammar, for a simple language of arithmetic expressions...

next line and the process continues. The grammar is listed below in Backus–Naur form, almost exactly as it was specified in the Design Note. In the listing...

the work was defined by 1961, and fleshed out and put into formal written form in 1962. The idea of hot potato routing dates from late 1960. Monica, 1776...