Simple tree pattern matching for trees in the prefix bar notation

Authors:
Jan Lahoda;Jan D'árek
Affiliations:
-;-
Venue:
Discrete Applied Mathematics
Year:
2014

Citing 8
Cited 0

An improvement to bottom-up tree pattern matching

POPL '87 Proceedings of the 14th ACM SIGACT-SIGPLAN symposium on Principles of programming languages
A new approach to text searching

Communications of the ACM
Pattern Matching in Trees

Journal of the ACM (JACM)
Approximate String Matching by Finite Automata

CAIP '95 Proceedings of the 6th International Conference on Computer Analysis of Images and Patterns
Tree templates and subtree transformational grammars.

Tree templates and subtree transformational grammars.
Visibly pushdown languages

STOC '04 Proceedings of the thirty-sixth annual ACM symposium on Theory of computing
On regular tree languages and deterministic pushdown automata

Acta Informatica
Arbology: trees and pushdown automata

LATA'10 Proceedings of the 4th international conference on Language and Automata Theory and Applications

Quantified Score

Hi-index	0.04

Visualization

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.