The notion of the DCFL is closely related to the deterministic pushdown automaton (DPDA).
For example, the language of even-length palindromes on the alphabet of 0 and 1 has the unambiguous context-free grammar S → 0S0 | 1S1 | ε.
The complexity of the program and execution time of a deterministic pushdown automaton is vastly less than that of a nondeterministic one.
In the naive implementation, the latter must make copies of the stack every time a nondeterministic step occurs.
On the other hand, deterministic context-free languages can be accepted in O(n) time by an LR(k) parser.