资源列表
ccf
- 用C++实现使用链表动态分配二维数组 用C++实现使用链表动态分配二维数组-C realization use dynamic allocation chain C Two-dimensional arrays to achieve dynamic distribution chain using two-dimensional array
LR0
- 用C++实现LR(0)语法分析 用C++实现LR(0)语法分析-C achieve LR (0) C syntax analysis achieve LR (0) syntax analysis
LL1
- 用C++实现LL(1)文法分析 用C++实现LL(1)文法分析-C achieve LL (1) grammar analysis C achieve LL (1) grammar analysis
sfyx
- 用C++实现算符优先分析程序 用C++实现算符优先分析程序-C operator priority to achieve analysis program with C operator priority to achieve analysis program
pwdspy_src
- 查看编辑框密码的程序源代码.通过设置消息勾子实现.-View password edit box of source code. By setting the news hook to achieve.
NNP
- 最近点对问题，输入数据生成器自动生成2位点对，输出制定电的最近邻-nearest point of the problem, the input data generator automatically generate two points right, electrical output of the nearest neighbor
houzhixuandawang
- 一堆猴子都有编号，编号是1，2，3 ...m ,这群猴子（m个）按照1--m的顺序围坐一圈，从第1开始数，每数到第N个，该猴子就要离开此圈，这样依次下来，直到圈中只剩下最后一只猴子，则该猴子为大王。-monkeys have a pile of numbers, numbers 1, 2, 3 ... m, these monkeys (m) In accordance with the 1 -- m sitting in the order in a circle, starting from
erchashu
- 建立二叉树，统计二叉树中度为2的结点个数和叶子结点个数（ 用递归或非递归的方法都可以，先序、中序或后序均可）-establish binary tree, Statistics for the two binary tree to moderate the number of nodes and the number of nodes leaves (with the recursive and non - recursive method can be first order, After t
zhipaiyouxi
- 编号为1-52张牌，正面向上，从第2张开始，以2为基数，是2的倍数的牌翻一次，直到最后一张牌；然后，从第3张开始，以3为基数，是3的倍数的牌翻一次，直到最后一张牌；然后…从第4张开始，以4为基数，是4的倍数的牌翻一次， 直到最后一张牌；...再依次5的倍数的牌翻一次，6的，7的 直到 以52为基数的 翻过，输出：这时正面向上的牌有哪些？-No. 1-52 card in a positive, progressive, from the first two, with two as the ba
2007481176011851352
- 电子跑表设计 希望对大家有帮助 这是我今年的课程设计 -electronic stopwatch design we want to help me this year and this is the course design
buildroot-20070508.tar
- build cross compiler
WMCanMonitor
- 串口模拟程序,使用方便,能处理多条连续指令,指令通过INI文件事先配置好,利于保存,利于定制指令,配置好的指令可动态修改，串口的属性(波特率、检验位、停止位等)可动态设置。-serial simulation program, easy to use, can handle a number of consecutive instructions, directives through INI file pre-configured, conducive to the preservation,