Abstract
A parser based on logic programming language (DCG) has very useful features; perspicuity, power, generality and so on. However, it does have some drawbacks in which it cannot deal with CFG with left recursive rules, for example. To overcome these drawbacks, a Bottom-Up parser embedded in Prolog (BUP) has been developed. In BUP, CFG rules are translated into Prolog clauses which work as a bottom-up left corner parser with top-down expectation. BUP is augmented by introducing a “link” relation to reduce the size of a search space. Furthermore, BUP can be revised to maintain partial parsing results to avoid computational duplication. A BUP translator and a BUP tracer which support the development of grammar rules are described.
Similar content being viewed by others
References
Pereira, L., Pereira, F. and Warren, D.: “User’s Guide to DEC System-10 Prolog”, (Department of Artificial Intelligence, University of Edinburgh, Sept. 1978).
Pereira, F. and Warren, D.: “Definite Clause Grammar for Language Analysis—A Survey of the Formalism and a Comparison with Augmented Transition Networks”, Artificial Intelligence,13 (May, 1980) 231–278.
Aho, A. V. and Ullman, J. D.: “The Theory of Parsing, Translation, and Compiling, vol. 1 Parsing” (Prentice-Hall, 1972).
Earley, J.: “An Efficient Context-free Parsing Algorithm” Ph.D. Thesis (Carnegie-Mellon University, 1968).
Pratt, V. R.: “A Linguistic Oriented Programming Language”, Proc. of 3rd IJCAI (Aug. 1973) 372–381.
Pratt, V. R.: “LINGOL—A Progress Report”, Proc. of 4th IJCAI (Aug. 1975) 422–428.
Miyoshi, H. et. al.: “Bottom-Up DCG Parser User’s Manual”, ICOT Technical Memo,No. 6 (1982).
Author information
Authors and Affiliations
About this article
Cite this article
Matsumoto, Y., Tanaka, H., Hirakawa, H. et al. BUP: A Bottom-Up parser embedded in Prolog. New Gener Comput 1, 145–158 (1983). https://doi.org/10.1007/BF03037421
Issue Date:
DOI: https://doi.org/10.1007/BF03037421