Due Monday, October 6, unless a hue and cry are raised
Write an algorithm for creating an LL(1) table for an arbitrary context free grammar that has been augmented with a rule of the form
S' --> S
where S is the start symbol of the original grammar, S' is not an element of the nonterminals of the original grammar, and $ is a new terminal symbol not an element of the terminals of the original grammar (the $ stands for end of file for actual strings).
Of course, you will create this algorithm based on the First and Follow sets that you construct from an given grammar using your First and Follow algorithms.