BNF : Java Glossary

BNF
BNF (Backus-Naur Form) A way of formally describing the grammar of a language or set of commands. Each element in the language is described in terms of its component elements, which in turn are described by their components. There can be mandatory, optional or repeating elements. Definitions of terms can be recursive. The term BNF is loosely used to describe any scheme for describing a grammar from Burroughs railway diagrams to LALR (Look Ahead Left-to-Right parse) though properly it refers to Backus’s original. It is useful mainly for language lawyers. People understand a grammar best from a carefully chosen set of examples.

CMP homejump to top You can get the freshest copy of this page from: or possibly from your local J: drive (Java virtual drive/mindprod.com website mirror)
http://mindprod.com/jgloss/bnf.html J:\mindprod\jgloss\bnf.html
logo
Please email your , letters to the editor, errors, omissions, typos, formatting errors, ambiguities, unclear wording, broken/redirected link reports, suggestions to improve this page or comments to Roedy Green : feedback email. If you want your message, your name or email kept confidential, not considered for public posting, please explicitly specify that. Unless you state otherwise, I will treat your message as a letter to the editor that I may or may not publish in the feedback section. After that, it will be too late to retract it. If you disagree with something I said, please quote it and cite the web page where you found it, tell me why you think it is wrong, and, if possible, provide some supporting evidence. Threatening to kill me or spouting obscenities has yet to persuade me to change my mind.
mindprod.com IP:[65.110.21.43]
view BlogYour face IP:[38.107.179.214]
You are visitor number 11,610.