next up previous contents
Next: The Chomsky Hierarchy Up: Notes on Formal Language Previous: The Pumping Lemma: Examples   Contents

CONTEXT-FREE LANGUAGES

In this section we examine the most popular type of grammars - context-free grammars - and we consider methods of making them more efficient, as well as their inherent limitations.



Subsections

James Power 2002-11-29