Back to Search
Start Over
Deterministic Parsing of Ambiguous Grammars.
- Source :
-
Communications of the ACM . Aug1975, Vol. 18 Issue 8, p441-452. 12p. 6 Diagrams, 5 Charts. - Publication Year :
- 1975
-
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. [ABSTRACT FROM AUTHOR]
Details
- Language :
- English
- ISSN :
- 00010782
- Volume :
- 18
- Issue :
- 8
- Database :
- Academic Search Index
- Journal :
- Communications of the ACM
- Publication Type :
- Periodical
- Accession number :
- 5206804
- Full Text :
- https://doi.org/10.1145/360933.360969