Results 1 
6 of
6
Locating Matches of Tree Patterns in Forests
 Foundations of Software Technology and Theoretical Computer Science, Lecture Notes in Computer Science
, 1998
"... . We deal with matching and locating of patterns in forests of variable arity. A pattern consists of a structural and a contextual condition for subtrees of a forest, both of which are given as tree or forest regular languages. We use the notation of constraint systems to uniformly specify both kind ..."
Abstract

Cited by 61 (5 self)
 Add to MetaCart
(Show Context)
. We deal with matching and locating of patterns in forests of variable arity. A pattern consists of a structural and a contextual condition for subtrees of a forest, both of which are given as tree or forest regular languages. We use the notation of constraint systems to uniformly specify both kinds of conditions. In order to implement pattern matching we introduce the class of pushdown forest automata. We identify a special class of contexts such that not only pattern matching but also locating all of a forest's subtrees matching in context can be performed in a single traversal. We also give a method for computing the reachable states of an automaton in order to minimize the size of transition tables. 1 Introduction In Standard Generalized Markup Language (SGML) [Gol90] documents are represented as trees. A node in a document tree may have arbitrarily many children, independent of the symbol at that node. A sequence of documents or subdocuments is called a forest. A main task in do...
Optimal regular tree pattern matching using pushdown automata
, 1998
"... Abstract. We propose a construction that augments the precomputation step of a regular tree pattern matching algorithm to include cost analysis. The matching device generated is a pushdown automaton in contrast with the conventionallygenerated tree pattern matching automaton. Our technique can handl ..."
Abstract

Cited by 1 (1 self)
 Add to MetaCart
(Show Context)
Abstract. We propose a construction that augments the precomputation step of a regular tree pattern matching algorithm to include cost analysis. The matching device generated is a pushdown automaton in contrast with the conventionallygenerated tree pattern matching automaton. Our technique can handle a larger class of cost augmented regular tree grammars than can be preprocessed byconventional methods, and has been tested on some input problem instances representing instruction sets for processors. 1
Efficient Statistical Modeling for the Compression of Tree Structured Intermediate Code
"... ..."
(Show Context)
Extending GrahamGlanville Techniques for Optimal Code Generation
"... We propose a new technique for constructing codegenerator generators, which combines the advantages of the GrahamGlanville parsing technique and the bottomup tree parsing approach. Machine descriptions are similar to Yacc specifications. The construction effectively generates a pushdown automaton ..."
Abstract
 Add to MetaCart
(Show Context)
We propose a new technique for constructing codegenerator generators, which combines the advantages of the GrahamGlanville parsing technique and the bottomup tree parsing approach. Machine descriptions are similar to Yacc specifications. The construction effectively generates a pushdown automaton as the matching device. This device is able to handle ambiguous grammars, and can be used to generate locally optimal code without the use of heuristics. Cost computations are performed at preprocessing time. The class of regular tree grammars augmented with costs that can be handled by our system properly includes those that can be handled by bottomup systems based on finitestate tree parsing automata. Parsing time is linear in the size of the subject tree. We have tested the system on specifications for some systems and report table sizes.
UDC 004.635.3, DOI: 10.2298/CSIS1002331F Subtree Matching by Pushdown Automata ā
"... Abstract. Subtree matching is an important problem in Computer Science on which a number of tasks, such as mechanical theorem proving, termrewriting, symbolic computation and nonprocedural programming languages are based on. A systematic approach to the construction of subtree pattern matchers by d ..."
Abstract
 Add to MetaCart
Abstract. Subtree matching is an important problem in Computer Science on which a number of tasks, such as mechanical theorem proving, termrewriting, symbolic computation and nonprocedural programming languages are based on. A systematic approach to the construction of subtree pattern matchers by deterministic pushdown automata, which read subject trees in prefix and postfix notation, is presented. The method is analogous to the construction of string pattern matchers: for a given pattern, a nondeterministic pushdown automaton is created and is then determinised. In addition, it is shown that the size of the resulting deterministic pushdown automata directly corresponds to the size of the existing string pattern matchers based on finite automata.