mirror of
https://github.com/Mercury-Language/mercury.git
synced 2026-04-15 01:13:30 +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.
65 lines
2.0 KiB
Mathematica
65 lines
2.0 KiB
Mathematica
%---------------------------------------------------------------------------%
|
|
% vim: ts=4 sw=4 et ft=mercury
|
|
%---------------------------------------------------------------------------%
|
|
%
|
|
% The "regexp.r1" Benchmark
|
|
% Part of the DPPD Library.
|
|
%
|
|
% A program testing whether a string matches a regular expression (using
|
|
% difference lists). Much more naive (and smaller) than the program used
|
|
% by Mogensen/Bondorf for Logimix ! The regular expression for this
|
|
% benchmark is (a+b)*aab. This benchmark contains no builtins or negations.
|
|
|
|
:- module regexp_r1.
|
|
|
|
:- interface.
|
|
|
|
:- pred regexp_r1 is semidet.
|
|
|
|
:- implementation.
|
|
|
|
:- import_module char.
|
|
:- import_module list.
|
|
:- import_module regexp.
|
|
|
|
regexp_r1 :-
|
|
generate1([a, a, a, a, a, a, b, b, a, a, a, b]),
|
|
generate1([a, a, a, a, a, a, b, b, a, b]),
|
|
generate1([a, b, a, b, a, b, a, b, a, b, a]).
|
|
|
|
% generate1([X, Y, Z, V]). this currently isn't well moded.
|
|
|
|
% The partial deduction query
|
|
%
|
|
% :- generate(cat(star(or(char(a), char(b))),
|
|
% cat(char(a), cat(char(a), char(b)))),
|
|
% S, []).
|
|
%
|
|
% The run-time queries
|
|
%
|
|
% :- generate(cat(star(or(char(a), char(b))),
|
|
% cat(char(a), cat(char(a), char(b)))),
|
|
% [a, a, a, a, a, a, b, b, a, a, a, b], []).
|
|
% :- generate(cat(star(or(char(a), char(b))),
|
|
% cat(char(a), cat(char(a), char(b)))),
|
|
% [a, a, a, a, a, a, b, b, a, b], []).
|
|
% :- generate(cat(star(or(char(a), char(b))),
|
|
% cat(char(a), cat(char(a), char(b)))),
|
|
% [a, b, a, b, a, b, a, b, a, b, a], []).
|
|
% :- generate(cat(star(or(char(a), char(b))),
|
|
% cat(char(a), cat(char(a), char(b)))),
|
|
% [X, Y, Z, V], []).
|
|
%
|
|
% Example solution
|
|
%
|
|
% The following can be obtained by the ECCE partial deduction system .
|
|
% Although it runs considerably faster than the original program (5 times
|
|
% actually) it does not correspond to a deterministic automaton yet.
|
|
%
|
|
% generate__1(X1) :- generate__2(X1).
|
|
% generate__2([a, a, b]).
|
|
% generate__2([a | X1]) :- generate__2(X1).
|
|
% generate__2([b | X1]) :- generate__2(X1).
|
|
%
|
|
% Michael Leuschel / K.U. Leuven / michael@cs.kuleuven.ac.be
|