 |  |  |  |  |  |  |  |
Lexer- Tokenizer problem
Please support our C++ advertiser: Intel Parallel Studio Home
 |
•
•
Join Date: Nov 2006
Posts: 202
Reputation: 
Solved Threads: 11
Posting Whiz in Training
man, i did not know that boost had a parsing tool... unfortunately i was obligated to use bison and flex from the project guide lines!
•
•
Join Date: Nov 2006
Posts: 202
Reputation:
Solved Threads: 11
Posting Whiz in Training
•
•
•
•
Originally Posted by iamthwee 
First you gotta know what your regular expressions are doing.
To mestring_component [0-9a-zA-Z \t\.!#$%^&()*@_]and the example you have given is contradictory, like salem mentioned.
|
Similar Threads
- StringTokenizer problem (Java)
- simple program tokenizer problem (Java)
Other Threads in the C++ Forum
- Previous Thread: please help
- Next Thread: Optomizing for Pentium Pro
| Thread Tools | Search this Thread |
You need to join our community in order to build your list of favorite forums. You can visit the forum index for a listing of all forums.
Related Forum Features
Latest C++ Posts
- Today's Posts
- Unanswered Threads
api array based binary bitmap c++ c/c++ calculator char char* class classes code coding compile console conversion count database delete deploy desktop developer directshow dll download dynamic dynamiccharacterarray email encryption error file forms fstream function functions game givemetehcodez google graph gui homeworkhelp iamthwee ifstream input int java lib linkedlist linker linux list loop looping loops map math matrix memory multiple news node number numbertoword output pointer problem program programming project python random read recursion recursive reference return rpg sorting string strings temperature template templates test text text-file tree unix url variable vector video visualstudio win32 windows winsock word wordfrequency wxwidgets
