Attribute grammars were introduced by Knuth as a mechanism for specifying the semantics of context-free languages (Knuth, 1968). Almost two decades after their introduction, they remain one of the main techniques for specifying semantics of programming languages, and have recently been used in new and quite diverse domains. An attribute grammar is a context-free grammar, in which each nontermin...

This paper introduces an eecient indexing organization which provides for parallel retrievals. Given a p-processor massively parallel computer, our organization allows a maximum of p retrievals to be performed concurrently and thus achieves an approximate speed up of p in the best case. The index structure is based on the multi-B-tree index structure. It is compatible with current automatic ret...

We describe a new access method, the hBΠ-tree, an adaptation of the Lomet and Salzberg hB-tree index to the constraints of their Π-tree . The Π-trees, a generalization of the Blink-trees of Lehman and Yao, provide very high concurrency with recovery, hence permitting highly parallel access to data. The hB-tree is a multi-attribute index which is highly insensitive to dimensionality. The combina...

This paper presents an application of Information Gain (IG) attribute evaluation to the classification of the sonar targets with C4.5 decision tree. C4.5 decision tree has inherited ability to focus on relevant features and ignore irrelevant ones, but such method may also benefit from independent feature selection. In our experiments, IG attribute evaluation significantly improves C4.5 decision...

We present a novel approach in machine learning by combining naı̈ve Bayes classifiers with tree kernels. Tree kernel methods produce promising results in machine learning tasks containing treestructured attribute values. These kernel methods are used to compare two tree-structured attribute values recursively. Up to now tree kernels are only used in kernel machines like Support Vector Machines o...

The paper describes the MAX system, a tool for speci cation and prototyping of language processors. The MAX system is based on a rst{order framework generalizing attribute grammar like frameworks. It allows to refer to syntax tree nodes and \distant" attribute occurrences. Attributes may have tree nodes as values, so that global relations between distant tree nodes can be expressed. This enable...

Attribute value types play an important role in mostly every datamining task. Most learners, for instance, are restricted to particular value types. The usage of such learners is just possible after special forms of preprocessing. RapidMiner most commonly distinguishes between nominal and numerical values which are well-known to every RapidMineruser. Although, covering a great fraction of attri...

Attribute grammars are a formalism for specifying computations on syntax trees. SSCC is a practical attribute-grammar system based on a polynomial-time extension of Kastens’s ordered attribute grammars. The system comprises of two subsystems. The generation subsystem computes the evaluation order of attribute occurrences in production rules and translates attribute equations into low-level code...