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.

Sign up for GitHub

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

Jump to bottom

Create DFA from NFA with prioritized transitions. #16

Open
magne opened this issue Jan 29, 2020 · 0 comments
Open

Create DFA from NFA with prioritized transitions. #16

magne opened this issue Jan 29, 2020 · 0 comments
Assignees
@magne
Labels
enhancement New feature or request
Milestone
Add non-greedy qu...

Comments

@magne
Copy link
Owner

magne commented Jan 29, 2020

We need to create a DFA that considers the prioritized transitions from the new NFA produced by the lazy quantifiers.

This can probably be done by matching NFA states in a DFA state as an ordered list, not as a set. The ordered list of NFA states must be produced by simulating the NFA with a low and a normal stack. See the nes1983 code in the alternate-implementations branch.
@magne magne added the enhancement New feature or request label Jan 29, 2020
@magne magne added this to the Add non-greedy quantifiers milestone Jan 29, 2020
@magne magne self-assigned this Jan 29, 2020
Sign up for free to join this conversation on GitHub. Already have an account? Sign in to comment
Assignees

@magne magne

Labels
enhancement New feature or request
Projects
None yet
Milestone
Add non-greedy quantifiers
Development

No branches or pull requests
1 participant
@magne