基于windowas ce4.2的一个ir通信的程序, 使用EVC++编写,提供一个基于sh3处理器的例子...

一款mvc的小游戏  jsp J2EE 猜谜语小游戏 带音乐，特别适合学生和找工作的小y下载学习看看

这是一个关于短信开发的案例　，请大家多多指教-This is a message developed on the case, please everyone exhibitions

erlang B 理论计算 erlang B 理论计算-erlang B theoretical calculation erlang B theoretical calculation

可以快捷方便的删除掉版本控制程序下面的每一个scv,解除版本控制-rt

窗体的tab页设置和Lookbar的使用方法，还加了窗体的颜色设置。-Form of the tab page to set up and use Lookbar also added a form of color settings.

编译原理小程序 有点小问题 源程序文件内容如下： main() { int a, b a = 10 b = a + 20 } 要求输出如下： (2，”main”) (5，”（”） (5，”)”) (5，”{“} (1，”int”) (2，”a”) (5，”,”) (2，”b”) (5，” ”) (2，”a”) (4，”=”) (3，10) (5，” ”) (2，”b”) (4，”=”) (2，”a”) (4，”+”) (3，20) (5，” ”) (5，”)”)-Compiler Principle small programs have a small problem source files as follows : main () (int a, b a = b = a 10 20) output requirements are as follows : (2, "main") (5 ,"(") (5, " ) ") (5 ,"{"} (1," int ") (2," a ") (5 ,",") (2," b ") (5," ") (2," a " ) (4 ,"=") (3,10) (5, "") (2, "b") (4 ,"=") (2, "a") (4, "") (3,20 ) (5, "") (5 ,")")

该程序完成在两个字符串中寻找最长公共子串，如果这样的字符串有多个，则将它们全部找出来，它在最坏情况下的复杂度为O(m*n).-the procedure is completed in two for the longest string of public substrings, if such a number of strings, will they all find out in the worst of the complexity of O (n* m).

编译原理，预测分析器,可求出first集，follow集，并构造出LL（1）分析器

操作系统课程设计，用VC开发可直接下载使用，包含消息机制，共享内存和管道通信-Operating system, curriculum design, developed with the VC can directly download that contains message mechanism, shared memory, and communication channels

首先指定要查找的目录,然后填入要查找的文件名,注意到带扩展名 也可以查找文件夹.-first to find the specified directory, and then you have to fill in the name, notes with extension can also find folders.