搜索资源列表
Element
- 标记语言的简单解释器算法实现，实现一些简单的二叉树-A simple markup language interpreter algorithm, to achieve some simple binary tree
turn5
- ASCII编码转换器，非常简单易用。可以自由转换各进制及中文-ASCII Encoding Converter is very easy to use. Are free to convert the binary and Chinese
bycx
- C++编写的编译程序，包括词法分析，语法分析（LL（1）），语义分析，输出分析过程、二元式、符号表和四元式。-Written in C++ compilers, including lexical analysis, syntax analysis (LL (1)), semantic analysis, the output of the process, binary type, symbol table and four-element scheme.
An-Upload
- 本组件是继作者原“艾恩ASP无组件上传类”修改整合而成, 具有和无组件上传类相同的功能,并且具有无组件类不能相比的优越性能。 能实现的功能主要包括:自由提取表单数据、自由限制上传扩展名、自由限制上传大小、自由选择文件保存类型(原文件名和时间随机命名)， 即可以单个文件上传又可以多个文件批量上传，同时可以提取文件的二进制数据,以方便保存到数据库-This component is the author of the original " non-iron ASP upload
Two-fork-tree-operation
- 熟练掌握二叉树的各种遍历算法，并能灵活运用遍历算法实现二叉树的其它操作；-Proficiency in a variety of binary tree traversal algorithm, and other operations of the binary tree traversal algorithms to achieve flexibility in the use of
findpath
- find path c++ binary tree find and output
binary-tree-in-templates
- so i want to make a code, that creates a binary tree, that holds data, for example ints like 1,6,2,10,8 and on pop i get the biggest number, and after that it gets deleted from the tree, and on push i can insert a new element. And this should be in a
Tree
- 有关数据结构中树的一些C代码，如何建立二叉树，如何进行霍夫曼编码。-Some C code about data structure tree, how to create a binary tree, how to Huffman coding.
FROM-SOURCE-TO-BINARY
- 关于编译器的故事，讲述了ASCII字符的代码怎么样变成程序在机器上运行的原理-Story about the compiler about the ASCII character code for how to become the principle of the program running on the machine
binary_trees
- It is an assignment on binary trees using C++. It includes basic functions using binary trees likes sorting, reading from and writing on file and so on.
bintree
- 关于二叉树的插入，先序遍历，后序遍历，中序遍历，叶子节点个数，树的深度，路径查找。-Binary tree insertion, preorder, postorder traversal, preorder, the number of leaf nodes, the depth of the tree, the path to find.
decompile_bin-v1.6.1.py
- Tales of pirate II binary files decompiler.
lex
- 编译原理的pascal 语言的词法分析并产生二元式-Pascal language compiler theory lexical analysis and generate binary type
word
- 编译原理课程的词法分析程序。 该程序主要是完成上述Pascal语言子集单词符号的词法分析；不区分大小写，字母为a-z A-Z，数字为0-9；‘/*……*/’为程序的注释部分；词法分析程序应能发现输入串中的错误；词法分析结果为二元式序列组成的中间文件。-Compiler theory courses lexical analysis procedure. The program is the completion of a subset of the Pascal language lexic
CP_work_8
- 设计一个四则表达式分析软件，其接受从文件或键盘输入的四则表达式（运算对象支持整数和变量），给出该表达式的二叉树表达形式，并在键盘上按后续遍历方式输出该二叉树。 例如，输入a+b*c，输出 a b c * + 提示：参考下列的设计指导: 递归下降分析法实验设计思想及算法 为G的每个非终结符号U构造一个递归过程，不妨命名为U。U的产生式的右边指出这个过程的代码结构： (1)若是终结符号，则和向前看符号对照，若匹配则向前进一个符号；否则出错。 (2)若是非终结符号，
cautare_binare
- this program performs a binary search throough a sorted array
BinaryTree
- 基于二叉树实现一元多项式的加法、减法、乘法、除法，并实现算法的优化及对内存的最小使用，将结果存储在原多项式中-Based on a binary tree polynomial addition, subtraction, multiplication, division, and to achieve the optimization algorithm and minimal use of memory, and stores the result in the original polyn
Binary-Tree
- 数据库结构中实验内容Binary Tree实验源代码，代码比较短-Database structure experiments Binary Tree experiment source code, the code is relatively short
Binary-to-Decimal-Conversion
- Binary to Decimal Conversion
binary
- Binary search tree source code