-
为EBNF符号对象的完整支持;
Complete support for EBNF notation; Object-oriented parser design; C++ output; Deterministic bottom-up "shift-reduce" parsing; SLR(1), LALR(1) and LR(1) table construction methods; Automatic parse tree creation; Possibility to output parse tree in XML format; Verbose conflict diagnostics; Generation of tree traverse procedures
- 2022-01-24 16:51:06下载
- 积分:1
-
应用分枝定界法求解0 / 1背包问题!我的…
背包问题
采用分枝限界法解决0/1背包问题! 本人上机实习作业,通过老师验收,合格! 针对部分上机实习的同学可以来下~
-Knapsack problem using Branch and Bound method to solve 0/1 Knapsack Problem! My internship on the machine operation, through the teacher acceptance, qualified! The machine for some internship students can come to the next ~
- 2022-12-23 06:50:03下载
- 积分:1
-
Small C compiler source code to learn a good source.
Small C 编译器的源代码 学习好的源码。 -Small C compiler source code to learn a good source.
- 2022-01-22 15:45:43下载
- 积分:1
-
(1) 给定一段符合Pascal子集语法的语言,能成功转换成C语言;
(2) 一个简单的说明文档;
(3) 2007.7.14之前上传到ftp:// C...
(1) 给定一段符合Pascal子集语法的语言,能成功转换成C语言;
(2) 一个简单的说明文档;
(3) 2007.7.14之前上传到ftp:// C07:C07@10.11.3.71/upload,用学号建立自己的目录;
(4) (可额外加分5分)若有出错处理功能,请在说明文档中写明可以处理哪几项错误。
注意事项:
(1) 两人一组
(2) 可以使用词法、语法自动生成工具,windows下有Flex,Bison,Linux下有Lex,Yacc,Java的有Jlex,JavaCC,ANTLR等
(3) 不用考虑Pascal和C的关键词不同问题,即Pascal子集语言中假设不出现int,for等作为变量标志符
(4) read()和write()可用由scanf(),printf()等组成的语句转换。
(5) 如果有疑问可以发信给我 xpqiu@fudan.edu.cn.
- 2022-03-23 02:20:36下载
- 积分:1
-
Recursive descent parser recursive recursive descent parser drop grammar parser...
递归下降分析器递归下降分析器删除语法分析器递归下降分析器
- 2022-03-23 12:08:03下载
- 积分:1
-
对于中文分词词典,并对词典数据进行标注…
用于中文分词的切分词典,还有词性标注,以这个词典数据库为基础建立文本分类,文本检索或文本过滤可以节省很多时间.很全,强烈推荐!-for the Chinese word segmentation Dictionary, and tagging to the dictionary database based text classification, text retrieval or text filtering can save a lot of time. All very strongly recommended!
- 2022-08-10 07:33:12下载
- 积分: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
-
简单的LL1分析器,可以作为学习,作业用.
简单的LL1分析器,可以作为学习,作业用.-simple LL1 analyzer can be used as study, work with.
- 2023-03-02 14:25:04下载
- 积分:1
-
Simple Java Gui, really meets with the Java editor opens
简单的Java Gui,用Java编辑器真接打开- Simple Java Gui, really meets with the Java editor opens
- 2022-07-17 19:17:48下载
- 积分:1
-
The translation principle morphology pretreats
编译原理的词法预处理- The translation principle morphology pretreats
- 2022-08-23 19:03:25下载
- 积分:1