Same tag issue

[gonpress]

Hello

I'm having a problem using bbcode parser

[b][size=5][bookblock] test [/bookblock][/size][/b]
[b][size=5][bookblock] test2 [/bookblock][/size][/b]

The problem is that [b] and [bookblock] in the above case are recognized as the same tag.

[gonpress]

       void GetNestedEndTag(ref BBCodeNodePosition nodePos, string assumedCloseTag, in string bbCode) {
            //nodePos.CloseTagStart = bbCode.IndexOf(assumedCloseTag, nodePos.OpenTagEnd, StringComparison.InvariantCultureIgnoreCase);
            // Keep open to match any arguments
            string lowerOpenTag = $"[{nodePos.Node.TagName.ToLower()}";
            string lowerAssumedCloseTag = assumedCloseTag.ToLower();
            int endTagSearchStartPos = nodePos.OpenTagEnd;
            bool openCloseTagsMatch = false;
            while (!openCloseTagsMatch) {
                // By ignoring cases, bbcodes like [QUOTE]abc[/quote] got matched correctly, Search only for end tags based on open tags. This is enough since bbcode would be invalid 
                // if tags inside doesn't match. And we can't search for all non closing tags since some tags were not closed like [hr] and we got false positive matches.
                int closeTagStart = bbCode.IndexOf(assumedCloseTag, endTagSearchStartPos, StringComparison.InvariantCultureIgnoreCase);
                if (closeTagStart == -1) {
                    // Happens if no closing tag could be found. Mostly false positive matches like "[Help] XYZ not working", smileys and so on
                    break;
                }

                nodePos.CloseTagStart = closeTagStart;
                nodePos.CloseTagEnd = closeTagStart + assumedCloseTag.Length;

                string contentLower = bbCode.Substring(nodePos.OpenTagStart, nodePos.CloseTagEnd - nodePos.OpenTagStart);
                // .NET Standard doesn't support the simple Split(string delimiter) overload, but it seems we can use the following overload without any issues
                int openTagsCount = contentLower.Split(new string[] { lowerOpenTag }, StringSplitOptions.None).Length - 1;
                int closeTagsCount = contentLower.Split(new string[] { lowerAssumedCloseTag }, StringSplitOptions.None).Length - 1;

                openCloseTagsMatch = openTagsCount == closeTagsCount;
                endTagSearchStartPos = nodePos.CloseTagStart + 1;
            }
        }

How about changing the contentLower.Split part to a regular expression pattern?