Write code to build simple lexical analyzer

General information for the business: A simple program for academic study in compilers design
Kind of development: New program from scratch
Num. of modules: 1
Description of every module: I need someone studied compiler material before or has a good experience building compilers component like DFA ,NFA ,lexical analyzer and has good handling on Regular definitions and expressions

I need a simple program to create a DFA generator (Deterministic Finite Automate) that takes
input an action-augmented regular definitions(or Regular expressions) and produce the corresponding fall-back DFA with actions.
design in console application
Description of requirements/functionality: Example for the Regular definitions input for the program :
1- term ---> id |a?
A(term)= Print( id_id_! | id !
A(exp) = print( id ?
A(quest) = print( letter(letter|digit)*

those are augmented regular definitions those definitions are INPUT to the program inform of 3 list of strings : RS(Right Side like "id","digit",,) ,LS(Left Side like " id |a?") , Action

it generates a fall back DFA with actions,then it should be tested by input string to test it's functionality.
like : if the string to test functionality was "b_a_!a?ab?b" to test the above example
it should print output " "
Specific technologies required: C#
OS requirements: Windows
Extra notes: