Definitions from Wiktionary (context-free grammar)
▸ noun: (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.
▸ Words similar to context-free grammar
▸ Usage examples for context-free grammar
▸ Idioms related to context-free grammar
▸ Wikipedia articles (New!)
▸ Words that often appear near context-free grammar
▸ Rhymes of context-free grammar
▸ Invented words related to context-free grammar
▸ noun: (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.
Similar:
Chomsky Normal Form,
context-free language,
formal grammar,
categorial grammar,
metagrammar,
item set,
formation rule,
closed formula,
combinator,
finite-state machine,
more...
Opposite:
Phrases:
▸ Words similar to context-free grammar
▸ Usage examples for context-free grammar
▸ Idioms related to context-free grammar
▸ Wikipedia articles (New!)
▸ Words that often appear near context-free grammar
▸ Rhymes of context-free grammar
▸ Invented words related to context-free grammar