1. Write a grammar using BNF whose language consists of all even integers, e.g., 0, 2, 4, 24, 36, 578, etceteras.
2. Write a grammar whose language is the set of all characters strings consisting of the letters of the alphabet, digits, and the period such that the string begins with a letter and ends with a period (.). Use BNF. Example: AB12.3f.CD.
3. List the sets N, T, and V for the following grammar. ::= X |A | C | X | Y | ::= 0 | 8 | 8 | 8
4. Answer question #2 using a graphical meta language.