Rosetta Code

BNF Grammar: Difference between revisions

Page Discussion

BNF Grammar (view source)

Revision as of 10:13, 17 August 2012

5,179 bytes removed ,  11 years ago
m
→‎Pascal: move to pacsal page
(Deprecated.)
m (→‎Pascal: move to pacsal page)
 
(8 intermediate revisions by 6 users not shown)
Line 6:
There are many extensions and variants of BNF, including Extended and Augmented Backus–Naur Forms (EBNF and ABNF).
 
'''This is a deprecated task. Please move these grammars to the language's category page, or somewhere else.'''
The task here is establish a BNF grammar for as many languages as possible to facilitate language categorization and translation.
=={{header|Ada}}==
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].
=={{header|ALGOL 60}}==
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]
 
=={{header[[:Category:BASIC|BASIC}}]]==
<div style="height:30ex;overflow:scroll"><pre>
! -----------------------------------------------------------------------
Line 179 ⟶ 174:
| Real
</pre></div>
=={{header[[:Category:BASIC Commodore PET|BASIC Commodore PET}}]]==
<div style="height:30ex;overflow:scroll"><pre>
! -----------------------------------------------------------------------
Line 386 ⟶ 381:
</pre></div>
 
=={{header[[:Category:Brainf***|Brainf***}}]]==
See syntax [http://ninh.nl/blog/2008/10/25/brainfck-birds-of-a-feather-session-take-2/ p.4 BNF BrainF*** Syntax]
 
Code ::= Command Code | <NONE>
=={{header|C}}==
Command ::= "+" | "-" | "<" | ">" | "," | "." | "[" Code "]" | <ANY>
The Syntax follows, [http://c.comsci.us/syntax/index.html C Syntax]
 
==[[:Category:PARI/GP|PARI/GP]]==
=={{header|C++}}==
[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 Syntax follows, [http://cpp.comsci.us/syntax/statement/index.html C++ Syntax]
 
==[[:Category:PowerShell|PowerShell]]==
=={{header|C sharp}}==
See the following, [http://csharp.comsci.us/syntax/expression/ebnf.html C-sharp syntax]
 
=={{header|COBOL}}==
See link [http://www.cs.vu.nl/~x/grammars/cobol/ COBOL Grammer]
 
=={{header|Delphi}}==
IEBNF Syntax follows [http://www.felix-colibri.com/papers/compilers/delphi_5_grammar/delphi_5_grammar.html Dephi 5 Syntax]
 
=={{header|Fortran}}==
The BNF description follows, [http://fortran.comsci.us/syntax/statement/index.html Fortran Syntax]
 
=={{header|Haskell}}==
BNF-like description can be found at [http://haskell.org/onlinereport/index.html Haskell 98] Part I, chapters 2,3 and 4.
 
=={{header|J}}==
 
A draft [[J:Backus–Naur Form|BNF representation of J's syntax]] is up on the J wiki.
 
=={{header|Java}}==
The BNF description follows, [http://www.cui.unige.ch/db-research/Enseignement/analyseinfo/JAVA/BNFindex.html BNF index of Java Language Grammar]
 
=={{header|JavaScript}}==
The BNF description follows, [http://javascript.comsci.us/syntax/statement/bnf.html JavaScript Syntax]
 
=={{header|Lisp}}==
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.
 
=={{header|Lua}}==
<div style="height:30ex;overflow:scroll"><pre>
chunk ::= {stat [`;´]} [laststat [`;´]]
 
block ::= chunk
 
stat ::= varlist `=´ explist |
functioncall |
do block end |
while exp do block end |
repeat block until exp |
if exp then block {elseif exp then block} [else block] end |
for Name `=´ exp `,´ exp [`,´ exp] do block end |
for namelist in explist do block end |
function funcname funcbody |
local function Name funcbody |
local namelist [`=´ explist]
 
laststat ::= return [explist] | break
 
funcname ::= Name {`.´ Name} [`:´ Name]
 
varlist ::= var {`,´ var}
 
var ::= Name | prefixexp `[´ exp `]´ | prefixexp `.´ Name
 
namelist ::= Name {`,´ Name}
 
explist ::= {exp `,´} exp
 
exp ::= nil | false | true | Number | String | `...´ | function |
prefixexp | tableconstructor | exp binop exp | unop exp
 
prefixexp ::= var | functioncall | `(´ exp `)´
 
functioncall ::= prefixexp args | prefixexp `:´ Name args
 
args ::= `(´ [explist] `)´ | tableconstructor | String
 
function ::= function funcbody
 
funcbody ::= `(´ [parlist] `)´ block end
 
parlist ::= namelist [`,´ `...´] | `...´
 
tableconstructor ::= `{´ [fieldlist] `}´
 
fieldlist ::= field {fieldsep field} [fieldsep]
 
field ::= `[´ exp `]´ `=´ exp | Name `=´ exp | exp
 
fieldsep ::= `,´ | `;´
 
binop ::= `+´ | `-´ | `*´ | `/´ | `^´ | `%´ | `..´ |
`<´ | `<=´ | `>´ | `>=´ | `==´ | `~=´ |
and | or
 
unop ::= `-´ | not | `#´
</pre></div>
Source: http://www.lua.org/manual/5.1/manual.html
 
=={{header|Modula-2}}==
See link on syntax [http://cui.unige.ch/db-research/Enseignement/analyseinfo/Modula2/BNFindex.html BNF Modula2]
 
=={{header|Pascal}}==
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].
 
=={{header|Perl}}==
The BNF description follows, [http://perl.comsci.us/syntax/statement/index.html Perl Syntax]
 
=={{header|PHP}}==
The BNF description follows, [http://php.comsci.us/syntax/statement/index.html PHP Syntax]
 
=={{header|PowerShell}}==
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.
 
Line 507 ⟶ 397:
<lang powershell>for (;;) {}</lang>
 
==[[:Category:VBScript|VBScript]]==
=={{header|Python}}==
The best EBNF syntax so far is at, [http://www.martinrinehart.com/articles/python-grammar.html Python EBNF Syntax]
=={{header|Ruby}}==
Syntax follows [http://web.njit.edu/all_topics/Prog_Lang_Docs/html/ruby/yacc.html Ruby Syntax]
=={{header|Scala}}==
The [http://www.scala-lang.org/docu/files/ScalaReference.pdf Scala Specification] contains an Extended BNF under Scala Syntax Summary, Chapter A.
=={{header|Scheme}}==
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].
=={{header|SQL}}==
Syntax for SQL follows, [http://savage.net.au/SQL/sql-2003-2.bnf.html BNF Sytax for SQL Database Language]
 
=={{header|Smalltalk}}==
Smalltalk Syntax follows, [http://github.com/aquasync/ruby-ometa/blob/60deea23abe7eb07d200233dde4213d74041b81f/smalltalk.syntax Smalltalk Syntax]
 
=={{header|Tcl}}==
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.
 
=={{header|VBScript}}==
<div style="height:30ex;overflow:scroll"><pre>
!===============================
Line 1,268 ⟶ 1,141:
</pre></div>
 
=={{header[[:Category:Visual Basic .NET|Visual Basic .NET}}]]==
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>
Retrieved from "https://rosettacode.org/wiki/Special:MobileDiff/117474...117483"