Simple tree pattern matching for trees in the prefix bar notation

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.

[1]  Salil P. Vadhan,et al.  Computational Complexity , 2005, Encyclopedia of Cryptography and Security.

[2]  Rajeev Alur,et al.  Visibly pushdown languages , 2004, STOC '04.

[3]  Gaston H. Gonnet,et al.  A new approach to text searching , 1992, CACM.

[4]  Borivoj Melichar,et al.  On regular tree languages and deterministic pushdown automata , 2009, Acta Informatica.

[5]  Borivoj Melichar.  Approximate String Matching by Finite Automata , 1995, CAIP.

[6]  Christoph M. Hoffmann,et al.  Pattern Matching in Trees , 1982, JACM.

[7]  Borivoj Melichar,et al.  Arbology: Trees and pushdown automata , 2010, Kybernetika.

[8]  Hubert Comon,et al.  Tree automata techniques and applications , 1997 .

[9]  Aaas News,et al.  Book Reviews , 1893, Buffalo Medical and Surgical Journal.

[10]  Borivoj Melichar,et al.  Subtree matching by pushdown automata , 2010, Comput. Sci. Inf. Syst..

[11]  Hans H. Kron,et al.  Tree templates and subtree transformational grammars. , 1975 .

[12]  M. Fischer,et al.  STRING-MATCHING AND OTHER PRODUCTS , 1974 .

[13]  Wojciech Rytter,et al.  Jewels of stringology , 2002 .

[14]  Jan Janousek,et al.  String Suffix Automata and Subtree Pushdown Automata , 2009, Stringology.

[15]  David R. Chase,et al.  An improvement to bottom-up tree pattern matching , 1987, POPL '87.