5. (20) Parsing. Consider the CFG for in the slides for parsing (around P16). Trace the table driven parser on the following input program, as done in the class discussion: sum :- A + B write sum. Urarsing. Consider the CFG for in the slides for parsing (around P16). Trace the table driven parser on the following input program, as done in the class discussion: sum := A + B write sum. LL(1): example grammar 1. $$ 2. - | E 3. id := read id | write 4. 5. - 7. - | 8. + ( ) | id / number 9. -+ | - 10. + * | / 5. (20) Parsing. Consider the CFG for in the slides for parsing (around P16). Trace the table driven parser on the following input program, as done in the class discussion: sum :- A + B write sum. Urarsing. Consider the CFG for in the slides for parsing (around P16). Trace the table driven parser on the following input program, as done in the class discussion: sum := A + B write sum. LL(1): example grammar 1. $$ 2. - | E 3. id := read id | write 4. 5. - 7. - | 8. + ( ) | id / number 9. -+ | - 10. + * | /