Controlled grammatic ambiguity
Author:
Open Access
- 1 May 1994
- journal article
- Published by Association for Computing Machinery (ACM) in ACM Transactions on Programming Languages and Systems
- Vol. 16 (3) , 1024-1050
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.Keywords
This publication has 19 references indexed in Scilit:
- On conservative extensions of syntax in system developmentTheoretical Computer Science, 1991
- Incremental generation of parsersIEEE Transactions on Software Engineering, 1990
- Denotational engineeringScience of Computer Programming, 1989
- Looping LR parsersInformation Processing Letters, 1988
- Preface1985
- Incremental ParsingACM Transactions on Programming Languages and Systems, 1979
- Deterministic parsing of ambiguous grammarsCommunications of the ACM, 1975
- A system for typesetting mathematicsCommunications of the ACM, 1975
- On the translation of languages from left to rightInformation and Control, 1965
- On well-quasi-ordering finite treesMathematical Proceedings of the Cambridge Philosophical Society, 1963