Precedence parsing using domolki's algorithm
暂无分享,去创建一个
A parsing Algorithm for the class of precedence grammars is described, using Domolki's algorithm. The main strategy of the algorithm is that with the detection of the right‐end of the handle of a right sentential form, the determination of the production rule necessary for reducing the string (thus the handle) is complete.
[1] Alfred V. Aho,et al. The Theory of Parsing, Translation, and Compiling , 1972 .
[2] Jan B. Hext,et al. Syntax Analysis by Domölki's Algorithm , 1970, Comput. J..
[3] Stephen Warshall,et al. A Theorem on Boolean Matrices , 1962, JACM.