The Lounge is rated Safe For Work. If you're about to post something inappropriate for a shared office environment, then don't post it. No ads, no abuse, and no programming questions. Trolling, (political, climate, religious or whatever) will result in your account being removed.
This is such a different approach than my non-backtracking expressions, which would basically be a subset of this machine with ... 2? instructions I think but it isn't implemented that way at all.
This is pretty cool. I can add regular expression features to the core runner by adding opcodes, but for the most part, I shouldn't need to add to these.
And they should be pretty easy to emit to either IL (as compiled) or C# (table driven) instructions
My instruction pointer is basically a List<Instruction> in tandem with an integer index. If I were doing it in C or C++ it would be an actual pointer, but I think a side effect of this is mine in some ways is a bit more efficient in that it doesn't need as many heap allocs as doing this in C in the most obvious way would, simply because of the way I've organized it.
I'm a long way from an article yet. I'm not even done with my machine compiler yet, but I'm still excited about it. This is cool stuff.
Steve Wozniak is the only thing at Apple that isn't evil.
You're wasting your time because nobody but you understands regular expressions.
Now that Visual Studio has kowtowed to regular expressions, I find searching for non-trivial things to be a deep PitA. Its "help" on the topic just blows. Someday I'll make time to find decent documentation on the subject. Until then, I'm sometimes reduced to a two-pass approach, of finding too much and then searching for certain substrings within the results window.