locked
Lexical Analysis by Using Finite State Automata RRS feed

  • Question

  • - Regular Expressions
    -
    Nondeterministic Finite-State Automata (NFA)
    -
    Deterministic Finite-State Automata (DFA)

    Hi. I want to develop a program that analyze regex by using Finite State Automata. I don't find any source code in C# .  Is there anybody that has source code in C#? Thanks.
    Friday, November 23, 2007 11:24 AM

Answers

  • Hi,

     

    In .NET Base Class Library we have the ready-made Regex class that manipulate regular expressions. If you need to build one of your own finite state machine, the folowing article may help you a bit:

      Writing own regular expression parser

     

    It is written in C++ but the general idea is the same. (Finding a sample exactly meet your needs is not that easy.)

     

    Best Regards

    Chunsheng Tang

    Monday, November 26, 2007 5:58 AM
    Moderator