Resolution of ambiguity in parsing

descriptionPublicationkeyboard_double_arrow_right Article 01 Jan 1976 English Publisher:Springer Science and Business Media LLCJournal:Acta Informatica, volume 6, pages 387-395 (issn: 0001-5903, eissn: 1432-0525,

Copyright policy )

Authors: R. Michael Wharton;

doi: 10.1007/bf00268139

Resolution of ambiguity in parsing

- Summary
- Subjects
- Metrics

Abstract

The use of context-free grammars to define the syntax of programming languages is complicated by the phenomenon of ambiguity. Ambiguity can be resolved by the specification of a unique canonical parse. A set of rules is given which defines a canonical bottom-up parse, and these rules are implemented in a left-to-right bottom-up parsing algorithm. A second set of rules is given which defines a canonical top-down parse, and these rules are similarly implemented in a left-to-right top-down parsing algorithm.

Related Organizations

York University
Canada

Keywords

General topics in the theory of software, Formal languages and automata

Impact byBIP!

	selected citations These citations are derived from selected sources. This is an alternative to the "Influence" indicator, which also reflects the overall/total impact of an article in the research community at large, based on the underlying citation network (diachronically).	5
	popularity This indicator reflects the "current" impact/attention (the "hype") of an article in the research community at large, based on the underlying citation network.	Average
	influence This indicator reflects the overall/total impact of an article in the research community at large, based on the underlying citation network (diachronically).	Top 10%
	impulse This indicator reflects the initial momentum of an article directly after its publication, based on the underlying citation network.	Average