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 language | English |
|---|---|
| Pages (from-to) | 547-555 |
| Number of pages | 9 |
| Journal | Information and Software Technology |
| Volume | 37 |
| Issue number | 10 |
| Publication status | Published - 1995 |
Keywords
- DCGs
- Prolog
- Relational Algebra Accelerator
- SLR(1) parsing