CFG - 第一组，按照设定，预测集和LL（1）表中C ++

this an assign.c file-this is an assign.c file

i.mx27 nand flash driver

采用邻接矩阵表示无向图，完成图的创建、图的深度优先遍历、图的广度优先遍历操作。其中图的顶点信息是字符型，图中顶点序号按字符顺序排列。本输入样例中所用的图如下所示： Input Format: 第一行输入两个值，第一个是图中顶点的个数，第二个是图中边的条数 第二行输入各顶点的信息，即输入每个顶点字符 第三行开始输入每条边，每条边的形式为两个顶点的序号，中间以空格隔开，输入完一条边换行 Output format: 首先输出图的顶点信息，输出完毕换行 接着输出图的邻接矩阵，假如图中有n个顶点，则输出形式为n行n列的邻接矩阵，输出完毕换行 接下来一行输出从图的第一个顶点开始进行深度优先遍历的序列，中间以空格隔开，输出完毕换行 最后一行输出从图的第一个顶点开始进行广度优先遍历的序列，中间以空格隔开，输出完毕换行 -Using an undirected graph adjacency matrix representation to complete the map creation, graph depth-first traversal, graph breadth-first traversal operation. In which vertex information is character, the graph vertex number by characters in order. The input sample used in the diagram are as follows: Input Format: The first line of input two values, the first one is the number of graph vertices, the second one is the number of graph edges Second row, enter information in each vertex, that enter each vertex character Start typing in the third line of each side, each side in the form of two vertices

词法分析，运用VC++6.0编写，可以进行对输入源代码进行编译-accidence analysis using VC++6.0 ,can compile input resource code.

I ve noticed for a while that on Windows XP, when you use Explorer to delete a file or directory that is in use by another process, it takes what seems like an eternity before an error message appears telling you the file can t be deleted. During this time, there is no indication that Explorer even noticed the delete command. No hourglass, no nothing. By the time the message box appears, I ve already hit the delete key a few more times in a futile attempt to get Explorer to just do something, already. Either delete the file or tell me you can t...throw me a bone here.

简单使用的hufmTree,里面可以压缩于解压文件-Simple to use hufmTree, which can be compressed in-extracting file

FP-树算法实现用C++语言来实现的，多多指教。-FP-tree algorithm using C++ language to achieve，Exhibitions.

IDL语言编写的人造地球卫星环绕地球的动画 模拟。可作为教学演示。-IDL language of artificial earth satellite around the earth animated simulation. Could serve as a teaching demonstration.

使用递归搜索树这个小程序，我觉得很好，分享一下我的观点，对下一个有用吧

迷宫的问题实质上就是图的遍历问题，我们可以用一个二维数组存储一个迷宫的各个结点，给定一个开始的坐标和一个结束的坐标．本程序可以寻找一条路径，但这条路径不是最短的．就是说不是最优的．-maze is the essence of the plan traverse the problem, we can use a two-dimensional array storage a maze of the various nodes, to set a beginning and an end coordinates of the coordinates. This procedure can find a path, but this is not the shortest path. Not to say the best.