Portal de Periódicos da CAPES

Deterministic parsing of ambiguous grammars

1975; Association for Computing Machinery; Volume: 18; Issue: 8 Linguagem: Inglês

10.1145/360933.360969

1557-7317

Alfred V. Aho, S. C. Johnson, Jeffrey D. Ullman,

Logic, programming, and type systems

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.