Sciweavers

11 search results - page 2 / 3
» Compiling Declarative Specifications of Parsing Algorithms
Sort
View
COLING
1996
13 years 6 months ago
Top-Down Predictive Linking and Complex-Feature-Based Formalisms
Automatic compilation of the linking relation employed in certain parsing algorithms for context-free languages is examined. Special problems arise in the extension of these algor...
James Kilbury
POPL
2004
ACM
14 years 5 months ago
Incremental execution of transformation specifications
We aim to specify program transformations in a declarative style, and then to generate executable program transformers from such specifications. Many transformations require non-t...
Ganesh Sittampalam, Oege de Moor, Ken Friis Larsen
SIGMOD
2009
ACM
142views Database» more  SIGMOD 2009»
14 years 5 months ago
A grammar-based entity representation framework for data cleaning
Fundamental to data cleaning is the need to account for multiple data representations. We propose a formal framework that can be used to reason about and manipulate data represent...
Arvind Arasu, Raghav Kaushik
ICDE
2008
IEEE
209views Database» more  ICDE 2008»
14 years 6 months ago
Distributed Monitoring of Peer-to-Peer Systems
In this paper, we are concerned with the distributed monitoring of P2P systems. We introduce the P2P Monitor system and a new declarative language, namely P2PML, for specifying mo...
Serge Abiteboul, Bogdan Marinoiu, Pierre Bourhis
POPL
2008
ACM
14 years 5 months ago
From dirt to shovels: fully automatic tool generation from ad hoc data
An ad hoc data source is any semistructured data source for which useful data analysis and transformation tools are not readily available. Such data must be queried, transformed a...
Kathleen Fisher, David Walker, Kenny Qili Zhu, Pet...