deterministic language

Show Summary Details

Quick Reference

Any context-free language recognized by a deterministic pushdown automaton. An example of a simple nondeterministic language is the set of all palindromes over an alphabet with two or more letters. A language is deterministic if and only if it is LR(k) for some k (see LR parsing).

Subjects: Computing.

Reference entries

Users without a subscription are not able to see the full content. Please, subscribe or login to access all content.