Skip to content
New issue

Have a question about this project? Sign up for a free GitHub account to open an issue and contact its maintainers and the community.

By clicking “Sign up for GitHub”, you agree to our terms of service and privacy statement. We’ll occasionally send you account related emails.

Already on GitHub? Sign in to your account

What are the type of regular #10

Open
DanieleParravicini opened this issue Apr 21, 2020 · 2 comments
Open

What are the type of regular #10

DanieleParravicini opened this issue Apr 21, 2020 · 2 comments
Labels

Comments

@DanieleParravicini
Copy link
Owner

No description provided.

@DanieleParravicini
Copy link
Owner Author

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, ...)"?

@DanieleParravicini
Copy link
Owner Author

DanieleParravicini commented Jun 30, 2020

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

before after
optimization_before optimization_after

Sign up for free to join this conversation on GitHub. Already have an account? Sign in to comment
Labels
Projects
None yet
Development

No branches or pull requests

1 participant