An efficient augmented-context-free parsing algorithm
Computational Linguistics
Deterministic Techniques for Efficient Non-Deterministic Parsers
Proceedings of the 2nd Colloquium on Automata, Languages and Programming
A study of tree adjoining grammars
A study of tree adjoining grammars
An Earley-type parsing algorithm for Tree Adjoining Grammars
ACL '88 Proceedings of the 26th annual meeting on Association for Computational Linguistics
Two recent developments in tree adjoining grammars: semantics and efficient processing
HLT '90 Proceedings of the workshop on Speech and Natural Language
A Formal Definition of Bottom-Up Embedded Push-Down Automata and Their Tabulation Technique
LACL '01 Proceedings of the 4th International Conference on Logical Aspects of Computational Linguistics
The computational complexity of the correct-prefix property for TAGs
Computational Linguistics
An alternative LR algorithm for TAGS
COLING '98 Proceedings of the 17th international conference on Computational linguistics - Volume 2
Incremental parser generation for Tree Adjoining Grammars
ACL '96 Proceedings of the 34th annual meeting on Association for Computational Linguistics
LR(k)-parsing of Coupled-Context-Free Grammars
COLING '94 Proceedings of the 15th conference on Computational linguistics - Volume 1
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 define a set of deterministic bottom-up left to right parsers which analyze a subset of Tree Adjoining Languages. The LR parsing strategy for Context Free Grammars is extended to Tree Adjoining Grammars (TAGs). We use a machine, called Bottom-up Embedded Push Down Automation (BEPDA), that recognizes in a bottom-up fashion the set of Tree Adjoining Languages (and exactly this set). Each parser consists of a finite state control that drives the moves of a Bottom-up Embedded Pushdown Automaton. The parsers handle deterministically some context-sensitive Tree Adjoining Languages. In this paper, we informally describe the BEPDA then given a parsing table, we explain the LR parsing algorithm. We then show how to construct an LR(0) parsing table (no lookahead). An example of a context-sensitive language recognized deterministically is given. Then, we explain informally the construction of SLR(1) parsing tables for BEPDA. We conclude with a discussion of our parsing method and current work.