1982
DOI: 10.1145/322290.322295
|View full text |Cite
|
Sign up to set email alerts
|

Pattern Matching in Trees

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
3
1

Citation Types

0
126
0
3

Year Published

1993
1993
2024
2024

Publication Types

Select...
7
2
1

Relationship

0
10

Authors

Journals

citations
Cited by 376 publications
(129 citation statements)
references
References 18 publications
0
126
0
3
Order By: Relevance
“…Kron [26], Hoffmann and O'Donnell [24], and Chase [7] have laid the foundations of the BUPM technique. Chase [7] implemented a BUPM by specifying patterns using a regular tree grammar (RTG).…”
Section: Other Workmentioning
confidence: 99%
“…Kron [26], Hoffmann and O'Donnell [24], and Chase [7] have laid the foundations of the BUPM technique. Chase [7] implemented a BUPM by specifying patterns using a regular tree grammar (RTG).…”
Section: Other Workmentioning
confidence: 99%
“…It also allows a tree mapped to a path. This definition is quite different from the tree matching defined in [7] . There is much research on how to find such a mapping efficiently and all the proposed methods can be categorized into two groups.…”
Section: Introductionmentioning
confidence: 99%
“…In a typical application, the subject tree is an intermediate code representation for a source program undergoing compilation; the minimum cost derivation tree yields a cheapest assembly level code sequence for the tree. Most algorithms for regular tree pattern matching draw heavily from the seminal work of [9] and [3] for the problem of tree pattern matching with a single wildcard. The algorithms employ a preprocessing phase, which constructs tables encoding the finite state tree pattern matching automaton, and a matching phase which traverses the input subject tree and reports matches at the appropriate nodes.…”
Section: Introductionmentioning
confidence: 99%