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

Convert Abstract Syntax Trees to Non-Deterministic Finite Automata #12

Closed

4 tasks done

mkpro118 opened this issue Jun 6, 2024 · 1 comment

Closed

4 tasks done

Convert Abstract Syntax Trees to Non-Deterministic Finite Automata #12

mkpro118 opened this issue Jun 6, 2024 · 1 comment

Assignees

Labels

Milestone

Owner

mkpro118 commented Jun 6, 2024 •

edited

Loading

The AST will be converted into an NFA. NFAs are easier to represent regular expressions and can be converted to DFAs if needed.

mkpro118 added the enhancement label

mkpro118 self-assigned this

mkpro118 added this to the NFA milestone

Owner Author

mkpro118 commented Jul 4, 2024

Resolved with the following PRs

mkpro118 closed this as completed

Sign up for free to join this conversation on GitHub. Already have an account? Sign in to comment