搜索资源列表
Syntax_CMM
- 语法分析，CMM语言，生成语法树。但是语法树的缩进不完美。-Syntax analysis, CMM language, generative grammar tree. Syntax tree indentation but not perfect.
minic
- 输入简单的c语言程序，再通过编译器进行编译，可以得到编译的结果。与c语言的功能相近只是范围较小。还可以生成语法分析树，来看中间是怎么进行编译的。-Enter a simple c language program, and then compiled by the compiler, the results can be compiled. And c function of language is similar to a smaller range. Parse tree can also
tiny
- 这是一个语法分析实验，输入tiny语言就可以输出语法树-This is a parsing experiment, enter the tiny language can output syntax tree
Element
- 标记语言的简单解释器算法实现，实现一些简单的二叉树-A simple markup language interpreter algorithm, to achieve some simple binary tree
yufafenxi
- 利用递归下降分析程序实现对语法的分析，并输出语法树-Recursive descent parser used to achieve the analysis of grammar and syntax tree output
fdtd3D_UPML
- a tree dimensional PML code fdtd3D_UPML
Huffman
- 用c语言实现哈夫曼树的编码与解码 编译器为c-fr-Encoding and decoding of the Huffman tree using c language Compiler for c-free
TinyC
- 编译原理课设，TinyC，简化的C语言编译器，不能支持比较高级的C程序，可以生成汇编和语法树-Principle-based compiler class, TinyC, to simplify the C language compiler, can not support the more advanced C procedures, can generate the compilation and syntax tree
tree-three-order
- 本代码用队列的方式根据树的前序和中序生成树-create tree
text2
- 实现了用树建立数值表达式，并求其值，随便输出它的广义表、前缀表达式和后缀表达式-To realize the tree is to develop a numerical expression, and for its value, literally output its generalized list, prefix and postfix expression expression
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
grammer
- 用c语言实现的编译原理课本中的语法分析部分，可以完全正确的分析课本后的c-minus代码，并且可以建立分析树-Syntax analysis part c language compiler theory textbooks, c-minus after the code can be completely correct analysis textbooks, and can create a parse tree
lab2
- 实验二：TINY扩充语言的语法分析 扩充的语法规则有：实现 while、do while、for语句和求余计算式子，具体文法规则自行构造。 可参考：P97及P136的文法规则。 (1) While-stmt --> while exp do stmt-sequence endwhile (2) Dowhile-stmt-->do stmt-sequence while exp (3) for-stmt-->for identifier:=
findpath
- find path c++ binary tree find and output
Huffman-coding-and-decoding
- 在从键盘上输入字符时，只要是键盘上的字符任何字符都能接受，并能统计出输入的一串字符串中各个字符出现的次数，作为构建哈夫曼树时的各叶子结点的权值。 本程序同时具有译码功能 -Character input from the keyboard, as long as any of the characters in the character on the keyboard can be accepted, and the statistics of the number of occurr
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
Connect_Fo214822412009
- During his long sea voyages, Captain Cook was often absent in the evenings and eventually the crew began to joke that he must have a mistress in his cabin. When they discovered that the Captain had simply been playing this game with the ship s scien
Tree
- 有关数据结构中树的一些C代码，如何建立二叉树，如何进行霍夫曼编码。-Some C code about data structure tree, how to create a binary tree, how to Huffman coding.
Minimum-Spanning-Tree
- Minimum Spanning Tree BY ICA
Binary-Tree
- 数据库结构中实验内容Binary Tree实验源代码，代码比较短-Database structure experiments Binary Tree experiment source code, the code is relatively short