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.
Document type :
Reports
Complete list of metadatas

https://hal.inria.fr/inria-00073234
Contributor : Rapport de Recherche Inria <>
Submitted on : Wednesday, May 24, 2006 - 12:17:30 PM
Last modification on : Friday, May 25, 2018 - 12:02:02 PM
Long-term archiving on : Sunday, April 4, 2010 - 11:39:11 PM

Identifiers

  • HAL Id : inria-00073234, version 1

Collections

Citation

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

Share

Metrics

Record views

93

Files downloads

68