Write a recognizer for this grammar in the "recursive descent" style. That is, your solution should include a scanner function, as well as a collection of boolean functions that recognize the various parts of the grammar that contains the handout (we will walk through in class) if you need some design inspiration.

Your program should accept an input string S , then output its determination; that is, either:

S is a valid sentence in this grammar - OR - S is not a valid sentence in this grammar

where S is the input string. Use the following test cases:

m a+(b-c) -b z/w + x/y c*z d +/ e