noun
deterministic context-free grammar
A context-free grammar for which a deterministic pushdown automaton exists; important in parsing theory and compiler construction.
LL法やLR法は決定的文脈自由文法のための構文解析アルゴリズムです。
LL and LR methods are parsing algorithms for deterministic context-free grammars.
A context-free grammar without the determinism restriction; every deterministic context-free grammar is a context-free grammar, but not vice versa.
A direct translation of the English term 'deterministic context-free grammar', combining 決定的 (deterministic) + 文脈自由文法 (context-free grammar).