A technique for generating almost optimal Floyd-Evans productions for precedence grammars
- 1 August 1970
- journal article
- Published by Association for Computing Machinery (ACM) in Communications of the ACM
- Vol. 13 (8) , 501-508
- https://doi.org/10.1145/362705.362712
Abstract
A technique is developed for generating almost optimal Floyd-Evans productions given a precedence grammar. A graph formulation is used for the problem of merging productions. The productions generated correspond to the minimum cost inverse-arborescence of that graph. The validity of the technique is demonstrated for weak precedence grammars defined here, but the productions mechanically generated for any precedence grammar can often be modified in such a way that correct, almost optimal parsers are obtained.Keywords
This publication has 6 references indexed in Scilit:
- Some properties of precedence languagesPublished by Association for Computing Machinery (ACM) ,1969
- Translator writing systemsCommunications of the ACM, 1968
- PL360, a Programming Language for the 360 ComputersJournal of the ACM, 1968
- EULER: A generalization of ALGOL and its formal definition: Part 1Communications of the ACM, 1966
- An ALGOL 60 compilerAnnual Review in Automatic Programming, 1964
- A Descriptive Language for Symbol ManipulationJournal of the ACM, 1961