mirror of
https://github.com/Mercury-Language/mercury.git
synced 2026-04-15 09:23:44 +00:00
33eb3028f5
tests/accumulator/*.m:
tests/analysis_*/*.m:
tests/benchmarks*/*.m:
tests/debugger*/*.{m,exp,inp}:
tests/declarative_debugger*/*.{m,exp,inp}:
tests/dppd*/*.m:
tests/exceptions*/*.m:
tests/general*/*.m:
tests/grade_subdirs*/*.m:
tests/hard_coded*/*.m:
Make these tests use four-space indentation, and ensure that
each module is imported on its own line. (I intend to use the latter
to figure out which subdirectories' tests can be executed in parallel.)
These changes usually move code to different lines. For the debugger tests,
specify the new line numbers in .inp files and expect them in .exp files.
55 lines
1.5 KiB
Mathematica
55 lines
1.5 KiB
Mathematica
%---------------------------------------------------------------------------%
|
|
% vim: ts=4 sw=4 et ft=mercury
|
|
%---------------------------------------------------------------------------%
|
|
%
|
|
% The "match" Benchmark
|
|
% Part of the DPPD Library.
|
|
%
|
|
% This is the semi-naive string matcher from the Lam & Kusalik
|
|
% benchmarks. The goal is to obtain a KMP matcher for the pattern aab.
|
|
% This benchmark program uses the \== builtin. The run-time queries are
|
|
% less sophisticated than the ones for match.kmp.
|
|
|
|
:- module match.
|
|
|
|
:- interface.
|
|
|
|
:- pred match is semidet.
|
|
|
|
:- implementation.
|
|
|
|
:- import_module list.
|
|
:- import_module match_impl.
|
|
|
|
match :-
|
|
match_aab([a, b, c, d, e, f, g, h, i, j, k, l, m, n, o, p, q, r,
|
|
s, t, u, v, a, a, b, w, x, y, z]).
|
|
|
|
% The partial deduction query
|
|
%
|
|
% :- match([a, a, b], String).
|
|
%
|
|
% The run-time queries
|
|
%
|
|
% :- match([a, a, b], [a, b, c, d, e, f, g, h, i, j, k, l, m, n, o, p, q, r,
|
|
% s, t, u, v, a, a, b, w, x, y, z]).
|
|
%
|
|
% Example solution
|
|
%
|
|
% The following KMP-matcher can be obtained by the ECCE partial system
|
|
% (to my knowledge this has first been achieved by John Gallagher with his
|
|
% SP system).
|
|
%
|
|
% match__1([X1 | X2]) :- match1__2(X1, X2).
|
|
%
|
|
% match1__2(X1, [X2 | X3]) :- a \= X1, match1__2(X2, X3).
|
|
% match1__2(a, [X1 | X2]) :- match1__3(X1, X2).
|
|
%
|
|
% match1__3(X1, X2) :- a \= X1, match1__2(X1, X2).
|
|
% match1__3(a, [X1 | X2]) :- match1__4(X1, X2).
|
|
%
|
|
% match1__4(X1, X2) :- b \= X1, match1__3(X1, X2).
|
|
% match1__4(b, X1).
|
|
%
|
|
% Michael Leuschel / K.U. Leuven / michael@cs.kuleuven.ac.be
|