BNF Grammar: Difference between revisions

There are many extensions and variants of BNF, including Extended and Augmented Backus–Naur Forms (EBNF and ABNF).

A BNF description of the language syntax is a part of its standard, [http://www.adaic.org/standards/1zrm/html/RM-P.html see Ada Reference Manual, Annex P].

A BNF description of the language syntax is a part of following,

[http://eli-project.sourceforge.net/a60_html/a60.html#s2 ALGOL 60 ][http://www.masswerk.at/algol60/syntax.txt -Syntax of ALGOL 60]

<div style="height:30ex;overflow:scroll"><pre>

! -----------------------------------------------------------------------

| Real

</pre></div>

<div style="height:30ex;overflow:scroll"><pre>

! -----------------------------------------------------------------------

</pre></div>

Code ::= Command Code | <NONE>

Command ::= "+" | "-" | "<" | ">" | "," | "." | "[" Code "]" | <ANY>

The Syntax follows, [http://c.comsci.us/syntax/index.html C Syntax]

The Syntax follows, [http://cpp.comsci.us/syntax/statement/index.html C++ Syntax]

See the following, [http://csharp.comsci.us/syntax/expression/ebnf.html C-sharp syntax]

See link [http://www.cs.vu.nl/~x/grammars/cobol/ COBOL Grammer]

IEBNF Syntax follows [http://www.felix-colibri.com/papers/compilers/delphi_5_grammar/delphi_5_grammar.html Dephi 5 Syntax]

The BNF description follows, [http://fortran.comsci.us/syntax/statement/index.html Fortran Syntax]

BNF-like description can be found at [http://haskell.org/onlinereport/index.html Haskell 98] Part I, chapters 2,3 and 4.

A draft [[J:Backus–Naur Form|BNF representation of J's syntax]] is up on the J wiki.

The BNF description follows, [http://www.cui.unige.ch/db-research/Enseignement/analyseinfo/JAVA/BNFindex.html BNF index of Java Language Grammar]

The BNF description follows, [http://javascript.comsci.us/syntax/statement/bnf.html JavaScript Syntax]

See link on syntax [http://cui.unige.ch/db-research/Enseignement/analyseinfo/LISP/BNFindex.html Lisp Syntax]

Outside of particularly restricted variants, no static grammar can exactly describe Lisp due to macros and reader-macros.

<div style="height:30ex;overflow:scroll"><pre>

chunk ::= {stat [`;´]} [laststat [`;´]]

Source: http://www.lua.org/manual/5.1/manual.html

See link on syntax [http://cui.unige.ch/db-research/Enseignement/analyseinfo/Modula2/BNFindex.html BNF Modula2]

[http://pari.math.u-bordeaux.fr/cgi-bin/viewcvs.cgi/trunk/src/language/parse.y?view=markup&revision=12950&root=pari parse.y] contains a grammar for GP. The grammar for PARI is that of [http://c.comsci.us/syntax/ C].

The [[wp:ISO 7185|ISO 7185]] standard for Pascal uses [[wp:Extended Backus–Naur Form|Extended Backus–Naur Form]].

Also [[wp:Van Wijngaarden grammar|Van Wijngaarden's grammar]] can be used to define

[[Pascal]]'s grammar[http://www-users.cs.york.ac.uk/~fisher/software/yoyovwg/exs/pascal.vwg].

The BNF description follows, [http://perl.comsci.us/syntax/statement/index.html Perl Syntax]

The BNF description follows, [http://php.comsci.us/syntax/statement/index.html PHP Syntax]

An annotated version of the PowerShell grammar can be found in Bruce Payette's book ''Windows PowerShell in Action''. The appendix containing the grammar is available in [http://www.manning.com/payette/AppCexcerpt.pdf PDF form] on the publisher's site.

<lang powershell>for (;;) {}</lang>

[http://docs.python.org/reference/grammar.html Python grammar].

Syntax follows [http://web.njit.edu/all_topics/Prog_Lang_Docs/html/ruby/yacc.html Ruby Syntax]

The [http://www.scala-lang.org/docu/files/ScalaReference.pdf Scala Specification] contains an Extended BNF under Scala Syntax Summary, Chapter A.

The formal syntax for Scheme is written in an extended BNF in [http://www.r6rs.org/final/html/r6rs/r6rs-Z-H-7.html#node_chap_4 chapter 4] of the [http://www.r6rs.org/final/html/r6rs/r6rs.html Revised^6 Report on the Algorithmic Language Scheme].

Syntax for SQL follows, [http://savage.net.au/SQL/sql-2003-2.bnf.html BNF Sytax for SQL Database Language]

Smalltalk Syntax follows, [http://github.com/aquasync/ruby-ometa/blob/60deea23abe7eb07d200233dde4213d74041b81f/smalltalk.syntax Smalltalk Syntax]

Though Tcl is not typically described using BNF, an approximation of the base language grammar can be written in a [[:Category:Tcl#Grammar|BNF-like grammar]]. Note however that the grammar properly omits things present in other languages (notably keywords) because it lacks them entirely; the analogs of them are merely parts of the standard language library.

<div style="height:30ex;overflow:scroll"><pre>

!===============================

</pre></div>

The following link (Appedix B) has a simple BNF Syntax [http://laser.physics.sunysb.edu/~amol/papers/mollypaper.pdf VB Syntax]

<div style="height:30ex;overflow:scroll"><pre>

<Identifier> ::= ID | QualifiedID !Any type of identifier

</pre></div>