串口通讯编程包括网络流量监控的等程序VC++编程语言与大家共享...

楼宇自控系统 希望对各位有用-Building Automation System hope useful to you!

RS编码 CodeWarrior环境例程！-RS CW environmental routines!

MSComm在MFC的单文档中的应用-MSComm in MFC single document of

一个多线程串口通讯的事例,适合于在串口通信方面有基础的人进一步研究

在LPC2106上实现并测试过的代码,用串口收到的数据回显到串口(通过环行缓存实现)并将串口发送的接口写成了printf的形式 -To achieve the LPC2106 and tested code, serial data received echo to the serial port (via the ring buffer to achieve) and serial interface to send written in the form of a printf

该程序演示了如何在windows平台下使用WindowsAPI函数来操作串口，可以用以实现两台PC机之间的实时聊天。（必须连接串口电缆）-the program demonstrated how the Windows platform using Windows API function to operate serial ports, can be used to achieve between two PC real-time chat. (Must connect serial cable)

这是非常有挑战性的题目。对于用户输入的任意一个平面函数f(x)，绘制出其函数曲线。这里最关键的技术难点就是如何实现计算表达式的值。在《编译原理》和《数据结构》的书中，都有对表达式运算方法的论述。说实在的，在编译型计算机语言中实现对用户输入表达式的运算是非常困难的。需要对表达式进行扫描，去括号，按照运算符的优先级生成2叉树，然后遍历该树生成逆波兰表达式，再然后通过栈的方法进行运算。如果在表达式中再包含有函数的话......描述起来都麻烦，更不要说用程序实现了:-(-This is a very challenging issue. For user input an arbitrary planar function f (x), mapping out its function curves. Here the most critical technical problems is how to achieve calculated the value of the expression. "Compiling Principle" and "data structure," the book, have right of expression Operational discussed. Indeed, the computer language compiler to achieve expression of the user input operation is very difficult. Need to scan expression to the brackets, in accordance with the priority Operators Generation 2-ary tree, and then traverse the tree generated reverse Polish expression, and then through the stack approach to computing. If the expression again contains the function described ...... these are trouble, not to mention t

串口的一个学习程序，希望对大家有个比较大的帮助，或者起到一个参考作用-Serial port of a learning process, in the hope we have a relatively big help, or a reference to the role played

一个队串口进行操作的程序，可以作为学习串口编程的资料-A team to carry out the operation of serial procedures, can serve as a learning serial programming data

串口编程调试精灵 希望对各位有用-hope that the Wizard useful to you!