2 Recursive Descent Parsing Given the following grammar: ::= a a ::= b ::= c e Can recursive descent parser parse the grammar? If yes, please provide an argument. If not, can you rewrite the grammar such that it can be parsed by a recursive descent parser? Provide your argument and the parse table (if the grammar can be rewritten to describe the same language and can be parsed by the recursive descent parser). 2 Recursive Descent Parsing Given the following grammar: ::= a a ::= b ::= c e Can recursive descent parser parse the grammar? If yes, please provide an argument. If not, can you rewrite the grammar such that it can be parsed by a recursive descent parser? Provide your argument and the parse table (if the grammar can be rewritten to describe the same language and can be parsed by the recursive descent parser)