Description
1. Consider the following context free language over alphabet Σ = {a, b, c, d}:
{ a
n b
m
c
m d
n | n, m ≥ 0 }
1.a. [4+1 points] Give a CFG for this language and briefly justify / explain how it
works. One point of the score will be for making the grammar unambiguous
and briefly explaining why that is so.
1.b [7 points] Describe a PDA for this language using the graphical notation
described in class on Wednesday.
eof