## A New Algorithm for Linear Regular Tree Pattern Matching (1998)

### Cached

### Download Links

- [drona.csa.iisc.ernet.in]
- [drona.csa.iisc.ernet.in]
- DBLP

### Other Repositories/Bibliography

Venue: | Theoretical Computer Science |

Citations: | 7 - 4 self |

### BibTeX

@ARTICLE{Shankar98anew,

author = {Priti Shankar and Amitranjan Gantait},

title = {A New Algorithm for Linear Regular Tree Pattern Matching},

journal = {Theoretical Computer Science},

year = {1998},

volume = {242},

pages = {125--142}

}

### OpenURL

### Abstract

### Citations

4107 |
Introduction to Automata Theory, Languages, and Computation
- Hopcroft, Ullman
- 1979
(Show Context)
Citation Context ...t the reader is familiar with the notions of rightmost derivation sequences, handles, viable prefixes of right sentential forms, and items being valid for viable prefixes. Definitions may be found in =-=[13]-=-. By a viable prefix induced by an input string we mean the stack contents that result from processing the input string during an LR parsing sequence. If the grammar is ambiguous, then there may be se... |

514 |
Simple word problems in universal algebras
- Knuth, Bendix
- 1970
(Show Context)
Citation Context ...entation of functional programming languages [14], term rewriting systems [12] programming environments [5], [17] code optimization in compilers [16], code generation [1] [2] [8], and theorem proving =-=[15]-=-. In a seminal paper, Hoffmann and O'Donnell(HOD)[11] described top down and bottom up algorithms for the problem of linear tree pattern matching. Their top down algorithm was space efficient, but req... |

142 | Pattern-matching in trees - Hoffmann, O’Donnell - 1982 |

129 |
The synthesizer generator
- Reps, Teitelbaum
- 1984
(Show Context)
Citation Context ...mental to a wide variety of applications in Computer Science. Some of these are, the implementation of functional programming languages [14], term rewriting systems [12] programming environments [5], =-=[17]-=- code optimization in compilers [16], code generation [1] [2] [8], and theorem proving [15]. In a seminal paper, Hoffmann and O'Donnell(HOD)[11] described top down and bottom up algorithms for the pro... |

62 |
Programming environments based on structured editors: The MENTOR experience
- Donzeau-Gouge, Huet, et al.
- 1984
(Show Context)
Citation Context ...fundamental to a wide variety of applications in Computer Science. Some of these are, the implementation of functional programming languages [14], term rewriting systems [12] programming environments =-=[5]-=-, [17] code optimization in compilers [16], code generation [1] [2] [8], and theorem proving [15]. In a seminal paper, Hoffmann and O'Donnell(HOD)[11] described top down and bottom up algorithms for t... |

52 | Optimal Code generation for expression tree: An application of BURS theory - Pelegri-Llopart, Graham - 1988 |

51 | A new method for compiler code generation - GLANVILLE, GRAHAM - 1978 |

50 | Conception, Evolution, and Application of Functional Programming Languages
- Hudak
- 1989
(Show Context)
Citation Context ...compiler back end. 1 Introduction Tree pattern matching is fundamental to a wide variety of applications in Computer Science. Some of these are, the implementation of functional programming languages =-=[14]-=-, term rewriting systems [12] programming environments [5], [17] code optimization in compilers [16], code generation [1] [2] [8], and theorem proving [15]. In a seminal paper, Hoffmann and O'Donnell(... |

35 |
An improvement to bottom-up tree pattern matching
- Chase
- 1987
(Show Context)
Citation Context ...red, in the worst case, auxiliary space O(2patsize\Theta maxarity\Thetasj OP j), where maxarity is the maximum arity of an operator, and j OP j is the number of operators in the input alphabet. Chase =-=[4]-=- presented a technique to compress the huge tables generated while preprocessing patterns. Specifically, Chase's technique needs during the matching phase, 1sa compressed table of dimension arity(op) ... |

32 | Efficient retargetable code generation using bottom-up tree pattern matching
- Balachandran, Dhamdere, et al.
- 1990
(Show Context)
Citation Context ...Some of these are, the implementation of functional programming languages [14], term rewriting systems [12] programming environments [5], [17] code optimization in compilers [16], code generation [1] =-=[2]-=- [8], and theorem proving [15]. In a seminal paper, Hoffmann and O'Donnell(HOD)[11] described top down and bottom up algorithms for the problem of linear tree pattern matching. Their top down algorith... |

32 |
E.: Faster tree pattern matching
- Dubiner, Galil, et al.
- 1994
(Show Context)
Citation Context ...ough it appears difficult to obtain a space efficient, linear time algorithm for top down tree pattern matching, the current best one requiring time O(subsize \Thetasppatsize \Thetaspolylog(patsize)) =-=[6]-=-. Bottom up algorithms that achieve linear matching time have been devised. However, all of these require exponential space for storing preprocessed information for use during matching. The HOD bottom... |

28 | Tree Automata for Code Selection - Ferdinand, Seidl, et al. - 1994 |

26 |
Efficient tree pattern matching: An aid to code generation
- AHO, GANAPATHI
- 1985
(Show Context)
Citation Context ...ce. Some of these are, the implementation of functional programming languages [14], term rewriting systems [12] programming environments [5], [17] code optimization in compilers [16], code generation =-=[1]-=- [2] [8], and theorem proving [15]. In a seminal paper, Hoffmann and O'Donnell(HOD)[11] described top down and bottom up algorithms for the problem of linear tree pattern matching. Their top down algo... |

25 |
Programming with equations
- Hoffman, O’Donnell
- 1982
(Show Context)
Citation Context ...tion Tree pattern matching is fundamental to a wide variety of applications in Computer Science. Some of these are, the implementation of functional programming languages [14], term rewriting systems =-=[12]-=- programming environments [5], [17] code optimization in compilers [16], code generation [1] [2] [8], and theorem proving [15]. In a seminal paper, Hoffmann and O'Donnell(HOD)[11] described top down a... |

16 |
High-quality code generation via bottomup tree pattern matching
- Hatcher, Christopher
- 1986
(Show Context)
Citation Context ...ass of patterns larger than that considered by HOD. This is the class of regular tree patterns defined by regular tree grammars. Regular tree patterns are used extensively in code generation grammars =-=[10]-=-,[2],[8]. The conventional approach has been to construct a tree pattern matching automaton for the purpose, by preprocessing the patterns. Ferdinand et.al[8] construct a deterministic finite tree aut... |

14 | An Efficient Context - Free Parsing Algorithm - Earley - 1969 |

5 | More efficient bottom up tree pattern matching - Cai, Paige, et al. - 1990 |

4 | Retargettable code generation using bottom up tree pattern matching - Kumar, S - 1992 |

3 |
OPTRAN-a language system for the specification of program transformations: system overview and experiences
- Lipps, Moncke, et al.
- 1988
(Show Context)
Citation Context ...ions in Computer Science. Some of these are, the implementation of functional programming languages [14], term rewriting systems [12] programming environments [5], [17] code optimization in compilers =-=[16]-=-, code generation [1] [2] [8], and theorem proving [15]. In a seminal paper, Hoffmann and O'Donnell(HOD)[11] described top down and bottom up algorithms for the problem of linear tree pattern matching... |

2 | E cient retargetable code generation using bottom up tree pattern matching - Balachandran, Dhamdhere, et al. - 1990 |

1 |
A new algorithm for tree pattern matching and its application to retargetable code generation, M.E
- Gantait
- 1996
(Show Context)
Citation Context ...nerated by the grammar, so this problem does not arise. We have run this algorithm on a specification consisting of the tree patterns encoding the instruction set of the MC68030 machine(without costs)=-=[9]-=-. Details are given below: Number of normalized productions: 176 Number of nonterminals: 32 Number of operators of arity 1: 12 Number of operators of arity 2: 15 16sNumber of symbols of arity 0: 19 Si... |

1 | Optimal regular tree pattern matching using pushdown automata - Madhavan - 1998 |