Description: Using c++ parser to achieve this method, including regular expression analysis, while the NFA is converted, NFA to DFA conversion, and end the match, see the package README file
- [visualclexicalanalyzer.Rar] - a compiler with the lexical analyzer is
- [reg2NFA] - This is an experiment in compiling princ
- [reg2NFA(java)] - Regular Expression to NFA, NFA to DFA s
- [lex] - ① the use of automatic machine technolog
- [lex] - Using C language to achieve a simple lex
- [SeuLexProject] - Analysis of the Lex input file of regula
- [lex] - c language lexical analysis to ensure th
- [RegextoDFA] - Regular expressions turn DFA, design pri
File list (Check if you may need any files):
lex
...\README.txt
...\src
...\...\cache
...\...\DFA.cpp
...\...\DFA.h
...\...\ErrorHandle.h
...\...\lex.bpf
...\...\lex.bpr
...\...\lex.cgl
...\...\lex.sln
...\...\lex.vcproj
...\...\main.cpp
...\...\REUtils.cpp
...\...\REUtils.h
...\...\Scanner.cpp
...\...\Scanner.h
...\...\SetCache.cpp
...\...\SetCache.h
...\...\Source.h
...\...\src.txt
...\...\Thompson.cpp
...\...\Thompson.h
...\...\TokenUtils.cpp
...\...\TokenUtils.h
Download