-
写的是一个语法分析器 是用LR分析法分析一个布尔表达式,最后用逆波兰是输出,希望对大家有用...
写的是一个语法分析器 是用LR分析法分析一个布尔表达式,最后用逆波兰是输出,希望对大家有用-writes of a parser is LR analysis for a Boolean expression, with the final output is the inverse of Poland, a member of the useful!
- 2022-01-28 17:21:55下载
- 积分:1
-
fish小程序
fish小程序 -fish applet applet fish
- 2022-03-17 19:10:47下载
- 积分:1
-
This manual describes the target environment of the 8051 how to use the Cx51 opt...
本手册讲述对8051 的目标环境如何使用Cx51 优化C 编译器编译C 程序Cx51 编
译器包可以用在所有的8051 系列处理器上可以在WINDOWS 32 位命令行中执行本手
册假定你熟悉WINDOWS 操作系统知道如何编程8051 处理器并会用C 语言编程-This manual describes the target environment of the 8051 how to use the Cx51 optimizing C compiler to compile C program Cx51 compiler package can be used in all of the 8051 series of processors can be WINDOWS 32-bit command-line in the implementation of this manual assumes that you are familiar with WINDOWS operating system, know How do I program the 8051 processor and will use C language programming
- 2022-01-28 11:30:31下载
- 积分:1
-
传教士和野人过河问题程序
传教士和野人过河问题程序- The missionary and the savage cross river the question
procedure
- 2022-04-10 22:18:54下载
- 积分:1
-
C0的语法编译器,详细设计,适用于初学者编译…
自己开发的c0文法编译器,有详细的设计说明,适用于编译器初学者-C0 own grammar compiler, a detailed design that apply to the compiler for beginners
- 2022-10-02 01:50:03下载
- 积分:1
-
bilangan project that I do in my lab
bilangan project that I do in my lab
- 2022-02-20 12:05:47下载
- 积分:1
-
编译原理课程设计,输入布尔表达式,然后有系统自动转换为逆波兰四元式...
编译原理课程设计,输入布尔表达式,然后有系统自动转换为逆波兰四元式-compiler theory of curriculum design, the importation of Boolean expressions, and then the system automatically converted to reverse Poland four yuan-
- 2022-04-11 09:08:28下载
- 积分:1
-
GNU的词法/语法分析器bison源码,最新版本bison
GNU的词法/语法分析器bison源码,最新版本bison-2.1-GNU/parser bison source, the latest version of bison- 2.1
- 2022-02-10 06:25:25下载
- 积分:1
-
PL/0教学语言的编译程序原代码。
PL/0教学语言的编译程序原代码。-PL/0 teaching language compiler original code.
- 2022-03-10 12:25:48下载
- 积分:1
-
input is a regular expression, you can use : lowercase letters or numbers, said...
输入一个正则表达式,可以使用: 小写字母或数字,表示终结符;*,闭包;+,并集;~,补集;E,空串;O,空集 然后程序将生成 相应的NFA,以及化简之后的DFA,最后再输入一个字符串,程序判断它是否满足该正则表达式-input is a regular expression, you can use : lowercase letters or numbers, said Fu end;* Closure; , And set; To complement the set; E, empty string; O, empty set procedures will then generate the corresponding NFA, and the simplification of the DFA after finally lose into a string, procedures judgment whether it is to meet the regular expression
- 2022-06-14 20:06:53下载
- 积分:1