Click here to Skip to main content
Click here to Skip to main content
Add your own
alternative version

Visual Studio Add-in for testing regular expressions

, 1 Dec 2010
An add-in for debugging and creating regular expression directly in Visual Studio
using System;
using System.Collections.Generic;
using System.Linq;
using System.Text;

namespace RegexTester
{
    /// <summary>
    /// Visitor interface for regular expression result tree.
    /// </summary>
    public interface IRegexResultTreeNodeVisitor
    {
        void Visit(RootNode node, bool beforeChildren);
        void Visit(MatchNode node, bool beforeChildren);
        void Visit(GroupNode node, bool beforeChildren);
        void Visit(LiteralNode node);
    }

    /// <summary>
    /// Base class for regular expression tree nodes.
    /// </summary>
    public abstract class RegexResultTreeNode : IComparable
    {
        private SortedDictionary<RegexResultTreeNode, RegexResultTreeNode> children = new SortedDictionary<RegexResultTreeNode, RegexResultTreeNode>();

        public RegexResultTreeNode(int startIndex, int endIndex)
        {
            StartIndex = startIndex;
            EndIndex = endIndex;
        }

        public void AddChildNode(RegexResultTreeNode child)
        {
            children.Add(child, child);
        }

        public void RemoveChildNode(RegexResultTreeNode child)
        {
            children.Remove(child);
        }

        public IEnumerable<RegexResultTreeNode> ChildNodes { get { return children.Values; } }

        public abstract void Accept(IRegexResultTreeNodeVisitor visitor);

        public int StartIndex { get; private set; }
        public int EndIndex { get; private set; }

        public int CompareTo(object obj)
        {
            RegexResultTreeNode other = obj as RegexResultTreeNode;
            if (this.StartIndex < other.StartIndex) { return -1; }
            if (other.StartIndex < this.StartIndex) { return 1; }
            if (this.EndIndex < other.EndIndex) { return -1; }
            if (other.EndIndex < this.EndIndex) { return 1; }
            return 0;
        }

        public bool IsChildOf(RegexResultTreeNode other)
        {
            return (this.StartIndex >= other.StartIndex && this.EndIndex <= other.EndIndex);
        }
    }

    /// <summary>
    /// Node representing an entire string containing regular expression
    /// matches.
    /// </summary>
    public class RootNode : RegexResultTreeNode
    {
        public RootNode(int startIndex, int endIndex) : base(startIndex, endIndex) { }

        public override void Accept(IRegexResultTreeNodeVisitor visitor)
        {
            visitor.Visit(this, true);
            foreach (RegexResultTreeNode child in this.ChildNodes)
            {
                child.Accept(visitor);
            }
            visitor.Visit(this, false);
        }
    }

    /// <summary>
    /// Node containing a match.
    /// </summary>
    public class MatchNode : RegexResultTreeNode
    {
        public MatchNode(int startIndex, int endIndex) : base(startIndex, endIndex) { }

        public override void Accept(IRegexResultTreeNodeVisitor visitor)
        {
            visitor.Visit(this, true);
            foreach (RegexResultTreeNode child in this.ChildNodes)
            {
                child.Accept(visitor);
            }
            visitor.Visit(this, false);
        }
    }

    /// <summary>
    /// Node containing a group within a match.
    /// </summary>
    public class GroupNode : RegexResultTreeNode
    {
        public GroupNode(string groupName, int startIndex, int endIndex) : base(startIndex, endIndex)
        {
            this.GroupName = groupName;
        }

        public string GroupName { get; private set; }

        public override void Accept(IRegexResultTreeNodeVisitor visitor)
        {
            visitor.Visit(this, true);
            foreach (RegexResultTreeNode child in this.ChildNodes)
            {
                child.Accept(visitor);
            }
            visitor.Visit(this, false);
        }
    }

    /// <summary>
    /// Node containing a literal.
    /// </summary>
    public class LiteralNode : RegexResultTreeNode
    {
        public LiteralNode(string literal, int startIndex, int endIndex) : base(startIndex, endIndex)
        {
            this.Literal = literal;
        }

        public string Literal { get; private set; }

        public override void Accept(IRegexResultTreeNodeVisitor visitor)
        {
            visitor.Visit(this);
        }
    }
}

By viewing downloads associated with this article you agree to the Terms of Service and the article's licence.

If a file you wish to view isn't highlighted, and is a text file (not binary), please let us know and we'll add colourisation support for it.

License

This article, along with any associated source code and files, is licensed under The Code Project Open License (CPOL)

About the Author

Andreas Andersen
Software Developer (Senior)
Denmark Denmark
.NET developer. I wanted to be first an astronaut, then a jet pilot, but when I got a Commodore 64 for Christmas I never looked back. Also I would never have qualified for the first two things and everybody knows computer programmers get all the girls.

| Advertise | Privacy | Mobile
Web04 | 2.8.140721.1 | Last Updated 1 Dec 2010
Article Copyright 2010 by Andreas Andersen
Everything else Copyright © CodeProject, 1999-2014
Terms of Service
Layout: fixed | fluid