What are the FIRST and FOLLOW sets for the following augmented grammar? The start nonterminal is E′.
| 0. E′ | → | E |
| 1. E | → | A |
| 2. E | → | L |
| 3. A | → | n |
| 4. A | → | i |
| 5. L | → | ( S ) |
| 6. S | → | E , S |
| 7. S | → | E |
Build the LR(0) finite-state machine for the grammar of the preceding problem, showing the full set of LR(0) items in each state. Number the states.
Show the SLR(1) parsing table for the grammar from the preceding problem, using the finite-state machine that you created. Show both the action and goto parts of the table.