Regular expression to DFA conversion c code
please if u have any algo or code send me

A general-purpose conversion program for this task would be quite elaborate. In fact, there are special utility programs (special languages, actually) that work to do most of the conversion.

Many programmers have performed this very thing (to write compilers, for example) using a lexical analyzer, called Lex, and a "compiler-compiler" named Yacc. (GNU equivalents are called Flex and Bison, and are supplied with, or are available for, most Linux distributions.)

The output of Lex and/or Yacc is some C code (data structures and functions) that the implementer uses to actually make a working program.

For a specific, special-purpose program for some simple problem, you could do everything in C, without the Lex front-end.

I would not expect an assignment like this to be given in an introductory-level class unless the actual task was restricted to a small, specific example. If this is a class covering formal grammar and/or finite automata, then there is a fair amount of understanding that is prerequesite to actually sitting down and planning the code, let alone actually starting to write the code.

I might start with a general approach, as described in this tutorial:
http://lambda.uta.edu/cse5317/spring01/notes/node9.html

If you start an implementation and have some problems, then you can show us what you have, and ask specific questions about what you don't understand.

Regards,

Dave