Context-Free Languages

CFG, PDA, Chomsky normal form.

Log in to read this chapter

This chapter is part of GATE Computer Science. Log in to continue reading the full lessons, notes and practice.

What you'll learn in this chapter

Context-Free Grammars and Derivations

Pushdown Automata

Normal Forms and Pumping Lemma for CFLs

Closure Properties and Decidability of CFLs