The system expressed in Backus-Naur Form looks something like this:.

Backus-Naur Form was one of the earliest used specification languages.

The grammar is listed below in Backus-Naur form.

Production rules are commonly defined using Backus-Naur form.

The following Backus-Naur Form example illustrates the interpreter pattern.

It became known as Backus-Naur form.

The rules are absolute and have a typical syntax representation known as Backus-Naur Form.

The file name loaded for Btrieve files in Backus-Naur form is:

This definition can also be written as a formal grammar in Backus-Naur form, provided the set of variables is finite:

Backus-Naur form:

We specify the syntax of Janus using Backus-Naur Form.

For instance, the following represents an integer (which may be signed) expressed in a variant of Backus-Naur form:

In linguistics, block structure is a representation of sentence grammar now most commonly associated with the Backus-Naur Form.

Backus-Naur form (A compact form for writing the productions of a context-free grammar.)

Given the sentence expressed in Backus-Naur Form:

Common methods to describe the syntax of statements are Backus-Naur Form and syntax diagrams.

The syntax of a URN is represented in Backus-Naur form as:

Extended Backus-Naur Form grammar syntax.

Wirth later incorporated some of the concepts (with a different syntax and notation) into Extended Backus-Naur Form.

The syntax for a URI may be expressed in Backus-Naur form as follows:

It is very similar to Backus-Naur form(BNF) notation.

GOLD grammars are based directly on Backus-Naur Form, regular expressions, and set notation.

It additionally supports evolving grammars in Backus-Naur Form and programs using an internal Turing complete programming language.

The Backus-Naur Form syntax used to describe modern programming languages have significant similarities to Pāṇini's grammar rules.

In Augmented Backus-Naur Form: