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

Celý popis

Uloženo v:
Podrobná bibliografie
Vydáno v:Discrete Applied Mathematics Ročník 163; s. 343 - 351
Hlavní autoři: Lahoda, Jan, Žd’árek, Jan
Médium: Journal Article
Jazyk:angličtina
Vydáno: Elsevier B.V 30.01.2014
Témata:
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
On-line přístup:Získat plný text
Tagy: Přidat tag
Žádné tagy, Buďte první, kdo vytvoří štítek k tomuto záznamu!
Popis
Shrnutí: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.
Bibliografie: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