diogo/yap-6.3
Archived
1
0
Fork 0
Code Issues Pull Requests Packages Projects Releases Wiki Activity

Version with left-recursive points_to/2 predicate.

Browse Source 
git-svn-id: https://yap.svn.sf.net/svnroot/yap/trunk@1820 b08c6af1-5177-4d33-ba66-4b1c6b8b522a
This commit is contained in:
kostis 2007-03-10 10:52:40 +00:00
parent b320589051
commit ce572ca881
1 changed files with 17 additions and 3 deletions
Show Stats Download Patch File Download Diff File Expand all files Collapse all files

20
docs/index/Benchmarks/pta.P
View File

@ -1,4 +1,15 @@
%:- set_prolog_flag(index,single). /*
** This is a benchmark that implements Andersen's Points To Analysis
** using tabling.
**
** To bypass a problem in XXX the code has been slightly modified.
** The original version used a right-recursive tabled predicate
** for points_to/2; this version uses a left-recursive predicate.
** Note that this gives significantly less answers, but it is a
** tabled benchmark nonetheless.
**/
%% :- set_prolog_flag(index,single).
%% :- yap_flag(tabling_mode, local). %% :- yap_flag(tabling_mode, local).
time :- time :-
@ -35,9 +46,12 @@ get_var(X) :- var(true,X). % pointer variables
:- table pointed_to_by/2. :- table pointed_to_by/2.
:- table aux2/2. :- table aux2/2.
%% ORIGINAL VERSION
%% points_to --> fa.
%% points_to --> aux1, points_to.
%%
points_to --> fa. points_to --> fa.
points_to(X,Y) :- points_to(Z,Y), aux1(X,Z). points_to --> points_to, aux1.
% points_to --> aux1, points_to.
aux1 --> f. aux1 --> f.
aux1 --> aux11. aux1 --> aux11.