Use Java to implement bottom-up LR parser for the following grammar and the parsing table. The sentence needs to be parsed is from keyboard input. The sentence always has a $ symbol at the end.

Use Java to implement bottom-up LR parser for the following grammar and the parsing table. The sentence needs to be parsed is from keyboard input. The sentence always has a $ symbol at the end. LR parsing example action goto T State * id + ( ) E F Grammar: o s5 54 1 2. 3 1 s6 acc r2 S7 r2 r2 r4 r4 r4 r4 s5 54 1. E->E+T 2. E->T 3. T->T*F 4. T->F 5. F->(E) 6. F->id 8 2 3 5 r6 r6 r6 r6 6 55 S4 9 3 7 55 54 10 8 S6 sli 9 ri S7 rl ri 10 r3 r3 r3 r3 11 r5 r5 r5 r5 2