Known: There will be 18 states, if there aren't 18 states, the answer is wrong.

Use L for param-list, P for param, T for type-expression, id for identifier.

Answer in a picture form, with boxes showing all the states and how it flows.

Example:

param-list param param-list , param param identifier : type-expression type-expression = int | List[ type-expression ] Construct the set of LR(1) items for the original grammar given above). L L'->L. S L ->P..S L->L.,P.S L' -> L L->P L->L,P P->id: T T-> int T-> List[T]