A formal grammar in which every production rule replaces a single nonterminal symbol regardless of the symbols around it, expressive enough to describe the syntax of most programming languages and parsed by a pushdown automaton.
Facts
Core PrincipleRegardless of the symbols around it, a single nonterminal on the left hand side can always be replaced by the string on the right hand side. 1 Connections
Associated With
Source Wikipedia: Seymour Ginsburg
In Field
Sources
1. Context-free grammar - Wikipedia
Lead section
Regardless of which symbols surround it, the single nonterminal A on the left hand side can always be replaced by α on the right hand side.
References list, Chomsky citation
Chomsky, Noam (Sep 1956). "Three models for the description of language". IEEE Transactions on Information Theory. 2 (3): 113-124.
In Group: Models of Computation and Automata, Lead
In formal language theory, a context-free grammar (CFG) is a formal grammar whose production rules can be applied to a nonterminal symbol regardless of its context.
View the SourceWikipedia: Seymour Ginsburg
Wikimedia FoundationAssociated With: Seymour Ginsburg, Biography sectionQuote, Associated With: Seymour Ginsburg, Biography section
He studied context-free grammars and published a well-known comprehensive overview of context-free languages in 1966.
Reader Challenges (0)
No disputes yet. Spotted an error or a better source? Open the first one.
Sign in to dispute this or suggest a correction.