ConceptTheory & Algos
Context-free grammar
A formal grammar used to generate all possible strings in a given formal language.
Know first
Named as a prerequisite by the lectures that define this. The number is how many say so. A grey one has no page yet.
Opens up
Concepts that name this one as a prerequisite.
Lecturers
3Each in their own terms, from the easiest level.
Michael Sipser
A formal system consisting of a set of variables, terminal symbols, and production rules that define how to generate strings in a language.Brian Yu
A formal grammar where each production rule is of the form A -> alpha, where A is a single non-terminal symbol and alpha is a string of terminals and/or non-terminals.Eric DeGiuli
A formal grammar used to model language structure where syntax is independent of the context.
Lectures that assume it
5Connections
19The lectures that define it or assume it, and the concepts next to it.
Concepts9
Show 3 moreShow fewer
Lectures10
- Harvard CS50’s Artificial Intelligence with Python – Full University Course
- Regular Pumping Lemma, Conversion of FA to Regular Expressions
- Pushdown Automata, Conversion of CFG to PDA and Reverse Conversion
- CF Pumping Lemma, Turing Machines
- Statistical Physics of Generative Grammars
- P and NP, SAT, Poly-Time Reducibility