Colin Eberhardt

That's a really interesting article - thanks.

Just FYI - I've been exploring a multi-state NFA algorithm, which is conceptually similar to a DFA (it is in some senses an emulated DFA): https://github.com/ColinEberhardt/assemblyscript-regex/tree/multi-state-NFA However, it doesn't appear...

I believe the principal advantage is that DFAs do not result in back-tracking. However, many simple regex's do not result in any significant backtracking. This is why I'm keen to...

My initial thoughts 1. The regular-expressions.info website has very detailed (and easy to understand) descriptions of the syntax and functionality. It also describes languages-specific variations, including JavaScript. See for example...

Thanks @dcodeIO - I was not aware of iiregex.

Thanks @MaxGraey - I think that would be a good idea. See the discussion here #13

Added a GitHub action that runs npm test https://github.com/ColinEberhardt/assemblyscript-regex/commit/773b20ba9a8205de315c5e2d96f4f8a1d5fa25ab

The project does build from a clean install - you can see that via the GitHub actions: https://github.com/ColinEberhardt/assemblyscript-temporal/actions However, the build doesn't run the `npm run asbuild` script. What happens...

The following two tests have been disabled, they require > 32 bit integers on the `Duration` type: https://github.com/ColinEberhardt/assemblyscript-temporal/commit/438e0e196e111f413910e68e4236d6b194e59913

I'd also suggest that both `Instant` and the complete `Duration` API are relatively easy starting points for a new contributor