Sign inSign in

Context-free grammar

A formal grammar used to generate all possible strings in a given formal language.
as Michael Sipser defines itMITThe wording closest to all 5 definitions
Watch it explained

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

3

Each in their own terms, from the easiest level.

  • Michael Sipser

    MIT · Undergraduate

    A formal system consisting of a set of variables, terminal symbols, and production rules that define how to generate strings in a language.
    • 1:00:26Regular Pumping Lemma, Conversion of FA to Regular Expressions
    • 4:04Pushdown Automata, Conversion of CFG to PDA and Reverse Conversion
  • Brian Yu

    Harvard University · Undergraduate

    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.
    • 10:51:48Harvard CS50’s Artificial Intelligence with Python – Full University Course
  • Eric DeGiuli

    International Centre for Theoretical Physics · Research

    A formal grammar used to model language structure where syntax is independent of the context.
    • 22:56Statistical Physics of Generative Grammars

Lectures that assume it

5

Connections

19

The lectures that define it or assume it, and the concepts next to it.

3 lecturers. Definitions are written by AI from each lecture’s transcript. A time with a play mark starts the lecture at the moment the lecturer says it.