You signed in with another tab or window. Reload to refresh your session.You signed out in another tab or window. Reload to refresh your session.You switched accounts on another tab or window. Reload to refresh your session.Dismiss alert
Is there a specific combination of regex/strings that can clearly take advantage of such an architecture other than the one highlighted by cox in "Regular Expression Matching Can Be Simple And Fast (but is slow in Java, Perl, PHP, Python, Ruby, ...)"?
I think that this coprocessor performs well in case of a high number of alternatives.
For this reasons has been implemented an optimization inside the compiler that tries to reshape the code so that in case of chain of splits it reshapes the operations so that they look like a tree, and hence the maximum latency (longest path inside the code) is minimum.
regex : b* (a|b|c|d)aa
No description provided.
The text was updated successfully, but these errors were encountered: