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

Use DFA minimization on the parse state FSMs #278

Open
brandonwillard opened this issue Sep 11, 2023 · 0 comments
Open

Use DFA minimization on the parse state FSMs #278

brandonwillard opened this issue Sep 11, 2023 · 0 comments
Labels
enhancement optimization Related to performance optimizations structured generation Linked to structured generation

Comments

@brandonwillard
Copy link
Member

brandonwillard commented Sep 11, 2023 •
edited
Loading

This will remove a large number of unnecessary states and decrease the overall cost of constructing indices.

It needs to be done in a way that still allows us to easily identify sub-FSMs/regexs/terminal symbols.

In other words, we need a replacement for interegular's FSM.reduce method.

This is a follow up to #178.
@brandonwillard brandonwillard added enhancement optimization Related to performance optimizations structured generation Linked to structured generation labels Sep 11, 2023
Sign up for free to join this conversation on GitHub. Already have an account? Sign in to comment
Assignees
No one assigned
Labels
enhancement optimization Related to performance optimizations structured generation Linked to structured generation
Projects
None yet
Milestone
No milestone
Development

No branches or pull requests
1 participant
@brandonwillard