An algorithm for reducing the size of the LR (k) parsing table and the computation time of the parser construction, called the "Union Scheme" is suggested in this paper. The resulting parser for ZED language in this algorithm reduce the number of LR (...
An algorithm for reducing the size of the LR (k) parsing table and the computation time of the parser construction, called the "Union Scheme" is suggested in this paper. The resulting parser for ZED language in this algorithm reduce the number of LR (1) parser states to 60% and reduce computation time to 20%, in direct comparision with the LR (k) parser of Knuth. This parser construction technique is able to cover all of the LR (k) grammars of Knuth.