Consider the grammar

S A b C| D c A A a A d | E | f E e | C c | D d D |

3.1. Show that the grammar has a predictive recursive descent parser. You should show that the conditions of predictive parsing apply for every non-terminal. 3.2. Write parse_S(), parse_A(). Your parser should follow the general model of predictive parser that we saw in class. In particular, for non-terminals that can generate , the parser should check the FOLLOW set before choosing to parse the righthand side that generates . 3.3. Give a full execution trace for your parser from part 3.2 above on input a a d d .