extended Backus-Naur form, aka extended Backus-Naur form, is an actively used grammar language created in 1977. 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...

42Years Old 20Users 0Jobs
  • extended Backus-Naur form ranks in the top 20% of languages
  • the extended Backus-Naur form wikipedia page
  • extended Backus-Naur form first appeared in 1977
  • file extensions for extended Backus-Naur form include ebnf
  • See also: pascal, xml, regex
  • I have 69 facts about extended Backus-Naur form. what would you like to know? email me and let me know how I can help.

Example code 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 code from Wikipedia:

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

Trending Repos

repo stars description

Last updated December 4th, 2019

Edit extended Backus-Naur form