the program basicly, will get an regular expression like (a|b)* and will return nfa which is correspondance with this regular expression. thompson's algorithm will be used in conversion(). our console application will work like applet below, [login to view URL] this programs working good, but there is a small difference what i want. we will use union as "|" in our program. the applet in this link gets (a U b)* we want to take it as (a|b)* > program will be implemented in java program will be console application program will not use jflex program will be implemented basic. program will be explained line by line with comment.
## Deliverables
1) Complete and fully-functional working program(s) in executable form as well as complete source code of all work done.
2) Deliverables must be in ready-to-run condition, as follows (depending on the nature of the deliverables):
a) For web sites or other server-side deliverables intended to only ever exist in one place in the Buyer's environment--Deliverables must be installed by the Seller in ready-to-run condition in the Buyer's environment.
b) For all others including desktop software or software the buyer intends to distribute: A software installation package that will install the software in ready-to-run condition on the platform(s) specified in this bid request.
3) All deliverables will be considered "work made for hire" under U.S. Copyright law. Buyer will receive exclusive and complete copyrights to all work purchased. (No GPL, GNU, 3rd party components, etc. unless all copyright ramifications are explained AND AGREED TO by the buyer on the site per the coder's Seller Legal Agreement).
## Platform
java console application