An Automata-Based Approach to Pattern Matching

• 作者: Ali Sever
• 来源期刊: 智能控制与自动化(英文)
• 学科: 工学
• 关键词: COMPUTATION and AUTOMATA Theory PATTERN MATCHING REGULAR LANGUAGES
• 年，卷（期）: 2013,（3）
• 页码范围: 309-312
• 页数: 4页
• 分类号: TP39

摘要

Due to its importance in security, syntax analysis has found usage in many high-level programming languages. The Lisp language has its share of operations for evaluating regular expressions, but native parsing of Lisp code in this way is unsupported. Matching on lists requires a significantly more complicated model, with a different programmatic approach than that of string matching. This work presents a new automata-based approach centered on a set of functions and macros for identifying sequences of Lisp S-expressions using finite tree automata. The objective is to test that a given list is an element of a given tree language. We use a macro that takes a grammar and generates a function that reads off the leaves of a tree and tries to parse them as a string in a context-free language. The experimental results indicate that this approach is a viable tool for parsing Lisp lists and expressions in the abstract interpretation framework