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. )
Regular Expressions Matching Subroutine
Moderator: MaxCoderz Staff
Regular Expressions Matching Subroutine
Last edited by Demon on Thu 18 Oct, 2007 7:00 pm, edited 2 times in total.
"Python has dynamic typing, and dynamic binding, which means that not only does it make a great secretary, it is also pretty damn kinky." --Henry the Adequate
<My Artwork>
<My Artwork>
Well, I looked on ticalc.org, but the only one I saw was a matching-only program for the 89.
"Python has dynamic typing, and dynamic binding, which means that not only does it make a great secretary, it is also pretty damn kinky." --Henry the Adequate
<My Artwork>
<My Artwork>
- driesguldolf
- Extreme Poster
- Posts: 395
- Joined: Thu 17 May, 2007 4:49 pm
- Location: $4080
- Contact:
Unfortunately I don't know that much ASM (nor will I get time until the middle of Summer to learn it).
"Python has dynamic typing, and dynamic binding, which means that not only does it make a great secretary, it is also pretty damn kinky." --Henry the Adequate
<My Artwork>
<My Artwork>