Abstract
Methods of describing the syntax of programming languages in ways that are more flexible and natural than conventional BNF descriptions are considered. These methods involve the use of ambiguous context-free grammars together with rules to resolve syntactic ambiguities. It is shown how efficient LR and LL parsers can be constructed directly from certain classes of these specifications. © 1975, ACM. All rights reserved.
Author supplied keywords
Cite
CITATION STYLE
APA
Aho, A. V., Johnson, S. C., & Ullman, J. D. (1975). Deterministic Parsing of Ambiguous Grammars. Communications of the ACM, 18(8), 441–452. https://doi.org/10.1145/360933.360969
Register to see more suggestions
Mendeley helps you to discover research relevant for your work.
Already have an account? Sign in
Sign up for free