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

Output requirements: output the current content of the stack and input after each action (either shift or reduce).

HELP PLEASE

LR parsing example