expand_w(+X:regex, +M:atom, -G:goal, -P:list, -Q:list) is det

True if G is unifed with a goal and helper predicates are created in P (minsu Q) so that calling G behaves as X in the shortest-match-mode.

 expand_w(+X:regex, -A:var, -B:var, +M:atom, -G:goal, +P:list, -Q:list) is det

True if G is unifed with a goal and helper predicates are created in P (minsu Q) so that calling G behaves as X in the shortest-match-mode with d-list (A, B).

 expand_wl(+X:regex, +M:atom, -G:goal, -P:list, -Q:list) is det

True if G is unifed with a goal and helper predicates are created in P (minsu Q) so that calling G behaves as X in the longest-match-first mode.

 expand_wl(+X:regex, A:var, B:var, +M:atom, -G:goal, -P:list, -Q:list) is det

True if G is unifed with a goal and helper predicates are created in P (minsu Q) so that calling G behaves as X in the longest-match-first mode with d-list (A, B)

Undocumented predicates

The following predicates are exported, but not or incorrectly documented.

 let_w(Arg1, Arg2)

 let_wd(Arg1, Arg2)

 let_wl(Arg1, Arg2)

 let_wld(Arg1, Arg2)

 adjacent_interval(Arg1, Arg2, Arg3)

 am_finals(Arg1, Arg2)

 expand_recognize_act(Arg1, Arg2, Arg3, Arg4, Arg5, Arg6, Arg7)

 regex_am(Arg1, Arg2)

 regex_coalgebra(Arg1, Arg2)

 regex_compare(Arg1, Arg2, Arg3)

 word(Arg1, Arg2, Arg3)

 x_char_boole_form(Arg1, Arg2)

 let_w(Arg1, Arg2)

 let_wd(Arg1, Arg2)

 let_wl(Arg1, Arg2)

 let_wld(Arg1, Arg2)