BottomupParser
Bottom-up parsing is a method of syntactic analysis in compilers that constructs a parse tree for a sequence of tokens by starting with the tokens and merging them into higher-level constructs until the start symbol is reached. It contrasts with top-down parsers that build the tree from the start symbol downward. The approach is well suited to deterministic parsing of many programming language grammars.
The most common form is shift-reduce parsing, implemented as LR parsing. The parser uses a stack to
Parse tables are divided into action and goto components. The action table tells whether to shift, reduce,
LR parsing belongs to the family of bottom-up parsers, including canonical LR(1), SLR(1), and LALR(1). Canonical
Bottom-up parsers are widely used in real-world compilers because of their efficiency and ability to handle