一种新的基于人工蚂蚁的解析器设计算法
A Novel Parser Design Algorithm Based on Artificial Ants
摘要：
本文提出了一种独特的设计，分析器使用蚁群优化算法。本文通过人工蚂蚁的活动来实现人类思维的直觉思维过程。这里提出的方案使用自底向上的方法和分析程序可以直接使用二义性或冗余的语法。我们分配与给定语法中存在的每个产生式规则对应的节点。每个节点都连接到所有其他节点（代表其他产生式规则），从而建立一个完全连接的图，对人工蚂蚁的移动敏感。每只蚂蚁都试图通过节点中存在的产生式规则来修改这个矩阵形式，并升级它的位置，直到矩阵形式减少到开始符号S。成功的蚂蚁会在它们走过的链接上储存信息素。最后，最佳路径被发现的链接携带最大量的信息素浓度。该设计具有简单、通用、鲁棒、高效的特点，避免了上述集合和优先关系表的计算。我们的方案的进一步优点在于i）确定给定的字符串是否属于由语法表示的语言，以及ii）在存在多个路由的情况下找出从给定的字符串到开始符号S的最短可能路径。
英文摘要：
This article presents a unique design for a parser using the Ant Colony Optimization algorithm. The paper implements the intuitive thought process of human mind through the activities of artificial ants. The scheme presented here uses a bottom-up approach and the parsing program can directly use ambiguous or redundant grammars. We allocate a node corresponding to each production rule present in the given grammar. Each node is connected to all other nodes (representing other production rules), thereby establishing a completely connected graph susceptible to the movement of artificial ants. Each ant tries to modify this sentential form by the production rule present in the node and upgrades its position until the sentential form reduces to the start symbol S. Successful ants deposit pheromone on the links that they have traversed through. Eventually, the optimum path is discovered by the links carrying maximum amount of pheromone concentration. The design is simple, versatile, robust and effective and obviates the calculation of the above mentioned sets and precedence relation tables. Further advantages of our scheme lie in i) ascertaining whether a given string belongs to the language represented by the grammar, and ii) finding out the shortest possible path from the given string to the start symbol S in case multiple routes exist.
机构、总结、中文摘要均由AI分析而来，可能存在错误，请以论文正文为准。
