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. Output requirements: output the current content of the stack and input after each action (either shift or reduce).

In short, I should be able to parse a tree for example: id*(id)$

LR parsing example