Anonymous user
BNF Grammar: Difference between revisions
Should not go in non-existent category
(Ada, a reference to the mandatory BNF of Ada) |
(Should not go in non-existent category) |
||
Line 1:
{{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.
| |||