搜索资源列表
Binaryoperation
- 1．创建以二叉链表作存储结构的二叉树； 2．按前序遍历二叉树； 3．按中序遍历二叉树； 4．按后序遍历二叉树； 5．计算二叉树的单枝结点数； 6．按层次遍历二叉树。 -1. Create a list binary tree structure for storage 2. According to pre-order tree traversal 3. According to the binary tree traversal 4. After the tree
hafumansuccess
- 该程序是基于哈弗曼树的构造，可以实现正常的编码-The program is based on the哈弗曼tree structure, can achieve normal coding
binarytree
- 二叉树的操作，程序采用递归可进行树的遍历，求叶子节点的个数，交换左右子树等操作-Binary operation, the procedure can be carried out using recursive tree traversal, and the number of leaf nodes, exchange and other operations around subtree
antlr
- ANTLR 接受3类语法规范——语法分析程序，词法分析程序lexers，和树语法分析程序(也 叫树行者)。 由ANTLR使用LL(k) 分析用于全部3 语法变型，由于语法说明相似，因而产生 的lexers 和语法分析程序表现得也类似。 产生的识别程序易读，你可以查看输出的内容来 消除很多关于ANTLR机理的问题。-ANTLR grammar to accept 3 types of norms- syntax analysis procedures, lexical analysis
asdasdasd
- 基于树型结构的在线逆向组合拍卖模型的pdf -Tree structure based on online reverse auction model portfolio pdf! ! !
wordsegment1
- 中文分词算法,效率很高,使用词典树装搜索进行单词切割,并提供扩充词库的函数!-It s an arithmetc of word segment,it has a very high efficiency!
0408010124
- 编写关于编译原理知识的基本语法树和词法分析器，有完整的报告格式-Compiler knowledge about the preparation of the basic principles of grammar and lexical analyzer tree, has a complete report format
testtree
- 二叉树的实现 构成二叉树的基本元素是二叉树中的结点，因此，要想构造二叉树类，必须先构造二叉树的结点类。-BinTreeNode
shujuku
- 编译器，对用户输入的sql语句进行解析，生成语法树-Compiler, on the user input to resolve the sql statement to generate a syntax tree. .
ERCHASHU
- 关于二叉树的一些基本操作，包括查找，添加，删除结点-About some of the basic binary tree operations, including search, add, delete node and so on
109201252fractal
- 包括Koch曲线、Levy 曲线、分形树、Sierpinski三角形，并附有详细的注解-leaf_by_recursion，Sierpinski三角，spirall，recurs_polygon3，recurs_star7等等
145
- 使用51汇编程序编写的树和图的程序，程序简单明了，比较适用-Procedures used to prepare a compilation of 51 trees and plans, procedures easy to understand, compare the application of
c1
- 平衡二叉排序树的设计与实现C语言源程序代码-Balanced binary tree to sort the design and implementation of C language source code
MSTParser.tar
- MSTParser是以最大生成树理论为基础的判别式依存句法分析器。它将一科依存树的得分看作是 所有依存关系的得分的总和，从而依存分析的问题转化成如何寻找最高得分的依存树。-Spanning tree is the largest MSTParser theory-based discriminant Parser interdependence. Section 1 will be scored as interdependent tree are all interdependent re
shu
- 汇编语言实现二叉树的先序中序后续遍历 不大，挺简单-Assembly language to achieve the first order binary tree in order traversal little follow-up, very simple
3
- 用汇编语言实现二叉树输入和遍历~ 河北理工大学 吴亚峰-Assembly language input and the realization of binary tree traversal
DelphiDragDrop
- 列表框和树控件之间拖拉的例子，delphi环境编译-List box and drag and drop between tree control example, delphi compiler environment
11279_lr0forwin
- 分析文法是否是LR(0)文法，显示分析表。对输入的语句给出语法分析树-Analysis of whether the grammar is LR (0) grammar, analysis table shows. The statement given to the input syntax parse tree
HuffmanTree
- 自动生成Huffman树，为C++，通过编译，可正常使用-Huffman tree generated automatically for the C++, through the compiler can use