::=	+ | * | ( ) |
	::=	a | b | . . . | z

Write a lexical analyzer (scanner) program for this BNF

This scanner should prompt the user to input a string, then output a list of tokens and lexemes , one per line, from the input string according to the above grammar. If something is wrong in the input stream it should output an error message of some kind and abandon the scan