Regex word boundary alternative for lex

Question

I\'m now working on a (f)lex scanner, and when I want handle the numbers using regex as follows:

(\\B[+-]?[0-9]+)|([0-9]+)

and the match requ