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!
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.
AbstractList 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.
Author Žd’árek, Jan
Lahoda, Jan
Author_xml – sequence: 1
  givenname: Jan
  surname: Lahoda
  fullname: Lahoda, Jan
  email: Jan.Lahoda@oracle.com
  organization: Oracle Czech, V Parku 2308/8, 148 00 Praha 4, Czech Republic
– sequence: 2
  givenname: Jan
  surname: Žd’árek
  fullname: Žd’árek, Jan
  email: Jan.Zdarek@fit.cvut.cz
  organization: Department of Theoretical Computer Science, Faculty of Information Technology, Czech Technical University in Prague, Thákurova 9, 160 00 Prague 6, Czech Republic
BookMark eNp9kD1PwzAQhi1UJNrCD2DzyJJgJ6mTiKmq-JIqMQASm3WxL9RV4hTbRfDvcQkTQ6fT6d7ndPfMyMQOFgm55CzljIvrbaqhTzPG85SVKePVCZnyqswSUZZ8QqYxI5KMV29nZOb9ljHGYzcly2fT7zqkwSHSHYSAztIegtoY-07bwf1OPDWWhk1MOGzNF23AUTsECGaw5-S0hc7jxV-dk9e725fVQ7J-un9cLdeJynMWElFApTjUmjVQZVwoAbXIhOJ1nTUV04umWgDWWS5EC2Wra625KgpUbYEIeZvPydW4d-eGjz36IHvjFXYdWBz2XvJFHk0UcUGM8jGq3OB9PFnunOnBfUvO5EGX3MqoSx50SVbKqCsy5T9GmfHB4MB0R8mbkcT4_adBJ70yaBVq41AFqQdzhP4BYCyHEA
CitedBy_id crossref_primary_10_1016_j_knosys_2017_01_011
Cites_doi 10.1145/322290.322295
10.1007/3-540-48057-9_8
10.1145/135239.135243
10.2298/CSIS1002331F
10.1007/s00236-009-0104-9
ContentType Journal Article
Copyright 2013 Elsevier B.V.
Copyright_xml – notice: 2013 Elsevier B.V.
DBID 6I.
AAFTH
AAYXX
CITATION
7SC
8FD
JQ2
L7M
L~C
L~D
DOI 10.1016/j.dam.2013.07.018
DatabaseName ScienceDirect Open Access Titles
Elsevier:ScienceDirect:Open Access
CrossRef
Computer and Information Systems Abstracts
Technology Research Database
ProQuest Computer Science Collection
Advanced Technologies Database with Aerospace
Computer and Information Systems Abstracts – Academic
Computer and Information Systems Abstracts Professional
DatabaseTitle CrossRef
Computer and Information Systems Abstracts
Technology Research Database
Computer and Information Systems Abstracts – Academic
Advanced Technologies Database with Aerospace
ProQuest Computer Science Collection
Computer and Information Systems Abstracts Professional
DatabaseTitleList
Computer and Information Systems Abstracts
DeliveryMethod fulltext_linktorsrc
Discipline Mathematics
EISSN 1872-6771
EndPage 351
ExternalDocumentID 10_1016_j_dam_2013_07_018
S0166218X13003296
GroupedDBID -~X
6I.
AAFTH
ADEZE
AFTJW
ALMA_UNASSIGNED_HOLDINGS
FDB
OAUVE
AAYXX
AI.
CITATION
FA8
VH1
WUQ
7SC
8FD
JQ2
L7M
L~C
L~D
ID FETCH-LOGICAL-c330t-64a8c1a9d0ba8216c6a9626c1992b80d5b85ae92366fa7fd9dd1c44ecf4eea3f3
ISICitedReferencesCount 1
ISICitedReferencesURI http://www.webofscience.com/api/gateway?GWVersion=2&SrcApp=Summon&SrcAuth=ProQuest&DestLinkType=CitingArticles&DestApp=WOS_CPL&KeyUT=000330084200013&url=https%3A%2F%2Fcvtisr.summon.serialssolutions.com%2F%23%21%2Fsearch%3Fho%3Df%26include.ft.matches%3Dt%26l%3Dnull%26q%3D
ISSN 0166-218X
IngestDate Fri Jul 11 00:09:32 EDT 2025
Sat Nov 29 02:59:33 EST 2025
Tue Nov 18 21:47:05 EST 2025
Sat Apr 29 22:45:10 EDT 2023
IsDoiOpenAccess true
IsOpenAccess true
IsPeerReviewed true
IsScholarly true
Keywords Prefix bar notation
Pushdown automaton
Tree pattern matching
Tree don’t care symbol
Language English
License http://www.elsevier.com/open-access/userlicense/1.0
LinkModel OpenURL
MergedId FETCHMERGED-LOGICAL-c330t-64a8c1a9d0ba8216c6a9626c1992b80d5b85ae92366fa7fd9dd1c44ecf4eea3f3
Notes ObjectType-Article-2
SourceType-Scholarly Journals-1
ObjectType-Feature-1
content type line 23
OpenAccessLink https://dx.doi.org/10.1016/j.dam.2013.07.018
PQID 1531014236
PQPubID 23500
PageCount 9
ParticipantIDs proquest_miscellaneous_1531014236
crossref_primary_10_1016_j_dam_2013_07_018
crossref_citationtrail_10_1016_j_dam_2013_07_018
elsevier_sciencedirect_doi_10_1016_j_dam_2013_07_018
PublicationCentury 2000
PublicationDate 2014-01-30
PublicationDateYYYYMMDD 2014-01-30
PublicationDate_xml – month: 01
  year: 2014
  text: 2014-01-30
  day: 30
PublicationDecade 2010
PublicationTitle Discrete Applied Mathematics
PublicationYear 2014
Publisher Elsevier B.V
Publisher_xml – name: Elsevier B.V
References J. Stoklasa, J. Janoušek, B. Melichar, Subtree pushdown automata for trees in bar notation, in: London Stringology Days 2010, London, 2010.
Flouri, Janoušek, Melichar (br000045) 2009
Flouri, Janoušek, Melichar (br000050) 2010; 7
J. Holub, Simulation of nondeterministic finite automata in pattern matching, Ph.D. Thesis, Faculty of Electrical Engineering, Czech Technical University in Prague, Czech Republic, 2000. URL
Dömölki (br000035) 1964; 3
.
H.H. Kron, Tree templates and subtree transformational grammars, Ph.D. Thesis, University of California, Santa Cruz, 1975.
Chase (br000015) 1987
Alur, Madhusudan (br000005) 2004
Melichar (br000085) 1995; vol. 970
J. Janoušek, Arbology: algorithms on trees and pushdown automata, Habilitation Thesis, Brno University of Technology, 2010. p. 161.
Janoušek, Melichar (br000075) 2009; 46
Janoušek (br000065) 2009
Baeza-Yates, Gonnet (br000010) 1992; 35
Hoffmann, O’Donnell (br000055) 1982; 29
M.J. Fischer, M.S. Paterson, String matching and other products, in: R.M. Karp (Ed.), Complexity of Computation, SIAM-AMS Proceedings, Vol. 7, 1974, pp. 113–125.
L. Cleophas, Tree algorithms. two taxonomies and a toolkit, Ph.D. Thesis, Technische Universiteit Eindhoven, Eindhoven, 2008.
(release 12.10.2007).
J. Žďárek, Two-dimensional pattern matching using automata approach, Ph.D. Thesis, Faculty of Electrical Engineering, Czech Technical University in Prague, Czech Republic, 2010.
H. Comon, M. Dauchet, R. Gilleron, F. Jacquemard, D. Lugiez, C. Löding, S. Tison, M. Tommasi, Tree automata techniques and applications, 2007. Available on
Crochemore, Rytter (br000030) 2002
Melichar (br000090) 2010; vol. 6031
10.1016/j.dam.2013.07.018_br000060
Melichar (10.1016/j.dam.2013.07.018_br000085) 1995; vol. 970
10.1016/j.dam.2013.07.018_br000070
10.1016/j.dam.2013.07.018_br000040
10.1016/j.dam.2013.07.018_br000095
10.1016/j.dam.2013.07.018_br000020
Flouri (10.1016/j.dam.2013.07.018_br000050) 2010; 7
Crochemore (10.1016/j.dam.2013.07.018_br000030) 2002
Janoušek (10.1016/j.dam.2013.07.018_br000075) 2009; 46
Dömölki (10.1016/j.dam.2013.07.018_br000035) 1964; 3
Baeza-Yates (10.1016/j.dam.2013.07.018_br000010) 1992; 35
Janoušek (10.1016/j.dam.2013.07.018_br000065) 2009
10.1016/j.dam.2013.07.018_br000080
Hoffmann (10.1016/j.dam.2013.07.018_br000055) 1982; 29
Melichar (10.1016/j.dam.2013.07.018_br000090) 2010; vol. 6031
10.1016/j.dam.2013.07.018_br000100
Chase (10.1016/j.dam.2013.07.018_br000015) 1987
10.1016/j.dam.2013.07.018_br000025
Alur (10.1016/j.dam.2013.07.018_br000005) 2004
Flouri (10.1016/j.dam.2013.07.018_br000045) 2009
References_xml – start-page: 168
  year: 1987
  end-page: 177
  ident: br000015
  article-title: An improvement to bottom-up tree pattern matching
  publication-title: Proceedings of the 14th ACM SIGACT-SIGPLAN Symposium on Principles of Programming Languages
– start-page: 160
  year: 2009
  end-page: 172
  ident: br000065
  article-title: String suffix automata and subtree pushdown automata
  publication-title: Proceedings of the Prague Stringology Conference 2009
– volume: vol. 970
  start-page: 342
  year: 1995
  end-page: 349
  ident: br000085
  article-title: Approximate string matching by finite automata
  publication-title: Computer Analysis of Images and Patterns
– volume: 46
  start-page: 533
  year: 2009
  end-page: 547
  ident: br000075
  article-title: On regular tree languages and deterministic pushdown automata
  publication-title: Acta Inform.
– start-page: 202
  year: 2004
  end-page: 211
  ident: br000005
  article-title: Visibly pushdown languages
  publication-title: Proceedings of the Thirty-Sixth Annual ACM Symposium on Theory of Computing
– reference: (release 12.10.2007).
– volume: 3
  start-page: 29
  year: 1964
  end-page: 46
  ident: br000035
  article-title: An algorithm for syntactical analysis
  publication-title: Comput. Linguist.
– volume: 35
  year: 1992
  ident: br000010
  article-title: A new approach to text searching
  publication-title: Commun. ACM
– start-page: 310
  year: 2002
  ident: br000030
  article-title: Jewels of Stringology
– reference: H. Comon, M. Dauchet, R. Gilleron, F. Jacquemard, D. Lugiez, C. Löding, S. Tison, M. Tommasi, Tree automata techniques and applications, 2007. Available on:
– reference: J. Janoušek, Arbology: algorithms on trees and pushdown automata, Habilitation Thesis, Brno University of Technology, 2010. p. 161.
– reference: M.J. Fischer, M.S. Paterson, String matching and other products, in: R.M. Karp (Ed.), Complexity of Computation, SIAM-AMS Proceedings, Vol. 7, 1974, pp. 113–125.
– volume: 29
  start-page: 68
  year: 1982
  end-page: 95
  ident: br000055
  article-title: Pattern matching in trees
  publication-title: J. ACM
– reference: .
– start-page: 659
  year: 2009
  end-page: 666
  ident: br000045
  article-title: Tree pattern matching by deterministic pushdown automata
  publication-title: Proceedings of the International Multiconference on Computer Science and Information Technology, Workshop on Advances in Programming Languages, Vol. 4
– volume: vol. 6031
  start-page: 32
  year: 2010
  end-page: 49
  ident: br000090
  article-title: Arbology: trees and pushdown automata
  publication-title: Language and Automata Theory and Applications
– reference: J. Holub, Simulation of nondeterministic finite automata in pattern matching, Ph.D. Thesis, Faculty of Electrical Engineering, Czech Technical University in Prague, Czech Republic, 2000. URL:
– reference: J. Stoklasa, J. Janoušek, B. Melichar, Subtree pushdown automata for trees in bar notation, in: London Stringology Days 2010, London, 2010.
– volume: 7
  year: 2010
  ident: br000050
  article-title: Subtree matching by pushdown automata
  publication-title: Comput. Sci. Inf. Syst.
– reference: L. Cleophas, Tree algorithms. two taxonomies and a toolkit, Ph.D. Thesis, Technische Universiteit Eindhoven, Eindhoven, 2008.
– reference: H.H. Kron, Tree templates and subtree transformational grammars, Ph.D. Thesis, University of California, Santa Cruz, 1975.
– reference: J. Žďárek, Two-dimensional pattern matching using automata approach, Ph.D. Thesis, Faculty of Electrical Engineering, Czech Technical University in Prague, Czech Republic, 2010.
– start-page: 659
  year: 2009
  ident: 10.1016/j.dam.2013.07.018_br000045
  article-title: Tree pattern matching by deterministic pushdown automata
– volume: 29
  start-page: 68
  issue: 1
  year: 1982
  ident: 10.1016/j.dam.2013.07.018_br000055
  article-title: Pattern matching in trees
  publication-title: J. ACM
  doi: 10.1145/322290.322295
– ident: 10.1016/j.dam.2013.07.018_br000040
– ident: 10.1016/j.dam.2013.07.018_br000100
– ident: 10.1016/j.dam.2013.07.018_br000020
– ident: 10.1016/j.dam.2013.07.018_br000095
– ident: 10.1016/j.dam.2013.07.018_br000070
– start-page: 168
  year: 1987
  ident: 10.1016/j.dam.2013.07.018_br000015
  article-title: An improvement to bottom-up tree pattern matching
– start-page: 160
  year: 2009
  ident: 10.1016/j.dam.2013.07.018_br000065
  article-title: String suffix automata and subtree pushdown automata
– ident: 10.1016/j.dam.2013.07.018_br000060
  doi: 10.1007/3-540-48057-9_8
– volume: 35
  issue: 10
  year: 1992
  ident: 10.1016/j.dam.2013.07.018_br000010
  article-title: A new approach to text searching
  publication-title: Commun. ACM
  doi: 10.1145/135239.135243
– volume: 7
  issue: 2
  year: 2010
  ident: 10.1016/j.dam.2013.07.018_br000050
  article-title: Subtree matching by pushdown automata
  publication-title: Comput. Sci. Inf. Syst.
  doi: 10.2298/CSIS1002331F
– volume: vol. 970
  start-page: 342
  year: 1995
  ident: 10.1016/j.dam.2013.07.018_br000085
  article-title: Approximate string matching by finite automata
– volume: 3
  start-page: 29
  year: 1964
  ident: 10.1016/j.dam.2013.07.018_br000035
  article-title: An algorithm for syntactical analysis
  publication-title: Comput. Linguist.
– start-page: 202
  year: 2004
  ident: 10.1016/j.dam.2013.07.018_br000005
  article-title: Visibly pushdown languages
– volume: 46
  start-page: 533
  issue: 7
  year: 2009
  ident: 10.1016/j.dam.2013.07.018_br000075
  article-title: On regular tree languages and deterministic pushdown automata
  publication-title: Acta Inform.
  doi: 10.1007/s00236-009-0104-9
– ident: 10.1016/j.dam.2013.07.018_br000025
– ident: 10.1016/j.dam.2013.07.018_br000080
– volume: vol. 6031
  start-page: 32
  year: 2010
  ident: 10.1016/j.dam.2013.07.018_br000090
  article-title: Arbology: trees and pushdown automata
– start-page: 310
  year: 2002
  ident: 10.1016/j.dam.2013.07.018_br000030
SSID ssj0001218
ssj0000186
ssj0006644
Score 2.0302806
Snippet A pushdown automata based algorithm for searching all occurrences of a tree pattern in a rooted directed labelled ordered subject tree is presented. The...
SourceID proquest
crossref
elsevier
SourceType Aggregation Database
Enrichment Source
Index Database
Publisher
StartPage 343
SubjectTerms Algorithms
Computer simulation
Editors
Matching
Mathematical analysis
Prefix bar notation
Pushdown automaton
Symbols
Texts
Tree don’t care symbol
Tree pattern matching
Trees
Title Simple tree pattern matching for trees in the prefix bar notation
URI https://dx.doi.org/10.1016/j.dam.2013.07.018
https://www.proquest.com/docview/1531014236
Volume 163
WOSCitedRecordID wos000330084200013&url=https%3A%2F%2Fcvtisr.summon.serialssolutions.com%2F%23%21%2Fsearch%3Fho%3Df%26include.ft.matches%3Dt%26l%3Dnull%26q%3D
hasFullText 1
inHoldings 1
isFullTextHit
isPrint
journalDatabaseRights – providerCode: PRVESC
  databaseName: ScienceDirect
  customDbUrl:
  eissn: 1872-6771
  dateEnd: 20171231
  omitProxy: false
  ssIdentifier: ssj0001218
  issn: 0166-218X
  databaseCode: AIEXJ
  dateStart: 19950101
  isFulltext: true
  titleUrlDefault: https://www.sciencedirect.com
  providerName: Elsevier
link http://cvtisr.summon.serialssolutions.com/2.0.0/link/0/eLvHCXMwtV1Lb9QwELag5VAOiKcoLxmJXlhFSmLHjo-lLQIEFVKLtLfIsR2RgrKrzbban9-Z2M4uragAiUu0SuLI8czOfJkZf0PIG2NyQKlWJE7mRcJVppPScp5wLrVh4FHTtBmaTcjj43I6VV_D3pN-aCcgu65crdT8v4oazoGwcevsX4h7fCicgN8gdDiC2OH4R4I_aZHwFyvIHbKmYsBvArB0XTOJV_pY3zgHD9muJrVeTLrZRlo-4NXDFswK4OoRrX4ZaV5HMP5Zf5_ZUHI7qtreQbH37tDGWgo1JOSzhfuxeV-INmRYoRITJ0MI7No2GB-VFCIBrDD1TsVb0lLmiZC-v8poaoMx88aSeYKm4HeZJ569ZtJ9dOEMpoTEARkbuFaDzf6VKfsE54HTwBQdy5W4TbZzWSgwdtv7H4-mnzZ4xZA0bydG4taJJwBgPNDB-zeKifChJPDKFH4HZa449QGpnN4n98InBt33qvGA3HLdQ3J3Q3CPwJkOSkJRFWhQEhqVhIKSDFd62nYURlGvJBSUhEYleUy-vT86PfiQhGYaiWEsXSaC69JkWtm01mWeCSO0go9Zg-XHdZnaoi4L7QDuC9Fo2VhlbWY4d6bhzmnWsCdkq5t17imhNsOhhbQWQxqsVsoCzNSZLYUBNMh2SRrXpTKBaR4bnvysYknhWQVLWeFSVqmsYCl3ydtxyNzTrNx0M4-LXQWc6PFfBTpz07DXUTAV2FBMjOnOzc77Crw-tqyGd3_2b49-TnbWf5YXZGu5OHcvyR1zsWz7xaugfZdNp481
linkProvider Elsevier
openUrl ctx_ver=Z39.88-2004&ctx_enc=info%3Aofi%2Fenc%3AUTF-8&rfr_id=info%3Asid%2Fsummon.serialssolutions.com&rft_val_fmt=info%3Aofi%2Ffmt%3Akev%3Amtx%3Ajournal&rft.genre=article&rft.atitle=Simple+tree+pattern+matching+for+trees+in+the+prefix+bar+notation&rft.jtitle=Discrete+Applied+Mathematics&rft.au=Lahoda%2C+Jan&rft.au=%C5%BDd%E2%80%99%C3%A1rek%2C+Jan&rft.date=2014-01-30&rft.pub=Elsevier+B.V&rft.issn=0166-218X&rft.eissn=1872-6771&rft.volume=163&rft.spage=343&rft.epage=351&rft_id=info:doi/10.1016%2Fj.dam.2013.07.018&rft.externalDocID=S0166218X13003296
thumbnail_l http://covers-cdn.summon.serialssolutions.com/index.aspx?isbn=/lc.gif&issn=0166-218X&client=summon
thumbnail_m http://covers-cdn.summon.serialssolutions.com/index.aspx?isbn=/mc.gif&issn=0166-218X&client=summon
thumbnail_s http://covers-cdn.summon.serialssolutions.com/index.aspx?isbn=/sc.gif&issn=0166-218X&client=summon