Static Analysis of Interactions between Elementary Structures of a Grammar (Analyse statique des interactions entre structures élémentaires d'une grammaire) [in French]
نویسنده
چکیده
Static Analysis of Interactions between Elementary Structures of a Grammar We are interested in the semi-automatic construction of computational grammars and in their use for parsing. We consider lexicalized grammars with elementary structures which are trees, underspecified or not. We present an algorithm that aims at foreseeing all elementary trees attached at words which can come between two given words of a sentence, whose associated elementary trees are companions, that is, they will necessarily interact in the syntactic composition of the sentence. MOTS-CLÉS : grammaire lexicalisée, grammaire d’interaction, construction de grammaires.
منابع مشابه
A Framework to Analyse Synchronous Data - Flow
Presence and absence of signals inside a reaction are inherent to the synchronous paradigm, as well as clocks which are sets of instants that indicate when a given condition is fulllled over a sequence of reactions (e.g. when a signal is present). Clocks are essential to capture the control in data-ow speciications; more generally relations between clocks should be analyzed to verify some prope...
متن کاملStatic debugging of C programs: detection of pointer errors in recursive data structures
The incorrect use of pointers is one of the most common source of bugs in imperative languages. In this context, any kind of static code checking capable of detecting potential bugs at compile time is welcome. This paper presents a static debugging technique for the detection of incorrect accesses to memory (dereferences of invalid pointers). The analysed language is a subset of C. The tool is ...
متن کاملWide-Coverage Semantics for Spatio-Temporal Reasoning
In this article, we describe our research on wide-coverage semantics for Frenchlanguage texts and on its application to produce detailed semantic descriptions of itineraries. Using a categorial grammar semi-automatically extracted from the French Treebank and a manually constructed semantic lexicon, the resulting parser computes discourse representation structures representing the meaning of ar...
متن کاملTraduction automatique en utilisant a une grammaire en Chaine
Une des applications de cette analyse syntaxique qui vient d'Stre exposde par Monsieur Salkoff pourrait 8tre la traduction automatique. L'utilisation de cette analyse syntaxique permet une nouvelle approche des probl~mes difficiles de la traduction automatique. J'essayerai de montrer qu'une analyse syntaxique, mettant en lumi~re tousles rapports linguistiquement significatifs entre les roots de...
متن کاملFrom LL-Regular to LL (1) Grammars: Transformations, Covers and Parsing
— In this paper it is shown that it is possible to transform any LL-regular grammar G into an LL{\) grammar G' in such a way that parsing G' is as good as parsing G. That ist a par se of a sentence of grammar G can be obtained with a simple string homomorphism from the parse of a corresponding sentence of G'. Since any LL (k) grammar is an LL-regular grammar the results which are obtained are v...
متن کامل