Implementing Prolog Definite Clause Grammars with SLR(1) parsers on the Relational Algebra Accelerator

Information and Software Technology - Tập 37 - Trang 547-555 - 1995
Greg Michaelson1
1Department of Computing and Electrical Engineering, Heriot-Watt University, Riccarton EH14 4AS, Scotland, UK

Tài liệu tham khảo

Pereira, 1980, Definite Clause Grammars for language analysis—a survey of the formalism and a comparison with augmented transition networks, Artificial Intelligence, Vol 13, 231, 10.1016/0004-3702(80)90003-X Aho, 1977 Johnson, 1975, YACC: yet another compiler compiler Nilsson, 1986, AID: an alternative implementation of DCGs, New Generation Computing, Vol 4, 383, 10.1007/BF03037391 Morley, 1989, Efficient parsing using constraints, Vol 11, 37 Colomb, 1988, Table searching using a content addressable memory, Australian Computer J, Vol 20, 105 Colomb, 1991, Enhanced unification in Prolog through clause indexing, Journal of Logic Programming, Vol 10, 23, 10.1016/0743-1066(91)90004-9 Chung, 1988, Integration of Relational Algebra Accelerator with UNSW Prolog Sammut C UNSW Prolog Reference Manual University of NSW Naish, 1984 Carlsson, 1988, SICS R88007B Clocksin, 1987 Herjee, 1988, Rapid implementation of SQL: a case study using YACC & LEX, Inf. and Soft. Technol., Vol 30, 228, 10.1016/0950-5849(88)90083-3