(computer science) A metalanguage that specifies which sequences of symbols constitute a syntactically valid program language. Abbreviated BNF.
On this page
- Animal Life
- Business & Finance
- Cars & Vehicles
- Entertainment & Arts
- Food & Cooking
- Health
- History, Politics, Society
- Home & Garden
- Law & Legal Issues
- Literature & Language
- Miscellaneous
- Religion & Spirituality
- Science
- Sports
- Technology
- Travel & Places
- Q & A
Backus-Naur form
McGraw-Hill Science & Technology Dictionary:
Backus-Naur form |
|
Featured Videos:
|
Related topics:
 | BNF (computer jargon) |
| SableCC |
| Kuroda normal form |
Help us answer these:
 | In how many forms can a constellation be form? |
| What form of copper forms a target? |
| What ion form does cobalt form? |
Post a question - any question - to the WikiAnswers community:
Copyrights:
 |
 | McGraw-Hill Science & Technology Dictionary. McGraw-Hill Dictionary of Scientific and Technical Terms. Copyright © 2003, 1994, 1989, 1984, 1978, 1976, 1974 by McGraw-Hill Companies, Inc. All rights reserved. Read more |
- What is Backus naur form?
- Example of backus-naur form with 8-digit number?
- Backus-Naur-Form Grammar of C language variable declaration?
Featured guides
Follow us
Facebook
Twitter
YouTube
Mentioned in
- BNF (computer jargon)
- SableCC
- Kuroda normal form
- Terminal value (computer science)
- Molecular Query Language
- Metasyntax
- Greibach normal form
- Binary combinatory logic
- Grammar framework
- Backus–Naur Form
- Peter Naur
- Wirth syntax notation
- Syntax diagram
- List of formal language and literal string topics
» More» More