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

Speed up determinization #2

Open
huhuhugo1 opened this issue Mar 28, 2018 · 2 comments
Open

Speed up determinization #2

huhuhugo1 opened this issue Mar 28, 2018 · 2 comments

Comments

@huhuhugo1
Copy link

huhuhugo1 commented Mar 28, 2018

Hey, I need your help.

I have two sets of regular expressions and after union, NFA for first set have 380 states, 453 transitions and NFA for second set have 241 states, 264 transitions.

The problem is, that determinization of second NFA takes very long, much longer, than first NFA, which is bigger and REGEXs are more complex. Do you have any idea, how can I speed up the process of determinization?

Thanks.

@huhuhugo1 huhuhugo1 reopened this Apr 5, 2018
@wader
Copy link
Owner

wader commented Apr 22, 2018

Hello, sorry for the late reply! for reason i don't see new issues in my feed.

Could you give some example of sets of regexps that causes this problem? one issue i've seen quite often is that one or more regexps are unbounded which causes their states to "spread" when determinizing. For example make sure to anchor ^...$ (if not there is a implicit .* before and after) and use {min,max} instead of * or + which are unbounded.

@wader
Copy link
Owner

wader commented May 20, 2018

@huhuhugo1 any progress?

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

No branches or pull requests

2 participants