Abstract

MLR, an extended t.R parser, is introduced, and its application to natural language parsing is discussed. An LR parser is a hift-reduce parser which is deterministically .quided by a parsing table. A parsing table can be obtained automatically from a contextfree phrase structure grammar, LR parsers cannot manage ambiguous gramlnars such as natural language grantmars, because their parsing tables would Itave multiply-delinud entries, which precludes deterministic parsing, MLR, however, can handle mulliply-defined entries, using a dynamic procjramnling method. When an input sentence is ambiguous, the MI.R parser produces all possible parse trees without parsing any part of the input sentence more than once in the same way, despite the fact that the parser does not maintain a chart as in chart ilarsing. Our method also prr)vides an elegant solution to the problem of multi-part-of.speech words such as "that". The MLR parser and its parsing table generator have been implemented at Carnegie-Mellon University, I

Citations

126	The Theory of Parsing, Translation, and Compiling - Aho, Ullman - 1972
124	Principles of Compiler Design - Aho, Ullman - 1977
72	The MIND system - Kay - 1973
39	Simple LR(k) Grammars - DeRemer - 1971
32	Deterministic parsing of ambiguous grammars - AHO, JOHNSON, et al. - 1975
1	L Practical Translators for LR(k) Languages - Oeremer - 1969
1	Phrase Structure Grammars and Natural Language - Gzder - 1983
1	On LLC(k) Parsing Method of LR(k) Grammars - Inoue, Fujiwara - 1983
1	A general syntactic processor - Kapisn - 1973
1	Sentence Disambiguation by a ShiR-Reduce Parsing Technique - Shieber - 1983