We are adding augumented Grammar in starting of LR0 parser to make a state where we set as "accept " condition.
To construct a DFA that recognize the viable prefixes we make use of augmented grammar which is defined as follows
If $ G=(V,T,P,S)$ is given grammar then the augumented grammar will be as follows:
$ G1=(V \cup \left \{ S1 \right \},T,P\cup \left \{ S1\rightarrow S \right \},S1)$.
That is we add a unit production $ S1\rightarrow S$ to the grammar $ G$ and make S1 the new start symbol .The resulting grammar will be augumented grammar.
The purpose of augumented grammar is to make explicitly clear to parser when to accept the string.Parsing will stop when the parser is carrying out the reduction using $ S1\rightarrow S$.
