搜索资源列表
Hoffmanndecoder
- 从键盘输入若干字符及每个字符出现的频率，将字符出现的频率作为结点的权值，建立哈夫曼树，然后对各个字符进行哈夫曼编码，最后打印输出字符及对应的哈夫曼编码。-From the keyboard characters and each character appear frequency, the frequency as characters of weights, build node tree, then hoffmann for each character coding hoffmann l
tiny_exe
- tiny简单语言语法分析能实现词法分析语法分析功能，生成语法树-tiny simple language parsing to achieve lexical analysis parser function to generate syntax tree
BinaryTree
- 按先序输入二叉树 先序遍历二叉数 中序遍历二叉数 后遍历二叉数-By first order input visiting Binary Tree traversal binary number binary numbers in sequence after the number of traversing binary
LL(1)
- 编译原理LL（1）分析过程模拟 设计一个给定LL（1）分析表，输入一个句子，能由依据LL（1）分析表输出与句子 对应的语法树。能对语法树生成过程进行模 拟-for LL（1）
byyl
- 编译原理课程设计报告。 算术表达式的LR翻译器 实现了LR树自底向上分析方法。 其中包括分析树和分析表的建立-Compile the report Principles of curriculum design. Arithmetic expressions to achieve the LR LR translator tree bottom-up analysis. Including analysis of the establishment of tree and analy
removeRBTee
- 在VC++6.0编译器环境下完成红黑树的删除，基于C++源码的编程 直接新建满足条件的红黑树，然后删除选定的结点-In VC++6.0 compiler environment to complete the removal of red-black tree, based on C++ source code directly to the new programming to meet the conditions of the red-black tree, and then delete
Compiler_theory_of_trees_and_ambiguity_Tutorial.ra
- 编译原理分析树和二义性教程Compiler theory of trees and ambiguity Tutorial-Compiler theory of trees and ambiguity Tutorial Compiler theory of trees and ambiguity Tutorial
AVLtrees
- AVL平衡树控件包，研究数据结构的好-AVL balanced tree control packet, the data structure of a good stuff
RMQ_jim
- O(n)实现RMQ的算法,一般RMQ问题 到 O(n)构造笛卡尔树 到 <O(n), O(1)>的求解±1 RMQ问题 -implement the data structure of RMQ in O(n) time
yufafengxi
- 类pascal语言的语法分析程序，输入源代码 输出语法树-Class pascal language parser, the input source code output syntax tree
Projects
- Huffman编码译码，带图形界面，画Huffman树，读取，保存文件。查找替换内容-Huffman coding and decoding, with a graphical interface, drawing Huffman tree, read, save the file. Search and Replace content
HE2
- 编写一个赫夫曼编/译码系统。 主要功能： （1）构造赫夫曼树：根据输入的字符代码集及其权值集，构造赫夫曼树，输出字符的赫夫曼编码。 （2）编码：输入字符序列，输出对应的赫码序列。 （3）译码：输入赫夫曼码序列，输出原始字符代码。 -vc huffman
CMMsyntaxanalysis
- CMM语言语法分析程序，输入CMM程序，输出语法树。-CMM language parser, type CMM process, output syntax tree.
test1
- 适合初学者的计算机实验，计算机软件编程，基本的c编程，关于树的概念-Experimental computer for beginners, computer software programming, the basic c programming, on the concept of tree
zhizhen
- 利用父指针数组的普通树前根遍历算法,汇编的哦-Using an array of parent pointers before the root of the common tree traversal algorithm
zi
- 8.2.2利用子指针数组的普通树前根遍历算法，汇编的哦-8.2.2 General use of sub-array pointer before the root of the tree traversal algorithm, compiled oh
HaFumancompiler
- 哈弗曼编译器。主要功能有编码 译码 印哈弗曼树 印代码文件-Ha Fuman compiler. Coding and decoding the main function code files printed Hafu Man Tree India
Huffmer
- 通过统计文件中各字符的出现频率，建立Huffman树，再通过建立的已经Huffman的树，对文件中各字符进行编码，将结果存入新的文件中，然后从文件中读取Huffman编码，进行解码，结果存入新的文件中，并与源文件进行比较。 -Through statistical document the frequency of each character, the establishment of Huffman trees, and through the already established
hafuman
- 哈夫曼编码为实现哈夫曼编码，先构造哈夫曼树。哈夫曼树的每个节点都存有该节点的信源符号，概率，双亲节点，左孩子节点和右孩子节点。每个节点的概率为该节点左孩子节点和右孩子节点的概率之和。每次选取概率最小的两个节点作为左右孩子节点，直到把所有的数据都整合到哈夫曼树中。每个原始数据都处于叶子节点的位置。-Huffman coding Huffman coding to achieve the first Huffman tree structure. Huffman tree for each node
dw_cd_VirtualTreeview_v4.5.2
- dw_cd_VirtualTreeview_v4.5.2.rar 虚拟树-dw_cd_VirtualTreeview_v4.5.2.rar virtual tree