15453 Formal Languages, Automata, and Computation
Lecture 8: ContextFree Grammars
There are many languages which cannot be recognized by a finite
automaton. Contextfree grammars (CFGs), originally developed for the
description of natural language, provide a more powerful means to define
languages. We define them and investigate some elementary examples and
properties of contextfree grammars. CFGs play an important role in
programming languages, since they are used to describe their syntax.
[ Home
 Schedule
 Assignments
 Handouts
 Overview
]
fp@cs
Frank Pfenning
