SittingDuck

How do I implement Perl-type regular expressions? I thought that I could take it element by element and compare it, but I don't know where to start.

DaWei

What do you mean, "implement it"? Use it? Write your own?

__________________
Abstraction doesn't make it impossible to write bad code; it makes it possible to write superior code.
Contributor's Corner: Grumpy on C++ Exceptions DaWei on Pointers

SittingDuck

Write my own handler.

DaWei

With a lot of research. Really, really difficult isn't exactly the same thing as really, really complex, but there's a strong correlation. Once you've written the thing, you'll understand why knowledgeable programmers use substring functions instead of regex wherever possible.

Begin by learning to search a haystack string for a needle string (of any length). Then add wild-card capability. Then learn the difference between greedy and non-greedy matching. By the time you get there, you'll have a much clearer picture. By all means, invest your time in concepts quite steeply before you resort to more than minor, experimental code.

__________________
Abstraction doesn't make it impossible to write bad code; it makes it possible to write superior code.
Contributor's Corner: Grumpy on C++ Exceptions DaWei on Pointers

jim mcnamara

There are regex or regexp libraries available. You will have to use those unless you want a really major undertaking.

A VERY SIMPLE, almost useless, version of regexp is the implementation of the scanset in the scanf functions in C.