Aadhavan Srinivasan 7c62ba6bfd Started implementing Thompson's algorithm for matching, because the old one was completely backtracking (so it would enter infinite loops on something like '(a*)*' ) ...

The git diff claims that a ton of code was changed, but most of it was just indentation changes.

2025-02-05 12:21:12 -05:00

cmd

Wrote 'reg.FindSubmatch()' which returns the leftmost match with submatches, renamed 'isValid' to 'IsValid' to export it, renamed 'ToString' to 'String'

2025-02-01 11:06:03 -05:00

regex

Started implementing Thompson's algorithm for matching, because the old one was completely backtracking (so it would enter infinite loops on something like '(a*)*' )

2025-02-05 12:21:12 -05:00

.gitignore

Added gitignore

2024-10-22 14:35:36 -04:00

go.mod

Updated module name to 'kleingrep' (Let's goo!)

2025-01-30 09:22:31 -05:00

go.sum

Print matched content in color

2024-10-22 21:02:09 -04:00

LICENSE

Updated license

2025-01-30 11:20:05 -05:00

Makefile

Disable all optimizations

2025-02-03 16:48:09 -05:00

Description

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

MIT 2.5 MiB

Languages

Go 75.7%

Python 24.2%

Makefile 0.1%