This page uses content from Wikipedia and is licensed under CC BY-SA.

In formal language theory, **deterministic context-free languages** (**DCFL**) are a proper subset of context-free languages. They are the context-free languages that can be accepted by a deterministic pushdown automaton. DCFLs are always unambiguous, meaning that they admit an unambiguous grammar. There are non-deterministic unambiguous CFLs, so DCFLs form a proper subset of unambiguous CFLs.

DCFLs are of great practical interest, as they can be parsed in linear time, and various restricted forms of DCFGs admit simple practical parsers. They are thus widely used throughout computer science.

The notion of the DCFL is closely related to the deterministic pushdown automaton (DPDA). It is where the language power of pushdown automatons is reduced to if we make them deterministic; the pushdown automatons become unable to choose between different state-transition alternatives and as a consequence cannot recognize all context-free languages.^{[1]} Unambiguous grammars do not always generate a DCFL. For example, the language of even-length palindromes on the alphabet of 0 and 1 has the unambiguous context-free grammar S → 0S0 | 1S1 | ε. An arbitrary string of this language cannot be parsed without reading all its letters first, which means that a pushdown automaton has to try alternative state transitions to accommodate for the different possible lengths of a semi-parsed string.^{[2]}

Deterministic context-free languages can be recognized by a deterministic Turing machine in polynomial time and O(log^{2} *n*) space; as a corollary, **DCFL** is a subset of the complexity class **SC**.^{[3]} The set of deterministic context-free languages is not closed under union but is closed under complement.

The languages of this class have great practical importance in computer science as they can be parsed much more efficiently than nondeterministic context-free languages. 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. The best known algorithm to test membership in any context-free language is Valiant's algorithm, taking O(*n*^{2.378}) time, where n is the length of the string. On the other hand, deterministic context-free languages can be accepted in O(*n*) time by an LR(k) parser.^{[4]} This is very important for computer language translation because many computer languages belong to this class of languages.

- Context free language
- Deterministic pushdown automaton
- Deterministic context-free grammar
- Simple deterministic language

**^**Hopcroft, John; Jeffrey Ullman (1979).*Introduction to automata theory, languages, and computation*. Addison-Wesley. p. 233.**^**Hopcroft, John; Rajeev Motwani; Jeffrey Ullman (2001).*Introduction to automata theory, languages, and computation 2nd edition*. Addison-Wesley. pp. 249–253.**^**Cook, Stephen A. (April 30 – May 2, 1979). "Deterministic CFL's are accepted simultaneously in polynomial time and log squared space".*Proceedings of the eleventh annual ACM symposium on Theory of computing - STOC '79*. Atlanta. pp. 338–345. doi:10.1145/800135.804426.**^**Knuth, D. E. (July 1965). "On the translation of languages from left to right" (PDF).*Information and Control*.**8**(6): 607–639. doi:10.1016/S0019-9958(65)90426-2. Retrieved 29 May 2011.