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 t...

Full description

Saved in:
Bibliographic Details
Published in:Discrete Applied Mathematics Vol. 163; pp. 343 - 351
Main Authors: Lahoda, Jan, Žd’árek, Jan
Format: Journal Article
Language:English
Published: Elsevier B.V 30.01.2014
Subjects:
Algorithms
Computer simulation
Editors
Matching
Mathematical analysis
Prefix bar notation
Pushdown automaton
Symbols
Texts
Tree don’t care symbol
Tree pattern matching
Trees
Prefix bar notation
Pushdown automaton
Tree pattern matching
Tree don’t care symbol
ISSN:0166-218X, 1872-6771
Online Access:Get full text
Tags: Add Tag
No Tags, Be the first to tag this record!
Description
Summary: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.
Bibliography:ObjectType-Article-2
SourceType-Scholarly Journals-1
ObjectType-Feature-1
content type line 23
ISSN:0166-218X
1872-6771
DOI:10.1016/j.dam.2013.07.018