Context-free grammar
This article needs additional citations for verification . Please help improve this article by adding citations to reliable sourc...
https://en.wikipedia.org/wiki/Context-free_grammar
* formal language
* formal grammar
* production rules
* nonterminal
* [1]
* Languages
* context-free languages
* language equality
* undecidable
* linguistics
* natural language
* Noam Chomsky
* computer science
* programming languages
* Extensible Markup Language
* Document Type Definition
* [2]
* linguistics
* phrase structure grammar
* dependency grammars
* computer science
* Backus–Naur form
* Pāṇini
* grammars
* recursively
* agreement
* reference
* Noam Chomsky
* [3]
* classification as a special type
* formal grammar
* phrase-structure grammars
* [4]
* dependency grammars
* generative grammar
* programming languages
* Algol
* Backus–Naur form
* [3]
* parsing algorithms
* Earley parser
* LR
* LL parsers
* tuple
* [5]
* Kleene star
* production rule
* string
* ordered pair
* empty string
* [6]
* pipe symbol
* reflexive transitive closure
* transitive closure
* [7]
* unreachable symbols
* unproductive symbols
* weakly equivalent
* [8]
* [9]
* [10]
* [11]
* regular
* regular
* nondeterministic finite automaton
* regular language
* brackets
* regular
* pumping lemma for regular languages
* infix
* parse tree
* ambiguous
* operator precedence
* formation rules
* parsers
* LL parsers
* LR parsers
* parse tree
* abstract syntax tree
* ambiguous grammar
* inherently ambiguous languages
* Chomsky normal form
* Greibach normal form
* polynomial-time
* CYK algorithm
* closed
* union
* concatenation
* Kleene star
* [12]
* substitution
* homomorphism
* [13]
* inverse homomorphism
* [14]
* intersection
* regular language
* [15]
* complementation
* [16]
* [17]
* context-sensitive grammars
* undecidable
* [18]
* [19]
* Turing machine
* halting problem
* computation history
* Turing machine
* [19]
* [20]
* [19]
* [20]
* Greibach's theorem
* ambiguous
* Post correspondence problem
* Post correspondence problem
* reversed
* agreement
* reference
* affix grammars
* attribute grammars
* indexed grammars
* two-level grammars
* regular expression
* [21]
* context-sensitive grammars
* generalized LR parsing
* nondeterministic grammars
* parser generators
* Chomsky
* transformation rules
* [4]
* passivization
* generative grammar
* Turing complete
* [22]
* [23]
* Gerald Gazdar
* Geoffrey Pullum
* cross-serial dependencies
* Swiss German
* [22]
* reduplication
* Bambara
* [24]
* [23]
* Hopcroft, John E.
* Ullman, Jeffrey D.
* Sipser, Michael
* ISBN
* 0-534-94728-X
* stack exchange answer
* more academic introductory materials