The paper deals (in a categorical approach) with the invariance problem of a given parsing property with respect to a given grammar transformation. For this purpose, a deterministic bottom-up parse step is characterized as categorical limit, which allows ''both, systematic grammar type definition and largely strategy-independent invariance proofs. The resulting abstract parsing property BU (Bottom Up), compared to the \(LR^ k\)-type, are the invariants studied in this paper.'' Results: a hierarchy of deterministic grammar classes, invariance conditions for transformations (language preserving grammar morphisms) and their inverses, the difference between BU- and \(LR^ k\)-grammars, etc.