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.
University of Washington
Autumn 2021
CSE 311 introduces theoretical computer science, the theory background necessary for other CSE courses, and how to construct rigorous, formal arguments. Topics include logic, set theory, modular arithmetic, induction, regular expression, and relations.
No concepts data
+ 33 more concepts