[Top][All Lists]
[Date Prev][Date Next][Thread Prev][Thread Next][Date Index][Thread Index]
guile prolog benchmark
From: |
stefan |
Subject: |
guile prolog benchmark |
Date: |
Mon, 21 Jun 2010 12:22:06 +0200 |
User-agent: |
KMail/1.12.4 (Linux/2.6.31.12-0.2-desktop; KDE/4.3.5; x86_64; ; ) |
Hi, I've come pretty far in writing a parser for prolog. It's a PEG
parser without packrat and interestingly it is done by doing a simple
modding of a more standard match construct. The parser is custamizable
and it is pretty easy to add new user operators for prolog as you can in
e.g. gnuprolog.
I did a new test with the famous n-queens example and here are the current
performance statistics
gprolog WAM 350ms
gprolog COMPILED 100ms
moddeed guile 630ms
I find this quite reasonable and when we add naitive or JIT compilation it
should be fairly easy to take advantage of this as well for the modding I
have done.
Have fun
Stefan
- guile prolog benchmark,
stefan <=