Graph Interpolation Grammars as Context-Free Automata

Abstract : A derivation step in a Graph Interpolation Grammar has the effect of scanning an input token. This feature, which aims at emulating the incrementality of the natural parser, restricts the formal power of GIGs. This contrasts with the fact that the derivation mechanism involves a context-sensitive device similar to tree adjunction in TAGs. The combined effect of input-driven derivation and restricted context-sensitiveness would be conceivably unfortunate if it turned out that Graph Interpolation Languages did not subsume Context Free Languages while being partially context-sensitive. This report sets about examining relations between CFGs and GIGs, and shows that GILs are a proper superclass of CFLs. It also brings out a strong equivalence between CFGs and GIGs for the class of CFLs. Thus, it lays the basis for meaningfully investigating the amount of context-sensitiveness supported by GIGs, but stops short of embarking on this investigation.
Type de document :
[Research Report] RR-3456, INRIA. 1998
Liste complète des métadonnées
Contributeur : Rapport de Recherche Inria <>
Soumis le : mercredi 24 mai 2006 - 12:17:30
Dernière modification le : vendredi 25 mai 2018 - 12:02:02
Document(s) archivé(s) le : dimanche 4 avril 2010 - 23:39:11



  • HAL Id : inria-00073234, version 1



John Larchevêque. Graph Interpolation Grammars as Context-Free Automata. [Research Report] RR-3456, INRIA. 1998. 〈inria-00073234〉



Consultations de la notice


Téléchargements de fichiers