搜索资源列表
e34
- 这是用vc++编写的程序,在语音识别中经常用用到,是语音识别的第一步:time alignment. 分别用两种方式完成:1.非递归2.递归-This a vc++ program which is useful in voice recognizing and it is also the basic of the voice recognizing .I use two ways to accomplish it:1 nonrecursion 2.recursion
lianliankan1
- 利用递归来求的，其实连连看的搜索算法也就是搜索从一个点到另外一个点的不超过两次转弯的最短距离！-use recursion to seek the 1000 block of Terry Avenue fact, the search algorithm is a search from one point to another point of not more than twice the minimum distance between turning!
piaoliang
- 在二叉搜索树上删除一个有两个子女的结点时，可以采用以下三种方法： (1) 用左子树TL上具有最大关键码的结点X顶替，再递归地删除X。 (2) 交替地用左子树TL上具有最大关键码的结点和右子树TR上具有最小关键码的结点顶替，再递归地删除适当的结点。 (3) 用左子树TL上具有最大关键码的结点或者用右子树TR上具有最小关键码的结点顶替，再递归地删除适当的结点。可随机选择其中一个方案。 -two forks in search of a tree to delete two chi
消除左递归1
- 对给定的文法消除左递归。- To the grammar which assigns eliminates the left recursion.
消除左递归得到后缀式
- 解法:对原文法消除左递归,根据消除左递归后的等价文法建立语法树,而后对此语法树 进行后根遍历,即可得到后缀式.- Solution: Eliminates the left recursion to the original grammar, after equal in value grammar establishment grammar tree which eliminates the left recursion, after but the grammar tree carrie
classical-recursion-question
- The Chinese promises the tower question is the most classical recursion question, this question has designed this game, alternately plays by the user and automatically demonstrates two parts to be compose
chap2_11_RML
- 递归极大似然数估计，在实际通信系统仿真过程中非常有用-Recursion number of maximum likelihood estimate, in actual communication system simulation process is very useful
matMultRecur
- this code is used for parallel programming(a matrix multiplication with recursion)
compiling
- 编译原理实验：词法分析、语法分析、语义分析，包含代码和报告、构建分析表、消除左递归、语法分析、流程图-Compiler Principle Experiment: lexical analysis, syntax analysis, semantic analysis, including code and reports, construction of the table, to eliminate left-recursion, parsing, flow chart
recursion
- delphi中如何用递归调用方式生成树形结构，树的级别不定；生成方法：首先声明树的结点，自定义树的结点内容，写一个递归函数，在窗体的显示事件里调用递归函数，实现树形结构的生成。-how in delphi to use the recursion transfer way production tree structure, tree s rank not to decide Production method: First stated that tree s point, from the
LL(1)
- LL（1）分析 写的语法分析程序，但是不能实现消除左递归，提取公因子-LL (1) analysis of written grammar analysis program, but can not eliminate the left recursion, extracting common factor
indirect_recursion
- 编译原理消除间接左递归。将结果存于文件中-Compiler to eliminate the principle of indirect left recursion. The results stored in the document
xiaochuzuodigui
- 用于消除左递归的一个用C++语言实现的小程序。里面包含有详细的报告和源代码。-Used to eliminate the left recursion in a C++ language implementation with a small program. Which contains detailed reports and source code.
jisuansuanfa
- 主要描述递归的概念， 掌握设计有效算法的分治策略。 通过下面的范例学习分治策略设计技巧。-Will describe the concept of recursion to master the design of effective algorithm for sub-rule strategy. Examples of learning through the following sub-rule strategy of design skills.
diguixiajiang
- 递归下降的基本思想： 为每一个非终结符构造一个子程序，每一个子程序的过程体中按该产生式的候选项分情况展开，遇到终结符直接匹配，而遇到非终结符就调用相应非终结符的子程序。该分析从调用文法开始符号的子程序开始，直到所有非终结符都展开为终结符并得到匹配为止。若分析过程中达到这一步则表明分析成功，否则表明输入中有语法错误。递归下降分析对文法的限制是不能有公共左因子和左递归。由于文法是递归定义的，因此子程序也是递归的，被称为递归下降子程序。 -The basic idea of recursiv
XMLparserforc
- 将树形数据结构用于最小化DOM 模型XML 编解码器的开发。在解析XML 文本时，基于Expat 解释器将XML 字符串构造成树 状结构；编码时构造DOM 树结构，采用非递归深度优先法遍历树，将其串行化成XML 串。本编解码器解决了国际化语言关键问题，是 一个通用、高效的工业级XML 应用支撑模块。-This paper designs a DOM liked tree data structure for developing a minimal DOM based eXtended
Recursion(complete)
- Recursion Program for Counting Looping
Remove-left-recursion
- Compiler tech: Program To Remove Left Recursion From The Given Grammar
Left-Recursion.cpp
- Left recursion removal in CFG
Clip-file-recursion-replace-software
- 全局文本替换软件（可适用于android studio），软件递归指定文件夹中所有文件，并读取指定后缀名的文件内容，替换指定文本-Global text replacement software (can be applied to the android studio), software recursion to specify all files in the folder, and reads the suffix of the specified file content, repla