搜索资源列表
grammatica-1.4.tar.gz
- Grammatica is a C# and Java parser generator (compiler compiler). It improves upon simlar tools (like yacc and ANTLR) by creating well-commented and readable source code, by having automatic error recovery and detailed error messages, and by support
whale-0.3.2-src.zip
- 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 pars
DFA自动版
- 我的编译原理大作业，自动分析语法，判断语句是否符合规则。DFA即有穷自动机。因为这个工作量比较大，所以恕我不无帐号发放了。-I build large operating principle, automatic syntax analysis, judgment statement with the rules. DFA that the DFA. Because the workload is bigger, it is not without regret that I paid the
20051121
- 利用 lex 和yacc自动生成C语言子集的词法分析和语法分析程序的源程序-using lex and generates automatic generation of C language subset of lexical analysis and parsing the source code of procedure
LR1
- LR1语法分析器 自动识别开始符号、终结符、非终结符； 生成各非终结符的 first和follow集 生成LR1分析表-Complete parser automatic identification symbols beginning and ending address, end-FU; The end-generating website and follow the first generation Complete Set Table Analysis
javaStemming
- 用java编写的自动抽取词根程序，比如expert,experts,expertise等，通过抽取词根后，为exper-prepared using the automatic extraction Roots program, such as expert, experts, expertise, taken by Roots, for Exper
ExpressAnalysis
- 表达式分析, 支持算术运算,括号,关系运算,逻辑运算,字符串的like运算等。采用了有限自动机做词法分析, 语法分析用算符优先分析方法，正负号算符使文法不是OPG，因此这里作了特殊处理。分析的结果是逆波兰式, 存在一个链表中。在逆波兰式的基础上，用一个栈来进行求值。在vc++6.0下试验通过。 如有问题，可以mail: zch888email@163.com 我将尽快回复你。-expression analysis, supports arithmetic operations, bra
expresion
- 一个公式解析程序，支持变量，具有操作符优先级的自动识别，语法错误报警等功能-an analytical formula that supports variable, with the operator precedence, the automatic recognition of grammatical mistakes alarm functions
c02IDE
- 类似vc6的集成开发环境的源代码，编辑器，编译器，调试器，自动代码生成技术，完整的，包括CJlibrary .但很粗糙，处女做，以后有升级版。- Similar vc6 integrated development environment source code, editor, compiler, debugger, automatic code production technology, complete, including CJlibrary But is very rough,
zidongji
- 编译原理中的ＮＦＡ转换到ＤＦＡ（自动机的转换）-compiler principles of the NFA conversion to DFA (automatic machine translation)
analystor
- 课程设计中的，简单的利用自动机来实现的词法分析。可以分辨出哪一个是短语。-curriculum design, and a simple use of automatic machines to achieve the lexical analysis. Can tell which is a phrase.
hanzishibie_c
- mydate.dat为字库 先点击file, 点open，读入字库 学习时字库自动保存 已有键盘字符，字母，数字 和简单汉字 如要识别复杂汉字，请先用学习功能-mydate.dat Click on the first character of the file, open spots, Reading into the character study of character has been preserved automatic keyboard characters,
complior
- 编译器词法分析 1． 设计扫描器的自动机； 2． 设计翻译、生成Token的算法； 3． 编写代码并上机调试运行通过。 • 要求：输入——源程序文件； 输出——（1）相应的Token序列； （2）关键字、界符表，符号表，常数表。 -compiler is a lexical analysis. Automatic design of the scanner; 2. Design translation, the Token generation algor
zidongchuli
- 一个自动字符处理类- An automatic character processing class
shpf1.9
- shpf 1.9一个并行编译器，自动的将串行fortran程序转换成并行的mpi程序。-shpf 1.91 parallel compilers, are automatic transform the serial fortran procedure the parallel mpi procedure.
Regular-toDFA
- 从正规式到有限自动机及确定的有限自动机的化简。-from the formal ceremony to Finite Automata and the limited automatic machine simplification.
词法分析1
- 在文本下编辑,把需要分析的程序写在zf-infile.txt内，程序的结尾必须以“@”标志符结束，程序结果输出在同目录内，文件名为zf-outfile.txt,此文件为自动生成。 - Edits under the text, the procedure which needs to analyze writes in zf-infile.txt, the procedure ending must the designator end by \"@\", the procedure res
dict
- 这是我的中文信息处理的小作业，是一个自动分词系统。- This is my Chinese information processing 灏忎綔 industry, is an automatic participle system.
有限自动机
- 有限自动机的运行，利用状态表和有限自动机的运行原理，识别一个输入串是否为一个有效的无符号定点实数。-of the operation, the use of tables and limited state of the automatic machine operation principle, to identify whether an input string as a symbol of effective non-sentinel real.
接受语言{{}}的一台自动机
- 构造接受语言{{}}的一台自动机，对于任意输入的一个字符串，模拟其运行过程，判断字符串是否接受。-structure acceptable language (()) of an automatic machine for the indiscriminate importation of a string, its process simulation, the judge whether to accept the string.