Reimplementing regex
grammars with finite state machines
#697
hudson-ai
started this conversation in
Show and tell
Replies: 0 comments
Sign up for free
to join this conversation on GitHub.
Already have an account?
Sign in to comment
-
This is half "Show and Tell" and half "Idea".
I re-implemented
regex
grammars using finite state machines (which are created from regex patterns using theinteregular
library):https://github.com/hudson-ai/pastafarian
This is not a PR to
guidance
for a few reasons:token_limit
. I believe I can solve this, but then I hit another problem with token limiting:Calling
token_limit
on recursive grammars fails to limit tokens #676@Harsha-Nori, @slundberg, @riedgar-ms you may find this interesting :)
Beta Was this translation helpful? Give feedback.
All reactions