|Syntactic Confectionery Delight|
Extract numbers in multiple basesby jcwren (Prior)
|on Oct 15, 2001 at 00:29 UTC||Need Help??|
jcwren has asked for the
wisdom of the Perl Monks concerning the following question:
Congratulations to the last person who voted this simple request down. I've had it with the trolls, votebots, and general decline of civilization of PM. I'm outta here.
Updated: Apparently, some people are dim enough to think this is a 'do my homework' type node. It's not. It's code for a future PM-related utility. I'm looking for a little help for something I'd rather not write if it already exists. I think it's called 'Not Reinventing The Wheel'.
I'm looking for some code that will do multi-base number verification. Here's the criteria:
Ideally, some large esoteric module should not be required. For instance, Parse::RecDescent with a grammar for number parsing is a sub-optimal solution.
I don't really care if it's an elaborate (fool-proof) regexp, a state machine, or pirated-and-ported VB code, as long it's solid.
Anyone got one of these handy, or want to golf one?--Chris