-
解法:对原文法消除左递归,根据消除左递归后的等价文法建立语法树,而后对此语法树 进行后根遍历,即可得到后缀式....
解法:对原文法消除左递归,根据消除左递归后的等价文法建立语法树,而后对此语法树 进行后根遍历,即可得到后缀式.- Solution: Eliminates the left recursion to the original
grammar, after equal in value grammar establishment grammar tree which
eliminates the left recursion, after but the grammar tree carries on
the root to spread the calendar regarding this, after then obtains
decorates the type
- 2022-01-22 17:47:18下载
- 积分：1
-
实现NFA确定化子集算法程序。DFA是NFA的特例。对每个NFA N一定存在一个DFA Ｍ ，使得 L(M)=L(N)。对每个NFA N存在着与之等价的DFA...
实现NFA确定化子集算法程序。DFA是NFA的特例。对每个NFA N一定存在一个DFA Ｍ ，使得 L(M)=L(N)。对每个NFA N存在着与之等价的DFA M。从NFA的矩阵表示中可以看出，表项通常是一状态的集合，而在DFA的矩阵表示中，表项是一个状态，NFA到相应的DFA的构造的基本思路是：1.DFA的每一个状态对应NFA的一组状态. 2. DFA使用它的状态去记录在NFA读入一个输入符号后可能达到的所有状态.。-achieve NFA Number algorithm to determine procedures. DFA NFA is a special case. NFA N for each must exist a DFA M, makes L (M) = L (N). N for each NFA exist with the DFA M equivalent. NFA from the matrix can be seen, tables are usually set of a state, and in the matrix DFA said, Form is a state of the corresponding NFA DFA basic structure of ideas : 1.DFA each one corresponds to a group of NFA state. 2. DFA use it to the state records in NFA Reading input into a symbol after all reach the state. .
- 2022-08-23 12:39:40下载
- 积分：1
-
一个用C++编写的C语言词法分析程序，本人在做WEBSPHERE MQ的收发信息时需要对远端发过来的数据进行解析，然后才能确定要发送到哪一个终端，因此写了对词法...
一个用C++编写的C语言词法分析程序，本人在做WEBSPHERE MQ的收发信息时需要对远端发过来的数据进行解析，然后才能确定要发送到哪一个终端，因此写了对词法分析做了一定的研究，也就写了这么一个程序.-prepared by the C language lexical analysis procedures, I do WebSphere MQ the need to send and receive information sent to the remote data analysis, in order to determine where to send a terminal, wrote a pair of lexical analysis done some research, it was such a procedure.
- 2023-07-26 16:15:04下载
- 积分：1
-
一个Modula
一个Modula-2语言分析器-A Modula-2 language analyzer
- 2022-03-10 22:13:55下载
- 积分：1
-
Delphi编的pl0编译器
delphi编的pl0编译器-delphi arranges pl0 compiler
- 2022-12-02 06:40:03下载
- 积分：1
-
YBasic编程语言的移植和开发
YBasic编程语言的移植和开发
YBasic编程语言的移植和开发...
YBasic编程语言的移植和开发
YBasic编程语言的移植和开发
YBasic编程语言的移植和开发-YBasic programming language and development of transplant YBasic programming language and development of transplant YBasic programming language and development of transplant
- 2022-02-21 14:44:51下载
- 积分：1
-
LL(1)文法使用的是确定的自顶向下的分析技术。LL(1)的含义是：第一个L表明自顶向下分析是从左向右扫描输入串，第2个L表明分析过程中将使用最左推导，1表明只...
LL(1)文法使用的是确定的自顶向下的分析技术。LL(1)的含义是：第一个L表明自顶向下分析是从左向右扫描输入串，第2个L表明分析过程中将使用最左推导，1表明只需向右看一个符号便可决定如何推导，即选择哪个产生式(规则)进行推导。-LL (1) grammar using a set top-down analysis techniques. LL (1) the meaning is: the first one L shows a top-down analysis is a scan input string from left to right, the first two L shows the analysis process will be the most left-derivation, one that will be just right to see a sign can decide how to derive, choose what Production (rules) for derivation. LL (1) grammar, followed by calculation of the discriminant needs FIRST sets, FOLLOW sets and SELLECT set, and then determine whether to LL (1) grammar, the last sentence further analysis.
- 2022-02-06 11:59:23下载
- 积分：1
-
编译原理的一个题目：算符优先分析
编译原理的一个题目：算符优先分析-Compilation Principle of a topic: operator priority analysis
- 2023-05-29 10:30:03下载
- 积分：1
-
ll(1)语义分析器
ll(1)语义分析器-ll (1) Semantic Analyzer
- 2022-03-13 06:13:38下载
- 积分：1
-
KEIL 编译器的使用说明，共八章非常详细。
KEIL 编译器的使用说明，共八章非常详细。-KEIL compiler userguide, a total of eight chapters in great detail.
- 2022-07-27 03:01:01下载
- 积分：1
