Editing Backus–Naur form (section)

==Software using BNF or variants==

=== Software that accepts BNF (or a superset) as input ===
* [[ANTLR]], a parser generator written in [[Java (programming language)|Java]]
* [[Coco/R]], compiler generator accepting an attributed grammar in [[EBNF]]
* [[DMS Software Reengineering Toolkit]], program analysis and transformation system for arbitrary languages
* [[GOLD (parser)|GOLD]], a BNF parser generator
* RPA BNF parser.<ref>{{Citation | url = http://www.rpatk.net/web/en/onlinedemo.php | title = RPatk | contribution = Online demo | access-date = 2011-07-03 | archive-date = 2012-11-02 | archive-url = https://web.archive.org/web/20121102161746/http://www.rpatk.net/web/en/onlinedemo.php | url-status = dead }}</ref> Online (PHP) demo parsing: JavaScript, XML
* XACT X4MR System,<ref>{{Citation | title = Act world | contribution = Tools | url = http://www.actworld.com/tools/| archive-url = https://web.archive.org/web/20130129075050/http://www.actworld.com/tools/| url-status = dead| archive-date = 2013-01-29}}</ref> a rule-based expert system for programming language translation
* [[XPL]] Analyzer, a tool which accepts simplified BNF for a language and produces a parser for that language in XPL; it may be integrated into the supplied SKELETON program, with which the language may be debugged<ref>If the target processor is System/360, or related, even up to z/System, and the target language is similar to PL/I (or, indeed, XPL), then the required code "emitters" may be adapted from XPL's "emitters" for System/360.</ref> (a [[SHARE (computing)|SHARE]] contributed program, which was preceded by ''A Compiler Generator''<ref>{{cite book |title=A Compiler Generator |first1=W. M. |last1=McKeeman |first2=J.J. |last2=Horning |first3=D. B. |last3=Wortman |year=1970 |publisher=Prentice-Hall |isbn=978-0-13-155077-3 |url=https://archive.org/details/compilergenerato00mcke |url-access=registration}}</ref>)
* bnfparser<sup>2</sup>,<ref>{{Citation | url = http://bnfparser2.sourceforge.net/ | title = Source forge | contribution = BNF parser² | type = project}}</ref> a universal syntax verification utility
* bnf2xml,<ref>[http://sourceforge.net/projects/bnf2xml/ bnf2xml]</ref> Markup input with XML tags using advanced BNF matching
* [[JavaCC]],<ref>{{Cite web |url=https://javacc.java.net/ |title=JavaCC |access-date=2013-09-25 |archive-url=https://web.archive.org/web/20130608172614/https://javacc.java.net/ |archive-date=2013-06-08 |url-status=dead }}</ref> Java Compiler Compiler tm (JavaCC tm) - The Java Parser Generator

===Similar software===
*[[GNU bison]], GNU version of yacc
*[[Yacc]], parser generator (most commonly used with the [[Lex (software)|Lex]] preprocessor)
* Racket's parser tools, lex and yacc-style parsing (Beautiful Racket edition)
*[[Qlik]] Sense, a BI tool, uses a variant of BNF for scripting <ref>{{cite web |title=Script Syntax - Qlik Sense on Windows |url=https://help.qlik.com/en-US/sense/May2021/Subsystems/Hub/Content/Sense_Hub/Scripting/script-syntax.htm |access-date=10 January 2022 |website=Qlik.com |publisher=QlikTech International AB |ref=qlikscriptsyntax}}</ref>
* BNF Converter (BNFC<ref>{{Citation |title=Language technology |url=http://bnfc.digitalgrammars.com/ |contribution=BNFC |place=[[Sweden|SE]] |publisher=Chalmers}}</ref>), operating on a variant called "labeled Backus–Naur form" (LBNF). In this variant, each production for a given non-terminal is given a label, which can be used as a constructor of an [[algebraic data type]] representing that nonterminal. The converter is capable of producing types and parsers for [[abstract syntax]] in several languages, including [[Haskell (programming language)|Haskell]] and Java