This paper proposes the UGLR parser as an extension of the GLR parser. A UG
LR parser is powerful enough to parse deterministically any phrase structur
e language if it is in the class of recursive languages and can parse any c
ontext free language as fast as the conventional GLR parser. Natural langua
ge processing often requires a parser for languages belonging to classes la
rger than that of context free languages, and the proposed parser is useful
for this purpose.