backus normal form vs. Backus Naur form

Backus-Naur Form, named after John W. Backus of the US and Peter Naur of Denmark, and usually written BNF, is the best-known example of a meta-language (q.v.), i.e. one that syntactically describes a programming language. Using BNF it is possible to ...

This paper addresses the graphical representation of Context-Free Grammars (CFG) written in extended Backus- Naur Form (EBNF), using UML class diagrams. These diagrams can help understand the grammar for users who are not familiar with concepts of EBNF ...

This paper presents the analogical conception of Chomsky normal form and Greibach normal form for linear, monadic context-free tree grammars (LM-CFTGs). LM-CFTGs generate the same class of languages as four well-known mildly context-sensitive grammars. ...