a) Given a Chomsky normal form grammar G. show how to add productions for single insertion. deletion. and mutation errors to (he grammar so that the enlarged grammar generates all possible token strings.
b) Modify the parsing algorithm in Exercise 4.63 so that. given any string W, it will find a parse for w that uses the fewest number of error productions.
Exercise 4.63 Given a grammar G in Chomsky normal form and an input string w = a la2 ... all' write an algorithm to determine whether w is in L(G)