Affiliation:
1. Univ. of Copenhagen, Copenhagen, Denmark
Abstract
A new approach to ambiguity of context-free grammars is presented, and within this approach the LL and LR techniques are generalized to solve the following problems for large classes of ambiguous grammars:
The user may control the parser generation so as to get a parser which finds some specific parse trees for the sentences. The generalized LL and LR techniques will still guarantee that the resulting parser accepts all sentences and terminates in linear time on all input.
Publisher
Association for Computing Machinery (ACM)
Reference25 articles.
1. Deterministic parsing of ambiguous grammars
2. Grammatical abstraction and incremental syntax analysis in a language-based editor
3. ~BILLOT S. AND LANG B. 1989. The structure of shared forests in ambiguous parsing. In ~Proceedings of the 27th Annual Meeting of the Assoctat~on for Computational Lzngu~stics. ACL ~143-151. 10.3115/981623.981641 ~BILLOT S. AND LANG B. 1989. The structure of shared forests in ambiguous parsing. In ~Proceedings of the 27th Annual Meeting of the Assoctat~on for Computational Lzngu~stics. ACL ~143-151. 10.3115/981623.981641
4. Denotational engineering
Cited by
7 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献
1. Restricting grammars with tree automata;Proceedings of the ACM on Programming Languages;2017-10-12
2. Model-Checking Parse Trees;2013 28th Annual ACM/IEEE Symposium on Logic in Computer Science;2013-06
3. Safe Specification of Operator Precedence Rules;Software Language Engineering;2013
4. Efficient and flexible incremental parsing;ACM Transactions on Programming Languages and Systems;1998-09
5. Disambiguating grammars by exclusion of sub-parse trees;Acta Informatica;1996-09-01