Bottom-up Table-driven (LR) Parsing
The most general form of this technique can be used for any language which can be recognized by a deterministic push down automaton.
As one might expect, the parser consists of a stack and a state machine which is derived from the grammar. The overall model is the following:[Aho, Lam, Sethi, and Ullman, Compilers, Fig. 4.35.]