Eric Villemonte de la Clergerie, François Barthélemy  Home/Search
Context Related
| inria.fr/INRIA/Projects/Ato...TCS.ps.gz Cached: PS.gz PS PDF This document uses CoBlitz to cache paper downloads. If your firewall is blocking outgoing connections to port 3125, you can use these links to download local copies.
Image Update HelpPS.gz PS PDF From: pauillac.inria.fr/a...publioscope (more) (Enter author homepages) |
Rate this article:      (best)Comment on this article |
Abstract: This paper presents a general framework for deriving tabular algorithms for a very large class of stack-based computations, not only in context-free parsing but in logic programming as well and more generally for all kinds of "information" domains (abstract domains, constraint domains). Tabular algorithms store traces of computations in a table to achieve computation sharing, which is most useful when dealing with non-deterministic computations. By considering what can be naively described as... (Update)
Similar documents based on text: More All
0.3: Practical aspects in compiling tabular TAG parsers - Alonso, Seddah, Clergerie (2000) (Correct)
0.3: Building tabular interpretations for (generalized).. - Barthélemy.. (1996) (Correct)
0.3: Shared Forests Can Guide Parsing - Barthelemy, Boullier, Deschamp.. (Correct)
BibTeX entry: (Update)
Eric Villemonte de la Clergerie and Francois Barth'elemy. Information Flow in Tabular Interpretations for Generalized Pushdown Automata. Theoretical Computer Science (TCS), 199(1&2):167--198, 1998. http://citeseer.ist.psu.edu/villemontedelaclerge97information.html More
@article{ clergerie98information,
author = "Eric Villemonte de la Clergerie and Fran{\c{c}}ois Barth{\'e}lemy",
title = "Information flow in tabular interpretations for generalized push-down automata",
journal = "Theoretical Computer Science",
volume = "199",
number = "1--2",
pages = "167--198",
year = "1998",
url = "citeseer.ist.psu.edu/villemontedelaclerge97information.html" }
Citations (may not include all citations):1838 Foundations of Logic Programming (context) - Lloyd - 1987
1399 Compilers: principles (context) - Aho, Sethi et al. - 1986
204 Magic--set and other strange ways to implement logic program.. (context) - Bancilhon, Maier et al. - 1986
192 An efficient context-free parsing algorithm (context) - Earley - 1970
112 OLD resolution with tabulation (context) - Tamaki, Sato - 1986
112 XSB as an efficient deductive database engine - Sagonas, Swift et al. - 1994
78 Parsing as deduction - Pereira, Warren - 1983
66 Algorithm schemata and data structures in syntactic processi.. (context) - Kay - 1980
64 Tabulation techniques for recursive programs (context) - Bird - 1980
53 Using restriction to extend parsing algorithms for complex--.. - Shieber - 1985
44 Deterministic techniques for efficient non-deterministic par.. (context) - Lang - 1974
44 An efficient augmented-context-free parsing algorithm - Tomita - 1987
22 A generic abstract interpretation algorithm and its complexi.. (context) - Le Charlier, Musumbu et al. - 1991
17 Database-complete proof procedures based on SLD resolution (context) - Vieille - 1987
13 Complete evaluation of Horn clauses: an automata theoretic a.. (context) - Lang - 1988
[Article contains additional citations not shown here]
Documents on the same site (http://pauillac.inria.fr/atoll/publioscope.html): More
A Tabular Interpretation of Bottom-up Automata for TAG - Clergerie, Pardo, Souto (1998) (Correct)
How to build quickly an efficient implementation of the .. - Lefèbvre.. (Correct)
Garbage Collecting the World - Lang, Queinnec, Piquer (1992) (Correct)
Online articles have much greater impact More about CiteSeer.IST Add search form to your site Submit documents Feedback
CiteSeer.IST - Copyright Penn State and NEC