I plan on doing a software that reads a text file and then converts anything that consists only of + P K G 1 2 3 4 5 6 7 8 9 (like this: 236P+K, not the P & K of Poker) into an html tag that points to a picture.
I thought it would be best if I let it read the complete text word for word and let it check if the word contains any other char then the ones listed.
If it contains anything else it won't convert. If it contains only the chars listed it converts them.
I've learned some of the ASCII I/O stuff and I'm browsing the Fstream reference, but I can't really find which ones I have to use to realize it.
Can I have some tips plz ^-^
And, if you really won't use regular expressions, you can roll your own search function using the C++ std::string class search functions. This site has excellent documentation for that.