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

Research output: Contribution to journalArticle

Abstract

Definite Clause Grammars (DCGs) are a Prolog extension which are widely used to specify and implement front ends to Prolog based systems. Efficient restricted DCG implementations may be based on LR(K) parsing techniques. The use of the Relational Algebra Accelerator (RAA), a bit serial/word parallel logic co-processor, for fast access to LR parse tables brings substantial performance improvements over software DCG implementations. The generation of SLR(1) parsers from DCGs and their implementation using the RAA are discussed, and performance figures are presented. © 1995.

Original languageEnglish
Pages (from-to)547-555
Number of pages9
JournalInformation and Software Technology
Volume37
Issue number10
Publication statusPublished - 1995

Keywords

  • DCGs
  • Prolog
  • Relational Algebra Accelerator
  • SLR(1) parsing

Fingerprint Dive into the research topics of 'Implementing Prolog Definite Clause Grammars with SLR(1) parsers on the Relational Algebra Accelerator'. Together they form a unique fingerprint.

  • Cite this