Compilers: principles, techniques, and tools
Compilers: principles, techniques, and tools
Parsing theory volume 2: LR(K) and LL(K) parsing
Parsing theory volume 2: LR(K) and LL(K) parsing
Efficient Parsing for Natural Language: A Fast Algorithm for Practical Systems
Efficient Parsing for Natural Language: A Fast Algorithm for Practical Systems
Recent Advances in Parsing Technology
Recent Advances in Parsing Technology
Deterministic left to right parsing of Tree Adjoining Languages
ACL '90 Proceedings of the 28th annual meeting on Association for Computational Linguistics
The computational complexity of the correct-prefix property for TAGs
Computational Linguistics
Fast LR parsing using rich (Tree Adjoining) Grammars
EMNLP '02 Proceedings of the ACL-02 conference on Empirical methods in natural language processing - Volume 10
An efficient LR parser generator for tree-adjoining grammars
New developments in parsing technology
| Hi-index | 0.00 |
We present a new LR algorithm for tree-adjoining grammars. It is an alternative to an existing algorithm that is shown to be incorrect. Furthermore, the new algorithm is much simpler, being very close to traditional LR parsing for context-free grammars. The construction of derived trees and the computation of features also become straightforward.