基于调度场算法实现长逻辑表达式解析与创建  

Based on the Shunting Yard Algorithm to Purse Long Logic Expression String

作　　者：张文晓 Zhang Wenxiao(Ingersoll Rand Engineering Technology Center-Asia Gacific,Suzhou Jiangsu 215400,China)

机构地区：[1]英格索兰亚太工程技术中心,江苏苏州215400

出　　处：《信息与电脑》2020年第6期38-43,共6页Information & Computer

摘　　要：笔者主要介绍了如何基于调度场算法将长逻辑表达式解析成表达树,并在在VB.net的TreeView控件上显示,从而实现逻辑关系的可视化。并且,反向地,可以通过编辑逻辑表达树,再由程序反向生成逻辑表达式,作为输入参数供其他软件读取。这样就可以将复杂难懂的计算机语言转化为普通用户易懂的图形化表达,从而能提高效率、减少错误。This paper mainly introduces how to parse long logic expression into expression tree based on scheduling field algorithm and display it on treeview control of vb.net,so as to realize the visualization of logic relationship.In the opposite direction,the logic expression tree can be edited,and then the logic expression can be generated by the program in the opposite direction as the input parameter for other software to read.In this way,the complicated computer language can be transformed into a graphic expression that is easy to understand by ordinary users,so as to improve efficiency and reduce errors.

关 键 词：调度场算法 逻辑表达式解析 前缀表达式 后缀表达式 表达树 

分 类 号：TP311.52[自动化与计算机技术—计算机软件与理论]