数据结构中串的模式匹配算法演示系统的研究  

Research of a Demonstration System for Pattern Matching Algorithms of Strings in Data Structure

作　　者：刘城霞[1] 宋泽昊 

机构地区：[1]北京信息科技大学计算机学院,北京

出　　处：《软件工程与应用》2023年第3期578-585,共8页Software Engineering and Applications

摘　　要：本文研究了数据结构中的朴素模式匹配算法(BF)和快速模式匹配算法(KMP),并将其算法程序、中间变量、结果展示结合到一起,使用JavaSwing等进行相关图形界面开发,使得在同一界面上,不仅能展示BF算法和KMP算法的代码,并且能够显示字符串模式匹配算法执行过程中每一步的操作流程,还可以随时进行暂停、回退、继续等。该演示系统不仅可以帮助学生快速学习理解字符串模式匹配的原理,还可以有效地提高学生的实践能力,所见即所得地快速上手编程。This article has studied the naive pattern matching algorithm (BF) and the fast pattern matching algorithm (KMP) in data structures, and combined their algorithm programs, intermediate variables, and result display. Using JavaSwing and other related graphical interface development, it is possible to not only display the code of the BF algorithm and KMP algorithm on the same interface, but also display the operation flow of each step in the execution process of the string pattern matching algorithm. It also can be pause, rollback, resume, and so on at any time. The demonstration system can not only help students quickly learn and understand the principles of string pattern matching, but also effectively improve students’ practical abilities, namely, WYSIWYG, and fast hands-on programming.

关 键 词：朴素模式匹配算法 快速模式匹配算法 JavaSwing 

分 类 号：TP3[自动化与计算机技术—计算机科学与技术]