%0 Conference Proceedings %T Probabilistic LR Parsing for General Context-Free Grammars %A Ng, See-Kiong %A Tomita, Masaru %Y Tomita, Masaru %Y Kay, Martin %Y Berwick, Robert %Y Hajicova, Eva %Y Joshi, Aravind %Y Kaplan, Ronald %Y Nagao, Makoto %Y Wilks, Yorick %S Proceedings of the Second International Workshop on Parsing Technologies %D 1991 %8 feb 13 25 %I Association for Computational Linguistics %C Cancun, Mexico %F ng-tomita-1991-probabilistic %X To combine the advantages of probabilistic grammars and generalized LR parsing, an algorithm for constructing a probabilistic LR parser given a probabilistic context-free grammar is needed. In this paper, implementation issues in adapting Tomita’s generalized LR parser with graph-structured stack to perform probabilistic parsing are discussed. Wright and Wrigley (1989) has proposed a probabilistic LR-table construction algorithm for non-left-recursive context-free grammars. To account for left recursions, a method for computing item probabilities using the generation of systems of linear equations is presented. The notion of deferred probabilities is proposed as a means for dealing with similar item sets with differing probability assignments. %U https://aclanthology.org/1991.iwpt-1.18 %P 154-163