Programming Language

Exercises Exercise 1 Give a BNF grammar for each of the languages below. For example, a correct answer for "the set of all strings consisting of zero or more concatenated copies of the string ab" would be this grammar ab I There are often many correct answers. a. The set off all strings consisting of zero or more as. b. The set of all strings consisting of an uppercase letter followed by zero or more additional characters, each of which is either an uppercase letter or one of the digits 0 through 9. c. The set of all strings consisting of one or more as d. The set of all strings consisting of one or more digits. (Each digit is one of the characters 0 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