bn:03528710n
Noun Concept
Categories: 1956 in computer science, Programming language topics, Compiler construction, Articles with short description, Formal languages
EN
context-free grammar  CFG  Content free grammar  context-free grammars  Context free gramar
EN
In formal language theory, a context-free grammar is a formal grammar whose production rules are of the form A → α {\displaystyle A\ \to \ \alpha } with A {\displaystyle A} a single nonterminal symbol, and α {\displaystyle \alpha } a string of terminals and/or nonterminals. Wikipedia
Definitions
Relations
Sources
EN
In formal language theory, a context-free grammar is a formal grammar whose production rules are of the form A → α {\displaystyle A\ \to \ \alpha } with A {\displaystyle A} a single nonterminal symbol, and α {\displaystyle \alpha } a string of terminals and/or nonterminals. Wikipedia
Type of formal grammar Wikidata
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. Wiktionary
Formal grammar. Wiktionary (translation)
IS A
HAS KIND
HAS INSTANCE
OPPOSITE OF
Wikipedia
Wikidata
Wiktionary
Wikipedia Redirections
EN
Wikidata Alias
EN