Context-free grammars are formal grammars used to describe the structure of sentences and words in a natural language. They consist of production rules which can be applied to nonterminal symbols regardless of their context, and generate a language known as a context-free language. They are used in linguistics and computer science, and have applications such as describing the structure of programming languages and XML.
Carnegie Mellon University
Spring 2015
A foundational course that introduces formal languages, automata, computability, and complexity theories, including finite automata, Turing machines, and P/NP classes.
No concepts data
+ 35 more concepts