BUP: A Bottom-Up parser embedded in Prolog |
| |
Authors: | Yuji Matsumoto Hozumi Tanaka Hideki Hirakawa Hideo Miyoshi Hideki Yasukawa |
| |
Affiliation: | 1. Electrotechnical Laboratory, Sakura-mura, Niihari-gun, 305, Ibaraki, Japan 3. ICOT Research Center, Institute for New Generation Computer Technology, Mita Kokusai Bldg. 21F, 4-28 Mita I-chome, Minato-ku, 108, Tokyo, Japan
|
| |
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. |
| |
Keywords: | |
本文献已被 SpringerLink 等数据库收录! |
|