Give a BNF grammar for each of the languages below ab d T

Give a BNF grammar for each of the languages below.
<S> :: = ab <S> | <empty>

d. The set of all strings consisting of one or more digits. (Each digit is one of the characters o through 9) e. The set of all strings consisting of zero or more as with a semicolon after each One f. The set of all strings consisting of the keyword begin, followed by zero or more statements with a semicolon after each one, followed by the keyword end. Use the non-terminal

Solution

d. <S> ::= <digit><digit>| <digit>

<digit>::= 0|1|....|9 <digit>| <empty>

e. <S> ::=<S>; |<empty>

f. <S>::= begin <statements> end

<statements>::= <statement> ; <statements> | <statement> ;