This is my own implementation of a Regular Expression engine in C based off of this video by Low Byte Productions

Regular expressions are used pretty everywhere involving user input since we communicate in languages and text. In its most basic form, it scans through text and finds characters. At its most complex, we have engines built for efficiency with advanced capabilities supporting a wide array of platforms.

However, this implementation seeks to allow for the minimum that any user familiar with RegEx would appreciate. There are few special features and even fewer guarantees of efficiency or function. Yet, it's a little novelty project that I hope to incorporate into a larger Language Parser and, eventually, compiler.

Again, this is very rough coding and there might even be some hidden cases that will break it and memory leaks abound.

Current features:

Matches literals (ex. 1, e, r, k)

Matches literal sets (careting also supported)

Matches anything: .

Matching one or more: +

Matching zero or more: *

Matching zero or one: ?

Variable matching: {,}

Backtracking (greedy, lazy, possessive)

TODO features:

Literal sets

Caret negation

Backtracking

Extra features...