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

Fingerprint

Algebra
Particle accelerators
Coprocessor

Keywords

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

Cite this

@article{4700a975472244ef8edf5588bbb7a86c,
title = "Implementing Prolog Definite Clause Grammars with SLR(1) parsers on the Relational Algebra Accelerator",
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. {\circledC} 1995.",
keywords = "DCGs, Prolog, Relational Algebra Accelerator, SLR(1) parsing",
author = "Greg Michaelson",
year = "1995",
language = "English",
volume = "37",
pages = "547--555",
journal = "Information and Software Technology",
issn = "0950-5849",
publisher = "Elsevier",
number = "10",

}

TY - JOUR

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

AU - Michaelson, Greg

PY - 1995

Y1 - 1995

N2 - 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.

AB - 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.

KW - DCGs

KW - Prolog

KW - Relational Algebra Accelerator

KW - SLR(1) parsing

UR - http://www.scopus.com/inward/record.url?scp=58149318794&partnerID=8YFLogxK

M3 - Article

VL - 37

SP - 547

EP - 555

JO - Information and Software Technology

JF - Information and Software Technology

SN - 0950-5849

IS - 10

ER -