3. Consider the grammar S - ALCIDCA AaAdi El E-ele D-DI 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 SO, parse A0. Your parser should follow the general model of predictive parser that we saw in class. In particular for non-terminals that can generate E, the parser should check the FOLLOW set before choosing to parse the righthand side that generates E. 3.3. Give a full execution trace for your parser from part 3.2 above on input a add. 3. Consider the grammar S - ALCIDCA AaAdi El E-ele D-DI 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 SO, parse A0. Your parser should follow the general model of predictive parser that we saw in class. In particular for non-terminals that can generate E, the parser should check the FOLLOW set before choosing to parse the righthand side that generates E. 3.3. Give a full execution trace for your parser from part 3.2 above on input a add