Click here to Skip to main content
15,885,952 members
Articles / Programming Languages / C#

Solving complex parsing tasks with RegexTreeer

Rate me:
Please Sign up or sign in to vote.
3.75/5 (8 votes)
23 Oct 2008LGPL39 min read 33.2K   440   23  
Solving complex parsing tasks by utilizing Regular Expression trees built with RegexTreeer.
//********************************************************************************************
//Author: Sergey Stoyan, CliverSoft.com
//        http://cliversoft.com
//        stoyan@cliversoft.com
//        sergey.stoyan@gmail.com
//        22 March 2008
//Copyright: (C) 2008, Sergey Stoyan
//********************************************************************************************
using System;
using System.Collections.Generic;
using System.Windows.Forms;
using System.IO;

namespace Test
{
    static class Program
    {
        /// <summary>
        /// The main entry point for the application.
        /// </summary>
        [STAThread]
        static void Main()
        {
            //Test t = new Test();
            //t.Run();

            //Console.WriteLine("\n\n");

            Test2 t2 = new Test2();
            t2.Run();

            Console.WriteLine("\n\nPress any key to exit");
            Console.ReadKey();
        }
    }
}

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 GNU Lesser General Public License (LGPLv3)


Written By
Architect CliverSoft (www.cliversoft.com)
Ukraine Ukraine
Sergey is graduated as applied mathematician. He is specialized in custom development including parsing tools, client/server applications.
github: https://github.com/sergeystoyan
site: http://cliversoft.com

Comments and Discussions