Compilers: principles, techniques, and tools
Compilers: principles, techniques, and tools
An efficient augmented-context-free parsing algorithm
Computational Linguistics
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)
Confluent and Other Types of Thue Systems
Journal of the ACM (JACM)
Introduction To Automata Theory, Languages, And Computation
Introduction To Automata Theory, Languages, And Computation
Regulated Rewriting in Formal Language Theory
Regulated Rewriting in Formal Language Theory
Introduction to Formal Language Theory
Introduction to Formal Language Theory
Construction of Efficient Generalized LR Parsers
WIA '97 Revised Papers from the Second International Workshop on Implementing Automata
A tabular interpretation of a class of 2-Stack Automata
COLING '98 Proceedings of the 17th international conference on Computational linguistics - Volume 2
On the applicability of Global Index Grammars
ACL '03 Proceedings of the 41st Annual Meeting on Association for Computational Linguistics - Volume 2
On the applicability of Global Index Grammars
ACL '03 Proceedings of the 41st Annual Meeting on Association for Computational Linguistics - Volume 2
| Hi-index | 0.00 |
We present here Global Index Grammars (GIGs) and the characterizing 2 Stack automaton model (LR-2PDA). We present the techniques to construct an LR parsing table for deterministic Global Index Grammars. GILs include languages which are beyond the power of Linear Indexed Grammars/Tree Adjoining Grammars. GILs generalize properties of CF Languages in a straightforward way and their descriptive power is relevant at least for natural language and molecular biology phenomena.