-
对简单的C程序或者Pascal程序进行词法分析
对简单的C程序或者Pascal程序进行词法分析以TOKEN字的形式放入结果文件-of simple C program or Pascal procedures lexical analysis in the form of the word TOKEN Add outcome document
- 2023-04-26 18:25:03下载
- 积分：1
-
一个基于C语言体系下的词法分析器,能做简单的词法分析
一个基于C语言体系下的词法分析器,能做简单的词法分析-A system based on the C language under the lexical analyzer, can do a simple lexical analysis
- 2023-03-05 09:00:03下载
- 积分：1
-
java写的词法分析器，写得不好别怪我
java写的词法分析器，写得不好别怪我-java writes the morphology analyzer, writes is not good do not
blame me
- 2022-01-27 13:39:42下载
- 积分：1
-
我写的词法语法分析器
我写的词法语法分析器- I write morphology grammar analyzer
- 2022-02-12 05:45:22下载
- 积分：1
-
implementation of multiple inheritance un c
implementation of multiple inheritance un c-implementation of multiple inheritance un c++
- 2022-03-16 21:11:22下载
- 积分：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
-
前些天写了个小语言的词法分析程序，因为前些天在VC知识库看到一个pascal词法分析的程序，觉得写得挺复杂的。其实词法分析程序的原理都是一样的，所以我想只要搞明...
前些天写了个小语言的词法分析程序，因为前些天在VC知识库看到一个pascal词法分析的程序，觉得写得挺复杂的。其实词法分析程序的原理都是一样的，所以我想只要搞明白了简单的词法分析程序，再写复杂的就不难了，无非是多加几个关键字，多写几个条件判断语句而已。词法分析是编译程序的基础，也是最简单的。好，现在让我们看程序吧。 先让我们看看这个小语言的文法吧-few days ago wrote a small language lexical analysis procedures, because the other day in the knowledge base to see a VC pascal lexical analysis procedures, find that quite complex. In fact, lexical analysis procedure is the same principle, I think if you understood a simple lexical analysis procedure to write complex it is not difficult, is nothing but add a few keywords and writing several conditions judgment statement it. Lexical analysis is the basis of compilers, as well as the most simple. Well, now let us look at the procedures it. Let us look at this small language grammar it
- 2022-08-08 01:17:36下载
- 积分：1
-
The purpose of this project was to design and implement a debugger for the ATmeg...
该项目的目的是设计和实施，为的沟通通过其JTAG接口和控制是通过设置断点和寄存器和存储器访问程序的执行能力ATmega644调试。-The purpose of this project was to design and implement a debugger for the ATmega644 that communicated through its JTAG interface and was capable of controlling program execution by setting breakpoints and accessing registers and memory
- 2022-07-20 14:47:08下载
- 积分：1
-
此工具是arm
此工具是arm-linux-gcc交叉编译工具（cross-3.4.4），这个是我自己编译的，我试过，我用它编译了u-boot1.2.0没有问题，这个交叉编译器编了好长时间，我之前在网上搜了好长时间，但是没搜到，所以今天贡献出来，免得大家还得费时间去编译，我现在用是没有问题，如果有问题请多指教。希望热爱linux的同志们多贡献点好东西出来！-This tool is arm-linux-gcc cross compiler tools (cross-3.4.4), this is my own compiler, I tried, I use it to compile the u-boot1.2.0 no problem, the cross compiler made a good long time before I found online a long time, but never found, so this contribution to come out, so everyone will have time to compile, I now use is no problem, please advise if there are problems. Hope love linux comrades contribution to point out good things!
- 2022-04-23 10:04:50下载
- 积分：1
-
语法分析器(C++)源代码＋其详细的课程设计报告
输入的文法可以消除左递归并提取公共左因子求出文法的非终结集合――FIRST和FOLLOW集并对输入的算符优...
语法分析器(C++)源代码＋其详细的课程设计报告
输入的文法可以消除左递归并提取公共左因子求出文法的非终结集合――FIRST和FOLLOW集并对输入的算符优先文法，构造算符优先关系表
-Parser (C++) Source code its detailed report on curriculum design input left recursive grammar can be eliminated and the public left factor extract derived grammar of non-end collection- FIRST and FOLLOW set of the input operator priority grammar, operator precedence relations structure table
- 2022-06-20 01:08:25下载
- 积分：1
