bn:03528710n
Noun Concept
Categories: Compiler construction, All Wikipedia articles written in American English, Articles with short description, All articles needing additional references, 1956 in computer science
EN
context-free grammar
EN
In formal language theory, a context-free grammar is a formal grammar in which every production rule is of the form A → α {\displaystyle A\ \to \ \alpha } where A {\displaystyle A} is a single nonterminal symbol, and α {\displaystyle \alpha } is a string of terminals and/or nonterminals. Wikipedia
Definitions
Relations
Sources
EN
In formal language theory, a context-free grammar is a formal grammar in which every production rule is of the form A → α {\displaystyle A\ \to \ \alpha } where A {\displaystyle A} is a single nonterminal symbol, and α {\displaystyle \alpha } is 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