Formal translation directed by parsing
Transformations of translation grammars
Transformations of grammars and translation directed by parsing
The class of translation grammars is introduced. This class is characterized by a possibility to implement a formal translation as an algorithm directed by parsing. To perform a translation, the conventional parser is extended by a facility to perform output operations within the parsing actions shift and reduce. The definitions of Kernel- and -translation grammars are presented. The transformations shaking-down and postponing that enable to transform some translation grammars into Kernel...
Tree compression pushdown automaton
A new kind of a deterministic pushdown automaton, called a Tree Compression Automaton, is presented. The tree compression automaton represents a complete compressed index of a set of trees for subtrees and accepts all subtrees of given trees. The algorithm for constructing our pushdown automaton is incremental. For a single tree with nodes, the automaton has at most states, its transition function cardinality is at most and there are pushdown store symbols. If hashing is used for storing...
Arbology: Trees and pushdown automata
We present a unified and systematic approach to basic principles of Arbology, a new algorithmic discipline focusing on algorithms on trees. Stringology, a highly developed algorithmic discipline in the area of string processing, can use finite automata as its basic model of computation. For various kinds of linear notations of ranked and unranked ordered trees it holds that subtrees of a tree in a linear notation are substrings of the tree in the linear notation. Arbology uses pushdown automata...
Subtree Matching by Pushdown Automata
Page 1