On multiple context-free grammars
Theoretical Computer Science
A geometric hierarchy beyond context-free languages
Theoretical Computer Science
Grammars with controlled derivations
Handbook of formal languages, vol. 2
Indexed Grammars—An Extension of Context-Free Grammars
Journal of the ACM (JACM)
Regulated Rewriting in Formal Language Theory
Regulated Rewriting in Formal Language Theory
Introduction to Formal Language Theory
Introduction to Formal Language Theory
Counting with range concatenation grammars
Theoretical Computer Science - Algebraic methods in language processing
Characterizing mildly context-sensitive grammar formalisms
Characterizing mildly context-sensitive grammar formalisms
Characterizing structural descriptions produced by various grammatical formalisms
ACL '87 Proceedings of the 25th annual meeting on Association for Computational Linguistics
Global index languages
The generative capacity of the lambek-grishin calculus: a new lower bound
FG'09 Proceedings of the 14th international conference on Formal grammar
| Hi-index | 0.00 |
We review the properties of Global Index Grammars (GIGs), a grammar formalism that uses a stack of indices associated with productions and has restricted context-sensitive power. We show how the control of the derivation is performed and how this impacts in the descriptive power of this formalism both in the string languages and the structural descriptions that GIGs can generate.