MaxCoderz

Would it be possible for someone to write a subroutine that
- does matching based on regular expressions?
- has a feature that would return in a delimited string the matches found?


Input: "THIS IS AWESOME DUDE"
Comparison: "* IS *"
Result: 1

Input: "HELLO MY NAME IS SCOTT"
Comparison: "$1 (MY NAME IS|I AM) $2"
Result: "1=HELLO2=SCOTT"

I'd find a subroutine like this very useful for my AI program (which is in hybrid-BASIC and needs all the speed it can get. )

There are a lot of libraries with source code that handle regexps, just have a look.

Well, I looked on ticalc.org, but the only one I saw was a matching-only program for the 89.

I'd love to make one, but at the moment I want to continue on my secret project some more (the FindSubstring was a welcome change of scene )

There are libraries for the PC which you can port.

Unfortunately I don't know that much ASM (nor will I get time until the middle of Summer to learn it).