搜索资源列表
bianyisrc
- 编译原理实验包括正规式到NFA,NFA到DFA、LL1、LR代码都执行过，都没有错误-Compile regular expression to the principle experiment, including NFA, NFA to DFA, LL1, LR code is executed, no errors
AjaxParser
- 词法分析的程序。核心函数是一个状态切换的函数 CAjaxParserDlg::Route。状态切换函数解根据一个 DFA 来对输入的文本进行分析。也就是说，如果你做一个新的DFA，就能分析新的词法。 DFA 的初始化在CAjaxParserDlg::OnInitDialog。- Lexical analysis procedure. The core function is condition cut function CAjaxParserDlg::Route. The condition
dolphin-0.2.10-src
- Full support for extended regular expressions (those with intersection and complement); Support for some kinds of cycles in grammar; DFA-based operation; Unicode support; C++ only, requires a modern compiler; Lexical analyzers can be configured to ge
dfa_ny
- 给出去趋势分析DFA方法的精确求解，应用于股票数据分析和气象要素场的长程相关性研究-Out trend analysis to the exact solution of DFA method applied to analysis of stock data and meteorological elements of market research and long-range correlation
N_DFA
- 编译原理，实现NFA到DFA之间的转换，中间的方法都有-Compiler theory, to achieve between the NFA to DFA conversion, Central methods have
cffxsy
- 1.任选一个C语言词法子集设计DFA模型 2.要求对C语言词法规则设计编码，最后编写成源程序并能输出正确的结果。 3.给出2个测试实例，一个正确的和一个错误的来验证本词法分析程序。 4.用文件输出单词属性表（名字为班号最后2位+学号.txt）-1. Choose a C-word method design DFA model 2. Calls for the design of C language lexical coding rules, and finally devel
pro2
- 这是一个用来解析文件从而得到一个DFA的设计的原理程序1-This is a document used to resolve in order to get a DFA Design Principle 1
compiler
- 一个不算完整的编译器实现，包括前端的词法分析，语法分析，语义分析，中间代码生成，中间代码优化及界面部分-A compiler is not complete realization, including the front of lexical analysis, syntax analysis, semantic analysis, intermediate code generation, code optimization and interface the middle part of
Form1
- c#编写 浮点数的DFA 由自动机模式构造 内涵详细步骤 -c# float prepared by the DFA automaton model of tectonic connotation of the detailed steps
regexpanddfa
- 正规式的处理及dfa的转换，计算理论导论-Formal style of handling and DFA conversion, Introduction to Computing Theory
legicalanalyse
- 完全用DFA实现，可以实现词法分析，并且可以对其进行简单的改错-DFA fully realized, lexical analysis can be achieved and can be a simple error
PDAProject
- PDA构造，并且可以识别相应文法的句子（纠正，刚才上传的FAPROJECT是又穷自动机）-PDA structure, and can identify the corresponding grammatical sentences (corrected, just upload FAPROJECT is another DFA)
5656
- 它输入描述构词规则的一系列正规式,然后构建有穷自动机和这个有穷自动机的一个驱动程序,进而生成一个词法分析程序.-Enter the descr iption of its formation a series of formal rules of style, and then build a DFA and the DFA, a driver, and then generate a lexical analysis program.
InformalstyletotheDFA
- 实现从正规式到有穷自动机的转换，代码附带注释！-From the formal ceremony to DFA conversion, code incidental Notes!
Lex
- 基于C++的编译器词法分析模块生成器[Lex]，可使用Visual C++ 2003编译，分析词法定义文件，产生确定自动机[DFA]和对应词法的分析代码，使用此代码可解析C++源码并生成TOKEN序列-Based on C++ compiler lexical analysis module generator [Lex], can use the Visual C++ 2003 to compile, analyze lexical definition file, generated to
thedesignofanalyzing
- 主要介绍了词法分析器的lex实现以及DFA和NFA构造状态表的方法-Mainly introduce the lexical analyzer lex implementation, as well as DFA and NFA state table structure of the Ways
NFA
- 实现NFA到DFA的转换EVMSG_INSTALLED 0x00000064L-convert NFA to DFA
NFAtoDFA
- 实现DFA转化为NFA，功能比较简单，但程序结构比较合理-DFA implementation into NFA, feature relatively simple, but the program structure more reasonable
N2D
- 一个自己写的NFA转DFA的程序，编译的作业，很不错哦！-Write their own procedures for NFA to DFA, the compiler of the operation, is pretty good, oh!
scanner
- 用 C++ 作为宿主语言完成： Java语言词法分析器的设计和实现 使用DFA实现词法分析器的设计； 实现对Java源程序中注释的过滤； 利用两对半缓冲区从文件中逐一读取单词； 词法分析结果属性字流存放在独立文件(文件名：scanner_output)中； 统计源程序每行单词的个数和整个源文件单词个数； 具有报告词法错误和出错位置（源程序行号和该行字符）的功能；-Using C++ as the host language to complete: Java lang