用.net编写的编译原理中所用到的词法分析器。是编译器的最基本功能！...

s3c2440a触摸屏驱动，完整驱动可直接调用也可用于参照学习-s3c2440a touch screen-driven, integrity-driven direct call can also be used to refer to learning

MDI动态连接库-MDI Dynamic Link Library

本代码是用遗传算法求解一个迷宫的寻路问题，算法精炼，寻路效率非常高。用Windows GDI设计了迷宫，然后用遗传算法进行图形化寻路。

Com.rus. Описание технологии COM на русском языке.

FFH中最佳门限的比较，有传统和最佳比较两种-FFH best threshold comparison, there are traditional and the best comparison between the two

Algoritmos pra reconhecimento facial

带font字样的3个目录分别是利用系统字库产生/观察/修改点阵字库文件的程序 GBK是产生编码页网页的程序, 用于观察各种编码 midi2wav是把midi文件转换成wav文件的程序.-Font with the words 3 directory is to use the system font, respectively, arising from/to observe/modify the procedures lattice GBK font file is the web page coding procedures used to observe a variety of coding midi2wav is to convert midi files wav files procedures.

[趣味其他] 一个非常有趣的小程序 2002-04-22 21 33375 一个非常有趣的小程序，会有令你意想不到的结果哟！-A very funny small program which has a unexpectable result

上课时做的一个c++的语言编辑器，适合初学者，但是是用VC2005编写的。能够实现文字的高亮显示，注释识别，识别关键字，自动格式等功能。在多行注释上，以及字符识别上仍有点问题，大家参考一下吧。-Class to do a c++ the language editor, suitable for beginners, but is prepared to use VC2005. To achieve the highlighted text, comments, identification, identification of keywords, automatic formatting and other functions. Notes on more than one line, as well as the character recognition is still a problem, we refer to it.

array.h： 安全数组 linkedlist.h： 普通表 dclinkedlist： 双向循环链表 hashtable.h： 哈希表 binstree.h： 二叉搜索树 avltree.h： AVL 树 如果要存储集合（元素不可重复）并快速查找，最佳的是 binstree.h（二叉搜索树）。 如果要存储二维或更高维的表格，最佳的是 hashtable.h（哈系表）。AVL 树的插入成本非常高（删除函数也没有实现），但 AVL 的搜索效率极高，所以适用于在程序开始前初始化程-NOTE: array.h :secure array,linkedlist.h:common table, dclinkedlist:dual cycle linkedlist, hashtable.h:hash table binstree.h:binary search tree, avltree.h: AVL tree, if you want to store set(elements no repeating) and to lookup it swiftly,best is binstree.h(binary search tree).if you want to store two dimensions s or more dimensions s table,best hashtable.h(hash table).the cost of AVL tree s insertion is very high(delete function is not completed),but effiency of AVL tree s search is very high,so it is the same with initialize programme before beginning programme.