 It is these closed item sets that are taken as the states of the parser, although only the ones that are actually reachable from the begin state will be included in the tables.Before the transitions between the different states are determined, the grammar is augmented with an extra rule

where S is a new start symbol and E the old start symbol.The parser will use this rule for reduction exactly when it has accepted the whole input string.