context-free grammar

English

Wikipedia

Noun

context-free grammar (plural context-free grammars)

1. (computing theory) a formal grammar in which every production rule is such that the left-hand side is exactly one non-terminal symbol and the right-hand side is zero or more terminal symbols and/or nonterminal symbols. Abbreviation: CFG.

Translations

formal grammar

Chinese: Mandarin: 上下文無關文法 (zh), 上下文无关文法 (zh) (shàngxiàwén wúguān wénfǎ) Croatian: kontekstno neovisna gramatika (hr) f.

Czech: bezkontextová gramatika (cs) f. Finnish: yhteydetön kielioppi (fi) Icelandic: samhengisfrjáls mállýsing (is) f.

See also

• pushdown automaton