kindly give me the source code for NFA to DFA conversion.

Comments
Kindly sod off and STFW yourself you lazy leech

Can you specify your problem more clearly?Click here

dear sir,
i want to generate a non-deterministic finite automata for a expression.eg:(a|b)*abb. then to convert the NFA to deterministic finite automata

Are you talking about using NFA regexp in a DFA environment?
Start with a DFA tool is the simple answer. There really is no code to convert from one to another, because it doesn't make much sense to do so. C and C++ have regexp libraries available for them. Pick one. Windows provides the .NET version.

You do realize that which tool you use dictates which type of regex processing occurs? To get a list of which tools have what regex flavor (including POSIX) try:

J Friedl 'Mastering Regular Expressions' 2nd ed 2004

Then if you want, download source for one of them.

kindly give me the source code for NFA to DFA conversion.

Comments
Come back when you have something better to offer than "gimmetehcodexplz"
Read the forum rules first!!

kindly give me the source code for NFA to DFA conversion.

i want the code for coverting nfa to dfa

hello
I need C code to build a finite automata and NON deterministic automata translate to equal DFA. This is for my project please help!

This thread has been bumped to many times over the last few year with "gimme code!" replies.

For future visitors:
Here's how to ask a question on a forum.
Here's the rulebook, read and follow it.
Here's why we don't help people who show no effort.

Closed.

Comments
You-da-man
ty :)
This article has been dead for over six months. Start a new discussion instead.