Intelligent Control and Automation

Volume 4, Issue 3 (August 2013)

ISSN Print: 2153-0653   ISSN Online: 2153-0661

Google-based Impact Factor: 1.27  Citations  h5-index & Ranking

An Automata-Based Approach to Pattern Matching

HTML  XML Download Download as PDF (Size: 140KB)  PP. 309-312  
DOI: 10.4236/ica.2013.43036    6,586 Downloads   7,753 Views  


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

Cite this paper

A. Sever, "An Automata-Based Approach to Pattern Matching," Intelligent Control and Automation, Vol. 4 No. 3, 2013, pp. 309-312. doi: 10.4236/ica.2013.43036.

Cited by

No relevant information.

Copyright © 2020 by authors and Scientific Research Publishing Inc.

Creative Commons License

This work and the related PDF file are licensed under a Creative Commons Attribution 4.0 International License.