[Feature] Rewrite the FSM.h to support some regex grammar. #302
Conversation
This file contains hidden or bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
This reverts commit e03ad3e.
Ubospica
approved these changes
May 4, 2025
Seven-Streams
added a commit
to Seven-Streams/xgrammar
that referenced
this pull request
May 5, 2025
At present, the FSM class can only build a FSM from a string. This PR
offers a basic RegexToFSM function.
These regex grammars are supported:
- Strings. For instance, `RegexToFSM("abc")` will build a FSM to accept
"abc".
- Character classes. For instance, `RegexToFSM("[a-z]")` will build a
FSM to accept characters from 'a' to 'z'.
- Repeatation(`*`, `+`, `?`, `{m}`, `{m, n}`).
- Union. (`|`).
Moreover, some basic optimization algorithms are implemented, which can
help to simplify the state machine:
- `ToDFA()`.(Powerset construction)
- `MinimizeDFA()`(Hopcraft Algorithm).
- `SimplifyTransition()`(Xgrammar node merging, type I)
- `SimplifyEpsilon()`(Xgrammar node merging, type II)
---------
Co-authored-by: Yixin Dong <[email protected]>
Ubospica
added a commit
to Ubospica/xgrammar
that referenced
this pull request
May 29, 2025
* fix:fix ci. * [Feature] Rewrite the FSM.h to support some regex grammar. (mlc-ai#302) At present, the FSM class can only build a FSM from a string. This PR offers a basic RegexToFSM function. These regex grammars are supported: - Strings. For instance, `RegexToFSM("abc")` will build a FSM to accept "abc". - Character classes. For instance, `RegexToFSM("[a-z]")` will build a FSM to accept characters from 'a' to 'z'. - Repeatation(`*`, `+`, `?`, `{m}`, `{m, n}`). - Union. (`|`). Moreover, some basic optimization algorithms are implemented, which can help to simplify the state machine: - `ToDFA()`.(Powerset construction) - `MinimizeDFA()`(Hopcraft Algorithm). - `SimplifyTransition()`(Xgrammar node merging, type I) - `SimplifyEpsilon()`(Xgrammar node merging, type II) --------- Co-authored-by: Yixin Dong <[email protected]> * tests:add some tests. * Revert "tests:add some tests." This reverts commit 11c2994. * refac:refac the fsm_builder. * fix:fix the not function. * refac:refac the simplify functions. * refac:refac the fsm.cc. * fix:enable it to compile. * fix:pass the basic test. * fix:fix the fucking bug in concat. * fix:pass all the basic tests. * fix:fix the simplify. * fix:fix the config. --------- Co-authored-by: Yixin Dong <[email protected]>
Sign up for free
to join this conversation on GitHub.
Already have an account?
Sign in to comment
2 participants
Add this suggestion to a batch that can be applied as a single commit.
This suggestion is invalid because no changes were made to the code.
Suggestions cannot be applied while the pull request is closed.
Suggestions cannot be applied while viewing a subset of changes.
Only one suggestion per line can be applied in a batch.
Add this suggestion to a batch that can be applied as a single commit.
Applying suggestions on deleted lines is not supported.
You must change the existing code in this line in order to create a valid suggestion.
Outdated suggestions cannot be applied.
This suggestion has been applied or marked resolved.
Suggestions cannot be applied from pending reviews.
Suggestions cannot be applied on multi-line comments.
Suggestions cannot be applied while the pull request is queued to merge.
Suggestion cannot be applied right now. Please check back later.
At present, the FSM class can only build a FSM from a string. This PR offers a basic RegexToFSM function.
These regex grammars are supported:
RegexToFSM("abc")will build a FSM to accept "abc".RegexToFSM("[a-z]")will build a FSM to accept characters from 'a' to 'z'.*,+,?,{m},{m, n}).|).Moreover, some basic optimization algorithms are implemented, which can help to simplify the state machine:
ToDFA().(Powerset construction)MinimizeDFA()(Hopcraft Algorithm).SimplifyTransition()(Xgrammar node merging, type I)SimplifyEpsilon()(Xgrammar node merging, type II)