An NFA-based regex engine with a library and command-line tool.

You cannot select more than 25 topics Topics must start with a letter or number, can include dashes ('-') and can be up to 35 characters long.

Aadhavan Srinivasan cca8c7cda2 Got rid of transitions parameter, changed how kleene state is processed ... I replaced the transition parameter for nfaState, replacing it with a single nfaState pointer. This is because any non-alternation state will only have one next state, so the map was just added complexity. I changed alternation processing - instead of having their own dedicated fields, they just use the new 'next' parameter, and another one called 'splitState'. I also changed the kleene state processing to remove the unecessary empty state in the right-side alternation (it actually messed up my matching).		5 months ago
cmd	Wrote 'reg.FindSubmatch()' which returns the leftmost match with submatches, renamed 'isValid' to 'IsValid' to export it, renamed 'ToString' to 'String'	5 months ago
regex	Got rid of transitions parameter, changed how kleene state is processed	5 months ago
.gitignore	Added gitignore	8 months ago
LICENSE	Updated license	5 months ago
Makefile	Disable all optimizations	5 months ago
go.mod	Updated module name to 'kleingrep' (Let's goo!)	5 months ago
go.sum	Print matched content in color	8 months ago