Abstract
Tomita's algorithm [Tomita 85] which treats context free grammars makes use of the breadth-first strategy to handle conflicts occurring in a LR parsing table. Considering the compatibility of a breadth-first strategy with parallel processing, we developed a parallel generalized LR parser called PLR, whose algorithm is based on Tomita's algorithm. PLR is implemented in GIIC[Ueda 85] that is a concurrent logic programming language developed by the Japanese 5th generation computer project. We made two kinds of implementations of PLR. One implementation does not uses the Graph Structured Stacks (GSSs) developed by Tomita, and the other implementation uses them. In this paper, we describe two implementations of PLR. Then to evaluate the ability of PLR, we compare the parsing time of PLR with that of PAX[Matsumoto 87] which is an efficient parallel parser implemented in GHC. The experiment revealed that PLR with no GSSs runs faster than PAX.
This is a preview of subscription content, log in via an institution to check access.
Preview
Unable to display preview. Download preview PDF.
References
Aho, A.V. and Ulman, J.D.: The Theory of Parsing, Translation, and Compiling, Prentice-Hall, Englewood Cliffs,New Jersey (1972)
Aho,A.V.,Senthi,R.and Ulman,J.D.: Compilers Principles, Techniques, and Tools,Addison-Wesley (1985)
Fuch,K. Furukawa,K. Mizoguchi,F.:Heiretu Ronri Gata Gengo GHC To Sono Ouyou, Kyoritsu Syuppan (1987) in Japanese
Knuth,D.E.: On the translation of languages from left to right,Information and Control 8:6,pp.607–639
Konno, A. Tanaka, II.: Hidari Gaichi Wo Kouryo Shita Bottom Up Koubun Kaiseki, Computer Softwear, Vol.3, No.2, pp.115–125 (1986) in Japanese
Nakata,I.:Compiler, Sangyo Tosyo (1981) in Japanese
Matsumoto, Y. Sugimura, R.: Ronri Gata Gengo Ni Motodsuku Koubun Kaiseki System SAX, Computer Softwear, Vol.3, No.4, pp.4–11 (1986) in Japanese
Matsumoto, Y.:A Parallel Parsing System for Natural Language Analysis, New Generation Computing, Vol.5, No. 1, pp.63–78 (1987)
Matsumoto, Y.:Natural Language Parsing Systems based on Logic Programming, Ph.D thesis of Kyoto University, (June 1989)
Mellish,C.S.:Computer Interpretation of Natural Language Descriptions, Ellis Horwood Limited (1985)
Nilsson, U.: AID:An Alternative Implementation of DCGs, New Generation Computing, 4, pp.383–399 (1986)
Okumura,M.:Sizengengo Kaiscki Ni Okeru Imiteki Aimaisei Wo Zoushinteki Ni Kaisyou Suru Keisan Model, Natural Language Analysis Working Group,Information Processing Society of Japan,NL71-1 (1989) in Japanese
Pereira, F.and Warren, D.: Definite Clause Grammar for Language Analysis-A Survey of the Formalism and a Comparison with Augmented Transition Networks, Artif. Intell, Vol.13, No.3, pp.231–278 (1980)
Tokunaga, T. Iwayama, M. Kamiwaki, T. Tanaka, H.:Natural Language Analysis System LangLAB, Transactions of Information Processing Society of Japan, Vol.29, No.7, pp.703–711 (1988) in Japanese
Tomita,M.:Efficient Parsing for Natural Language, Kluwer Academic Publishers (1985)
Tomita, M.: An Efficient Augmented-Context-Free Parsing Algorithm, Computational Linguistics, Vol.13, Numbers 1–2, pp.31–46 (1987)
Ueda,K.:Guarded Horn Clauses, Proc. The Logic Programming Conference, Lecture Notes in Computer Science, 221 (1985)
Uehara, K. Toyoda, J.: Sakiyomi To Yosokukinou Wo Motsu Jutugo Ronri Gata Koubun Kaiseki Program: PAMPS, Transactions of Information Processing Society of Japan, Vol.24, No.4, pp.496–504 (1983) in Japanese
Author information
Authors and Affiliations
Editor information
Rights and permissions
Copyright information
© 1991 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Numazaki, H., Tamura, N., Tanaka, H. (1991). Parallel generalized LR parser based on logic programming. In: Furukawa, K., Tanaka, H., Fujisaki, T. (eds) Logic Programming '89. LP 1989. Lecture Notes in Computer Science, vol 485. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-53919-0_7
Download citation
DOI: https://doi.org/10.1007/3-540-53919-0_7
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-53919-3
Online ISBN: 978-3-540-46398-6
eBook Packages: Springer Book Archive