BNF Grammar: Difference between revisions
Deprecated.
(added Haskell) |
(Deprecated.) |
||
Line 1:
{{
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.
|