BNF Grammar: Difference between revisions

Content added Content deleted

Inline

Revision as of 08:16, 5 December 2009 (view source) 80.100.220.119 (talk) (added Haskell) ← Older edit		Revision as of 01:56, 9 December 2009 (view source) MikeMol (talk \| contribs) (Deprecated.) Newer edit →
Line 1:		Line 1:
	{{~~task~~}}		{{DeprecatedTask}}
	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.