Aadhavan Srinivasan 95654e3e34 Take all possible 0-states (until no more left to take) before checking if we are in an acceptable position

2024-10-27 14:56:28 -04:00

.gitignore

Added gitignore

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

go.mod

More Kleene star fixes

2024-10-23 10:26:50 -04:00

go.sum

Print matched content in color

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

main.go

Added comments

2024-10-27 14:56:00 -04:00

Makefile

Disable compile-time optimization

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

matching.go

Take all possible 0-states (until no more left to take) before checking if we are in an acceptable position

2024-10-27 14:56:28 -04:00

misc.go

Added 'unique append' function, to ensure that elements in slice are unique

2024-10-27 12:52:35 -04:00

nfa.go

Used 'unique append' to ensure that a transition can only contain a given state once

2024-10-27 12:52:59 -04:00

re_test.go

Added test

2024-10-27 14:56:07 -04:00

sliceQueue.go

Added 'mustPop' function which panics if slice is empty

2024-10-26 13:06:12 -04:00

todo.txt

Updated TODO

2024-10-26 14:29:35 -04: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%