Dealing with precedence and associativity rules in context free grammars (CFGs) has long posed a challenge. While they can be encoded in the structure of the CFG, the result can be difficult to work with and often obfuscates the language designer’s intent. Many parsing systems offer alternatives in the form of specialized precedence and associativity declarations, but these are limited and do not handle many similar situations such as the special rules surrounding a dangling else, the precedence of if in ML, or the interactions between new and function arguments in JavaScript. In this presentation, we show that tree automata can specify all of these while still allowing the CFG to be written in a natural manner. This unified theory subsumes and generalizes these other techniques and provides an elegant means of specifying grammatical restrictions. When applied to an existing CFG, this technique generates a new CFG that encodes the constraints from a given tree automata. This process is closed for LR(k) and LL(k) grammars and thus can be used as a preprocessing step that is compatible with existing parsing frameworks.