In formal grammar theory, the deterministic context-free grammars are a proper subset of the context-free grammars. They are the subset of context-free grammars that can be derived from deterministic pushdown automata, and they generate the... Wikipedia