Affiliation:
1. Compagnie Internationale pour l'Informatique Les Clayes-sous-Bois, France
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.
Publisher
Association for Computing Machinery (ACM)
Reference16 articles.
1. CHEATHAM W. E. JR. The theory and construction of compilers. Notes for AM219 R Harvard U. Cambridge Mass. spring 1967. CHEATHAM W. E. JR. The theory and construction of compilers. Notes for AM219 R Harvard U. Cambridge Mass. spring 1967.
Cited by
35 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献