Let S --> aA | Bb C --> a B--> b, A --> aBAD | SBBb
a. Describe which nonterminals are useless?
b. Write down the algorithm for finding useless/productive nonterminals
c. Describe how this gives you the algorithm for whether language generated by grammar is empty.