Deterministic parsing of ambiguous grammars
- 1 August 1975
- journal article
- Published by Association for Computing Machinery (ACM) in Communications of the ACM
- Vol. 18 (8), 441-452
- https://doi.org/10.1145/360933.360969
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.Keywords
This publication has 15 references indexed in Scilit:
- Elimination of single productions and merging nonterminal symbols of LR(1) grammarsComputer Languages, 1975
- Skeletal LR parsingPublished by Institute of Electrical and Electronics Engineers (IEEE) ,1974
- LR ParsingACM Computing Surveys, 1974
- Simple LR(k) grammarsCommunications of the ACM, 1971
- Top-down syntax analysisActa Informatica, 1971
- Some properties of precedence languagesPublished by Association for Computing Machinery (ACM) ,1969
- Control sets on grammarsTheory of Computing Systems, 1968
- Translator writing systemsCommunications of the ACM, 1968
- Syntactic Analysis and Operator PrecedenceJournal of the ACM, 1963
- Design of a separable transition-diagram compilerCommunications of the ACM, 1963