Indexed Grammars—An Extension of Context-Free Grammars
Journal of the ACM (JACM)
An Improved Context-Free Recognizer
ACM Transactions on Programming Languages and Systems (TOPLAS)
An efficient context-free parsing algorithm
Communications of the ACM
Theory of Syntactic Recognition for Natural Languages
Theory of Syntactic Recognition for Natural Languages
Introduction To Automata Theory, Languages, And Computation
Introduction To Automata Theory, Languages, And Computation
The Design and Analysis of Computer Algorithms
The Design and Analysis of Computer Algorithms
The Theory of Parsing, Translation, and Compiling
The Theory of Parsing, Translation, and Compiling
Tree-oriented proofs of some theorems on context-free and indexed languages
STOC '70 Proceedings of the second annual ACM symposium on Theory of computing
Formal studies of stratificational grammars.
Formal studies of stratificational grammars.
Syntax and semantics in parsing: an application to montague grammar.
Syntax and semantics in parsing: an application to montague grammar.
ACL '83 Proceedings of the 21st annual meeting on Association for Computational Linguistics
Formal constraints on metarules
ACL '83 Proceedings of the 21st annual meeting on Association for Computational Linguistics
Phrase structure trees bear more fruit than you would have thought
ACL '80 Proceedings of the 18th annual meeting on Association for Computational Linguistics
A practical comparison of parsing strategies
ACL '81 Proceedings of the 19th annual meeting on Association for Computational Linguistics
Computational complexity and lexical functional grammar
ACL '81 Proceedings of the 19th annual meeting on Association for Computational Linguistics
Bottom-Up Filtering: a parsing strategy for GPSG
COLING '90 Proceedings of the 13th conference on Computational linguistics - Volume 2
A new kind of finite-state automaton: register vector grammar
IJCAI'85 Proceedings of the 9th international joint conference on Artificial intelligence - Volume 2
| Hi-index | 0.00 |
Meta-theoretical results on the decidability, generative capacity, and recognition complexity of several syntactic theories are surveyed. These include context-free grammars, transformational grammars, lexical functional grammars, generalized phrase structure grammars, and tree adjunct grammars.