A note on the speed of Prolog

Authors:
J. Paakki
Affiliations:
GMD Forschungsstelle an der Universität Karlsruhe (German National Research Center for Science), Haid-und-Neu-Str. 7, D-7500 Karsruhe 1, Federal Republic of Germany
Venue:
ACM SIGPLAN Notices
Year:
1988

Citing 5
Cited 0

Compilers: principles, techniques, and tools

Compilers: principles, techniques, and tools
Parsing and compiling using Prolog

ACM Transactions on Programming Languages and Systems (TOPLAS)
Logic grammars

BYTE
A compiler generator for microcomputers

A compiler generator for microcomputers
Semantic evaluation from left to right

Communications of the ACM

Quantified Score

Hi-index	0.00

Visualization

Abstract

Based on an experiment in compiler writing methods, we discuss the speed of Prolog programs of modest size when compared with operationally equivalent Pascal programs. We have produced three versions of a compiler for the programming language Edison using three different tools: Pascal, Prolog, and a compiler writing system (GAG). The Prolog and Pascal programs analyzed in this case are the semantic analysis and the code transformation phases of the Edison compiler. Our analysis shows that it is possible to write Prolog programs that are able to compete in speed with the corresponding programs written in Pascal.