FUNDAMENTALS OF COMPUTER

Detailed explanation-1: -In computer science, Backus–Naur form (/ˌbækəs ˈnaʊər/) or Backus normal form (BNF) is a metasyntax notation for context-free grammars, often used to describe the syntax of languages used in computing, such as computer programming languages, document formats, instruction sets and communication protocols.

Detailed explanation-2: -BNF (Backus–Naur Form) is a context-free grammar commonly used by developers of programming languages to specify the syntax rules of a language.

Detailed explanation-3: -Backus-Naur notation (shortly BNF) is a formal mathematical way to describe a language, (to describe the syntax of the programming languages). where the LHS is a non-terminal symbol and the RHS is a sequence of symbols (terminals or non-terminals).

Detailed explanation-4: -BNF or EBNF are used to describe grammars of programming languages. The notation used for describing programming language grammars is slightly different from that which we have seen earlier in this chapter. This notation is referred to as Backus–Naur Form (BNF) or extended BNF (EBNF).

Detailed explanation-5: -Backus-Naur Form (BNF) notation In some texts, a name is also called a non-terminal symbol. Every name in Backus-Naur form is surrounded by angle brackets, < >, whether it appears on the left-or right-hand side of the rule.