<P> The language can easily be extended with control flows, arithmetical expressions, and Input / Output instructions . Then a small, usable programming language would be developed . </P> <P> Any grammar defined in EBNF can also be represented in BNF, though representations in the latter are generally lengthier . E.g., options and repetitions cannot be directly expressed in BNF and require the use of an intermediate rule or alternative production defined to be either nothing or the optional production for option, or either the repeated production of itself, recursively, for repetition . The same constructs can still be used in EBNF . </P> <P> The BNF uses the symbols (<,>,,:: =) for itself, but does not include quotes around terminal strings . This prevents these characters from being used in the languages, and requires a special symbol for the empty string . In EBNF, terminals are strictly enclosed within quotation marks ("..." or' ...'). The angle brackets ("<...>") for nonterminals can be omitted . </P> <P> BNF syntax can only represent a rule in one line, whereas in EBNF a terminating character, the semicolon, marks the end of a rule . </P>

Write a grammar for bnf (not ebnf e.g. no curly braces) in bnf