搜索资源列表
LR0
- (1)构造文法G的LR(0)项目 (2)构造文法G的LR(0)项目集规范族及识别活前缀的DFA (3)证明文法G不是LR(0)文法而是SLR(1)文法，并构造SLR(1)分析表 (4)设计LR语法分析程序，且能输出分析过程 (5)列举两个例子测试语法分析程序（识别失败一例，识别成功一例，后者推导步骤不得少于10步） -(1) construct grammar G of the LR (0) item (2) construct grammar G of the LR (0)
LR1
- 利用字符二维数组对文法、First集、Follow集、终结符集、非终结符集等数据进行存储，还有一个是状态表存储DFA的状态。二维TAB表对其中的DFA表进行存储，横坐标是状态号，纵坐标为文法中的符号（终结符和非终结符）。-Two-dimensional array of characters to use grammar, First Set, Follow sets, at the end of sets, sets and other non-terminator data storage,
DFA
- 实现去趋势波动分析，计算得到波动函数。分段时从两端分别开始避免丢失数据。-Detrended fluctuation analysis of implementation, the calculated wave function. Starting from the ends of the respective segments to avoid loss of data.
usb_OTG
- usb OTG 协议详解，详细介绍了usb通讯中的各个细节，有参考价值-dfa dfasd dffa
NFA
- 用C#编写的不确定有穷自动机NFA=>确定有穷自动机DFA的转换算法，-Uncertainty with C#, finite automata NFA => OK finite automaton DFA conversion algorithm
DFA_2
- NFA转换为DFA，包括确定化和最小化。-NFA into DFA, including the identification of and minimized.
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!