 Deterministic context-free grammar

A Deterministic Context-Free Grammar (DCFG) is a type of context-free grammar that can be processed by a deterministic pushdown automaton (PDA). This means that for a given input string, the automaton can determine its transitions without making any choices — it cannot have multiple possible moves at any point based on the same input symbol.