Shift-Reduce Parser
Grammar:
0: E' → E $
1: E → E + T
2: E → T
3: T → T * F
4: T → F
5: F → ( E )
6: F → id
◀ Step
Step ▶
Reset
Auto
Step 0 / 13
Stack
Input
Action
Press "Step" to begin parsing.
Resulting AST