I have tried to find the answer looking in HTML::Parser or XML::Parser.
But in those modules the core parser is made in C.
One way is test if you have odd numbers of ("), if true, you have to look for the next '>' to get the complete tag,
but I don't know how to it right and fast.
So, the problem is how can I count the number of time a caracter appears in a string.
In reply to parsing HTML
by eod