C#

bool inAsp = false;
bool inATag = false;
List<int> matches  = new List<int>();
List<int> curGuess = new List<int>();
for (int i = 0; i < str.Length; ++i) {
    char c = str.CharAt(i);
    if (inAsp) {
        if (EndingAspTag)        // this is a pseudocode conditional
            inAsp = false;
        continue;
    } else if (inATag) {
        if (EndingATag)          // this is a pseudocode conditional
            inATag = false;
        continue;
    } else if (StartingAspTag) { // this is a pseudocode conditional
        curGuess.Clear();
        inAsp = true;
    } else if (StartingATag) {   // this is a pseudocode conditional
        curGuess.Clear();
        inATag = true;
    }
    for (int j = curGuess.Count - 1; j >= 0; --j) {
        if (c != keyword.CharAt(++curGuess[j]))
            curGuess.RemoveAt(j);
        else if (curGuess[j] == keyword.Length - 1) {
            matches.Add(i - curGuess[j]);
            curGuess.RemoveAt(j);
        }
    }
    if (c == keyword.CharAt(0))
        curGuess.Add(0);
}
for (int i = 1; i < matches.Count; ++i) {
    if (matches[i] - matches[i - 1] < keyword.Length)
        matches.RemoveAt(i--);
}
</int></int></int></int>

Small Rat wrote:

I know regular express may solve this problem. But I don't know how??

Can somebody give me an example regular exression for this??