In computer science, Backus–Naur form (BNF; /ˌbækəs ˈnaʊər/; Backus normal form) is a notation used to describe the syntax of programming languages or...

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...

Translational Backus–Naur Form (TBNF or Translational BNF) refers to Backus–Naur form, which is a formal grammar notation used to define the syntax of...

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

acyclic graph (DAG) Document Object Model (DOM) Expression tree Extended Backus–Naur form Lisp, a family of languages written in trees, with macros to manipulate...

is declared before use which is impossible to describe in the extended Backus–Naur form and thus not easily detected during parsing. Attribute grammar...

(DFA)-based lexers with full Unicode support and lexical states. Extended Backus–Naur form grammar syntax. (Supports the *, ? and + operators). LALR(1) based...

an input to a parser generator. It often resembles Backus–Naur form (BNF), extended Backus–Naur form (EBNF), or has its own syntax. Grammar files describe...

Expression templates allow users to approximate the syntax of extended Backus–Naur form (EBNF) completely in C++. Parser objects are composed through...

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

arrays. In syntax diagrams they are used for grouping, such as in extended Backus–Naur form. In Mathematica and the Wolfram language, parentheses are used...

specified as a (possibly ambiguous) context-free grammar using an extended Backus–Naur Form; and a set of tree transformation rules, specified using pattern...

Originally proposed by Niklaus Wirth in 1977 as an alternative to Backus–Naur form (BNF). It has several advantages over BNF in that it contains an explicit...

be extended to handle non-atom-based graphs, also known as "reduced feature" graphs. The query language is based on an extended Backus–Naur form (EBNF)...

on New Year's Day 2024, at age 89. 21655 Niklauswirth asteroid Extended Backus–Naur form Wirth syntax notation Bucky bit Wirth–Weber precedence relationship...

</grammar> RELAX NG compact syntax is a non-XML format inspired by extended Backus–Naur form and regular expressions, designed so that it can be unambiguously...

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

by zero or more 0s). Comparison of regular expression engines Extended Backus–Naur form Matching wildcards Regular tree grammar Thompson's construction...

original 1964 Dartmouth BASIC written as a formal standard using an Extended Backus–Naur form with an associated test suite to ensure implementation complied...

for nitrogen or CCO for ethanol BNF (Backus normal form, or Backus–Naur form) and EBNF (extended Backus-Naur form) are the two main notation techniques...

diagrams Barker's notation Chen's notation Data Vault Modeling Extended Backus–Naur form IDEF1X Object-relational mapping Object-Role Modeling and Fully...

regular expression, but written out into multiple parts like in Extended Backus–Naur form. For example, instead of supporting POSIX character classes in...

language is specified using a context-free grammar expressed using Extended Backus–Naur Form (EBNF).[citation needed] ANTLR can generate lexers, parsers, tree...

which is a Type-2 grammar, generally given as production rules in Backus–Naur form (BNF). Phrase grammars are often specified in much more constrained...

formal language definition and through the Algol 60 Report introduced Backus–Naur form, a principal formal grammar notation for language design. There were...

SableCC In the manual, however, it is referred as L-attributed Extended Backus–Naur Form syntax (EBNF). Mössenböck, Hanspeter; Kepler, Johannes. "The Compiler...

annexes totaling 86 pages.[citation needed] One annex was an EBNF (Extended Backus-Naur Form, used to formally specify context free languages, enabling parsing...

extended Backus–Naur form). Dick Grune created a C program that would generate all possible productions of a W-grammar. The applications of Extended Affix...

Wirth, March 1995) using only 33 grammatical productions in the extended Backus–Naur form, as shown below. Module = MODULE ident ";" [ImportList] DeclSeq...

as given by the Language Report, is shown below. In the extended Backus–Naur form, only 34 grammatical productions are needed, one more than for Oberon-2...