Question

Give a BNF grammar for the language "The set of all strings consists of zero or more As".

Answer 1

The answer of the given question is:

<S> ::= A <S> | <empty>

Step-by-step explanation:

BNF (Backus-Naur notation) is the formal mathematical ways to describe the language.

It consists the following ways:

• set of the terminal symbol.
• set of the non-terminal symbol.
• set of production rule of form.

Syntax:

Left-Hand-Side ::= Right-Hand-Side