An efficient augmented-context-free parsing algorithm
Computational Linguistics
Indexed Grammars—An Extension of Context-Free Grammars
Journal of the ACM (JACM)
An efficient context-free parsing algorithm
Communications of the ACM
Regulated Rewriting in Formal Language Theory
Regulated Rewriting in Formal Language Theory
Introduction to Formal Language Theory
Introduction to Formal Language Theory
Characterizing mildly context-sensitive grammar formalisms
Characterizing mildly context-sensitive grammar formalisms
Tree-adjoining grammar parsing and boolean matrix multiplication
Computational Linguistics
Characterizing structural descriptions produced by various grammatical formalisms
ACL '87 Proceedings of the 25th annual meeting on Association for Computational Linguistics
ACL '95 Proceedings of the 33rd annual meeting on Association for Computational Linguistics
LR parsing for global index languages (GILs)
CIAA'03 Proceedings of the 8th international conference on Implementation and application of automata
LR parsing for global index languages (GILs)
CIAA'03 Proceedings of the 8th international conference on Implementation and application of automata
| Hi-index | 0.00 |
We investigate Global Index Grammars (GIGs), a grammar formalism that uses a stack of indices associated with productions and has restricted context-sensitive power. We discuss some of the structural descriptions that GIGs can generate compared with those generated by LIGs. We show also how GIGs can represent structural descriptions corresponding to HPSGs (Pollard and Sag, 1994) schemas.