Given the following rules:

S -> (P A A)

A -> S | AA | T

P -> + | -

T -> 0 | 1

Provide a formal definition of this grammar

Covert the grammar to Chomsky Normal form

Draw a PDA for this CFG

Provide the formal definition for this PDA

------------------------------------------------------------------------------------

Provide the grammar rules for the following language: { aⁿwbⁿ | w is a palindrome, n ? 0 }

-------------------------------------------------------------------------------------

Is { aⁿw^mbⁿ | w ? { a, b }*, n?m , n?0, and m ? n } a context free language? Show why.

-------------------------------------------------------------------------------------