-
用ｃ语言实现的语法语义分析程序 实现了四元式得生成功能齐全...
用ｃ语言实现的语法语义分析程序 实现了四元式得生成功能齐全-with language syntax semantic analysis of the program in four yuan-generation multifunctional
- 2022-05-29 02:22:19下载
- 积分：1
-
语法分析.h,对一个文法给以判断所给的句子是不是文法所生成的。...
语法分析.h,对一个文法给以判断所给的句子是不是文法所生成的。- The grammar analysis h, gives the sentence to a grammar which
the judgement gives is the grammar produces.
- 2022-01-25 22:19:44下载
- 积分：1
-
此源代码程序为三色LED灯板PWM 控制程序，实现多路LED灯恒流控制。...
此源代码程序为三色LED灯板PWM 控制程序，实现多路LED灯恒流控制。-This source code program for the tri-color LED lamp board PWM control procedures, to achieve multi-channel constant current LED lamp control.
- 2022-02-01 00:13:15下载
- 积分：1
-
A used flex, bison and vc development stack machine, stack machine for one inter...
一个用flex、bison和vc开发的堆栈机，堆栈机为一解释器，支持简单的表达式和赋值、条件和循环语句。-A used flex, bison and vc development stack machine, stack machine for one interpreter to support the simple expressions and assignment, conditions and loop.
- 2022-07-06 09:01:15下载
- 积分：1
-
编译原理
编译原理-词法分析器-定义单词符号的种类，编码的规则等功能-Compiler Construction Principles- lexical analyzer- the definition of the types of word symbols, coding rules and other functions
- 2022-02-04 18:23:18下载
- 积分：1
-
tiny 编译器
tiny 编译器-tiny compiler
- 2022-06-18 04:13:54下载
- 积分：1
-
The translation principle procedure, please much advises.
编译原理程序,请多指教。- The translation principle procedure, please much advises.
- 2022-08-26 09:51:32下载
- 积分：1
-
C编译器源代码(超级牛b)
C编译器源代码(超级牛b)-C compiler source code (super cow b)
- 2022-03-19 16:59:42下载
- 积分：1
-
2500AD X8051汇编语言编译器连接器使用说明
2500AD X8051汇编语言编译器连接器使用说明-2500AD X8051 assembly language compiler for use connectors
- 2023-03-09 20:55:04下载
- 积分：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
