I want the function do the same job like ReplaceRepeated, and can make the matching process visible.

I searched the Internet and didn't find any package. So I wrote one...

So I can test some example in ReplaceRepeated

Example 1:

Example 2:

Example 3:

However, it fails in some cases, for example:

So I want to know how to improve my myReplaceRepeated？

will cause problem. So I add a If function in myReplaceRepeated.

I want a function that does the same job like ReplaceRepeated, and can make the matching process visible.

I searched the Internet but didn't find any existing code or package that meets my requirement, so I tried to write one:

It works in some cases:

Example 1

Example 2

Example 3

but fails in some other cases:

How to improve my myReplaceRepeated?

will cause problem, that's why I add a If in myReplaceRepeated.

I want the function do the same job like ReplaceRepeated,and can make the symbol become visibleness. I search the Internet and don't find any package.So I write one...

So I can test some example in ReplaceRepeated

example 1:

example 2:

example 3:

But some example fails,for example:

So I want to know how to improve my Program？ If there is a tool can make Pattern Matching become visualization?

I will explain my function more carefully and I want to use this example.

First,define two things,one is the expr and the other is rule

lis = {1, 3, 1, 4, 1, 3, 4, 2, 7, 1, 8}; rule = {Longest[a___], b_, c__, b_, d___} -> {b, b, a, c, d}; mat(*means match*) = rule[[1]] 

{Longest[a___], b_, c__, b_, d___}

And then, I want to know the a,b,c and d in "mat" how to represent the sub-list in "lis"? but how many varibles in rule? So I must find these variables...

Ok,Next~ This code means "a" represent {1,3,1,4} in lis.  But remember,the level is {0},otherwise we gets {}

Ok,combine these in a loop.

the output means "a" represent {1,3,1,4},"b" represent {1},"c" represent {3,4,2,7},the next "b" means the forth {1} and the "d" represent {8} in "lis".

Ok,Combine these together and use pure function to illustrate testQ

Ok.ReplaceRepeated function can be overwriten by FixedPointList.The process of FixedPointList can bring a side effect that is always search the a,b,c,d represent what sub-list..

Finally,we get the similar result.

The variables isn't {}. So if the rule is

This is other problem.So I define a If function in myReplaceRepeated.And using FixedPointList to simulate ReplaceRepeated.

But if the lis and rule is:

But the program don't fit this problem,so how to fix it?

I want the function do the same job like ReplaceRepeated, and can make the matching process visible.

I searched the Internet and didn't find any package. So I wrote one...

So I can test some example in ReplaceRepeated

Example 1:

Example 2:

Example 3:

However, it fails in some cases, for example:

So I want to know how to improve my myReplaceRepeated？

Is there really no existing tool for the visualization of pattern matching?

Let me explain my function with the following example.

lis = {1, 3, 1, 4, 1, 3, 4, 2, 7, 1, 8}; rule = {Longest[a___], b_, c__, b_, d___} -> {b, b, a, c, d}; mat(*short for match*) = rule[[1]]; 

I want to know how those variables i.e. a,b,c and d in rule match the sub-sequence in lis when lis //. rule executes.

To monitor how those variables match, I need to first know what variables rule contain:

Then I find out how these variables match lis respectively, for example the following piece of code shows a matches 1, 3, 1, 4 in lis. 

Notice the level is {0}, otherwise we get {}

These are combined in a loop.

The output means a represents {1, 3, 1, 4},b represents {1}, c represents {3, 4, 2, 7}, the next b represents the latter {1} and d represents {8} in lis.

Then I define a testQ to combine all these together:

The functionality of ReplaceRepeated is achieved by FixedPointList:

This is almost the output of example 1, except for the coloring.

You may noticed that the variables in the above code can't be {}, so a rule like

will cause problem. So I add a If function in myReplaceRepeated.

So long my code gets the ability to handle example 1 ~ 3, but if lis and rule are:

My program fails, how to fix it?

But if the lis and rule is:

lis = f[a][b][c][d]; rule = g_[x_][y__] -> g[x, y]; mat = rule[[1]]; variables = ToExpression@ StringCases[ ToString[mat], (vars : WordCharacter ..) ~~ "_" | "__" | "___" :> vars]!={} 

True

But the program don't fit this problem,so how to fix it?