| Article ID | Journal | Published Year | Pages | File Type |
|---|---|---|---|---|
| 419157 | Discrete Applied Mathematics | 2014 | 9 Pages |
Abstract
A pushdown automata based algorithm for searching all occurrences of a tree pattern in a rooted directed labelled ordered subject tree is presented. The algorithm allows tree pattern matching with don’t care symbols and with multiple patterns. The subject tree may be for example an abstract syntax tree of a compiler or validating source text editor. Further, a construction and practical evaluation of a simulation algorithm of pushdown automata based tree pattern matching is described.
Related Topics
Physical Sciences and Engineering
Computer Science
Computational Theory and Mathematics
Authors
Jan Lahoda, Jan Žd’árek,