1. Consider the following grammar: a. Write pseudocode for a recursive function that returns true if a string is in this language and returns false otherwise. b. Is the string &W#W in this language?...

1. Consider the following grammar:

a. Write pseudocode for a recursive function that returns true if a string is in this language and returns false otherwise.

b. Is the string &W#W in this language?

2. Is + - ^abacd // ef + gh a prefix expression? Take the ^ sign for exponentiation. Explain in terms of the grammar for prefix expressions.