Convert Abstract Syntax Trees to Non-Deterministic Finite Automata - Githubissues

mkpro118 / Regex-Engine

Regex Engine in C

MIT License

0 stars 0 forks source link

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

Closed mkpro118 closed 2 months ago

mkpro118 commented 3 months ago

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

[x] #13
[x] #14
[x] #15
[x] #19

mkpro118 commented 2 months ago

Resolved with the following PRs

71
72
73
74
76
77