The deterministic parsing of ambiguous grammar proposed by Johnson et al. is widely used in practical parser generating system, such as yacc, KPGS, etc. because the elimination of unit production for resolving the ambiguities can be easily done. But the technical correctness proof of the resolving conflicts are not done yet.
Recently, the technical result concerning the transformer of a deterministic parser to the equivalent context free grammar is proposed by Lee et al. using Machine Description Grammar.
But, Machine Description Grammar is enormously large. In thesis, we have proposed the reduced Machine Description Grammar And the automatic LALR(1) generator equivalent to a deterministic parser has been implemented. For the implementation, the state-item graph is defined as a model.
