Description: Enter the regular expression into NFA, DFA, document from the test to find out the biggest match Substring
- [regular_to_DFA] - Translation principle--- regular expres
- [toDFA.Zip] - discrete mathematics learning at the req
- [Soft20060210155900603] - the lexical analyzer, very useful, and f
- [REGEXPP3.ZIP] - regular expression source code for the s
- [regtonfatodfa] - Regular expression is converted to NFA a
- [DFA] - Compile the application of the principle
- [henry03] - Running so that PC-1 may be playing to b
- [DFA] - Enter a regular expression, the output c
- [Automate] - graphic Automaton simulator,NFA to DFA c
- [RegEx2NFA2DFA_RC] - This is a C program used in compiling th
File list (Check if you may need any files):
TEMPLATE
........\dfa.cpp
........\testfile1.txt