BNF Grammar: Difference between revisions

Content added Content deleted

Inline

Revision as of 12:14, 22 June 2009 (view source) rosettacode>Dmitry-kazakov (Ada, a reference to the mandatory BNF of Ada) ← Older edit		Revision as of 14:29, 22 June 2009 (view source) rosettacode>Mwn3d (Should not go in non-existent category) Newer edit →
Line 1:		Line 1:
	{{task~~\|BNF GRAMMAR~~}}		{{task}}
	In computer science, Backus–Naur Form (BNF) is a metasyntax used to express context-free grammars: that is, a formal way to describe formal languages. John Backus and Peter Naur developed a context free grammar to define the syntax of a programming language by using two sets of rules: i.e., lexical rules and syntactic rules.		In computer science, Backus–Naur Form (BNF) is a metasyntax used to express context-free grammars: that is, a formal way to describe formal languages. John Backus and Peter Naur developed a context free grammar to define the syntax of a programming language by using two sets of rules: i.e., lexical rules and syntactic rules.