Click here to Skip to main content
12,623,724 members (28,813 online)
Click here to Skip to main content

Tagged as


23 bookmarked

Solving complex parsing tasks with RegexTreeer

, 23 Oct 2008 LGPL3
Solving complex parsing tasks by utilizing Regular Expression trees built with RegexTreeer.
//Author: Sergey Stoyan,
//        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>
        static void Main()
            //Test t = new Test();


            Test2 t2 = new Test2();

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

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.


This article, along with any associated source code and files, is licensed under The GNU Lesser General Public License (LGPLv3)


About the Author

Sergey Stoyan
Architect CliverSoft (
Ukraine Ukraine
Sergey is graduated as applied mathematician. He is specialized in client/server applications, backup systems, data parsing tools, web crawlers and search engines. Work for CliverSoft Co. Favorite languages are C#, C++, Perl

You may also be interested in...

| Advertise | Privacy | Terms of Use | Mobile
Web01 | 2.8.161128.1 | Last Updated 23 Oct 2008
Article Copyright 2008 by Sergey Stoyan
Everything else Copyright © CodeProject, 1999-2016
Layout: fixed | fluid