COMP 3333- Worksheet 1- Parsing I. When implementing a "recursive descent parser", explain the approach to program the rule "N-t"- Where N is a non terminal, and t is a terminal 11. Using the given grammar. Explain the process for the implementation of a top down parser or LL parser. S>SalbBlaA A-> b B ->end III Reading bottom up tables table, and the following trace of Using the given a grammar the process of parsing a given string "id + id * id," Perform 3 more steps nput +id *id 6 (goto [O F idid Grammar 1. E>E+T 2. E-T 3, T-> T * F 4. T->F 6. F-id The given LR table Bottom up Parsing LR(I) Goto Stateid S5 1E E + T 2.E T 3.T T * F R2 S7 R2 R2 R4 R4 R4 R4 5.F ( E ) R6R6 6 S5 S5 S4 10 S11 R1 S7 R3 R3 RSRS R1 R3 R3 RSRS 10 Top Parse Stack Input ai ai-1 am Initial configuration: (0, a. .auS ) Parsing Code If ACTION/Sm a-SN (ie Shift N), the next configuration is -If ACTION [Sm, a-Reduce A- + and s-GOTO[S", A], where r-the length of the next con figuration is