EBNF - Grammar language

EBNF, aka extended Backus-Naur form, is a grammar language created in 1977 by Niklaus Wirth.

#441on PLDB

47Years Old

0Repos

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. EBNF is used to make a formal description of a formal language which can be a computer programming language. They are extensions of the basic Backus–Naur form (BNF) metasyntax notation. Read more on Wikipedia...

Tags: grammarLanguage
There are at least 0 EBNF repos on GitHub
EBNF on HOPL
CodeMirror package for syntax highlighting EBNF
Pygments supports syntax highlighting for EBNF
GitHub supports syntax highlighting for EBNF
See also: (3 related languages) Pascal, XML, Regular Expressions
1 PLDB concepts link to EBNF: Parsers

Example from Linguist:

(*
  Source:  https://github.com/io7m/jsom0
  License: ISC
*)

digit_without_zero =
  "1" | "2" | "3" | "4" | "5" | "6" | "7" | "8" | "9" ;

digit =
  "0" | digit_without_zero ;

positive =
  digit_without_zero , { digit } ;

natural =
  "0" | positive ;

real =
  [ "-" ] , digit , [ "." , { digit } ] ;

Example from Wikipedia:

function application = list( symbol, { expression } );

Language features

Feature	Supported	Example	Token
Comments	✓	(* A comment *)
MultiLine Comments	✓	(* A comment *)	(* *)
Semantic Indentation	X