Affiliation:
1. Computer Science Department, University of Southern California, Salvaton Computer Science Center, Los Angeles, CA
2. Departments of Mathematics and Computer Science, University of Southern California, Salvaton Computer Science Center, Los Angeles, CA
Abstract
Grammar forms are compared for their efficiency in representing languages, as measured by the sizes (i.e. total number of symbols, number of variable occurrences, number of productions, and number of distinct variables) of interpretation grammars. For every regular set, right- and left-linear forms are essentially equal in efficiency. Any form for the regular sets provides, at most, polynomial improvement over right-linear form. Moreover, any polynomial improvement is attained by some such form, at least on certain languages. Greater improvement for some languages is possible using forms expressing larger classes of languages than the regular sets. However, there are some languages for which no improvement over right-linear form is possible.
While a similar set of results holds for forms expressing exactly the linear languages, only linear improvement can occur for forms expressing all the context-free languages.
Publisher
Association for Computing Machinery (ACM)
Subject
Artificial Intelligence,Hardware and Architecture,Information Systems,Control and Systems Engineering,Software
Cited by
7 articles.
订阅此论文施引文献
订阅此论文施引文献,注册后可以免费订阅5篇论文的施引文献,订阅后可以查看论文全部施引文献
1. A metrics suite for grammar-based software;Journal of Software Maintenance and Evolution: Research and Practice;2004
2. Simple metrics for programming languages;Information Processing & Management;1984-01
3. A pushdown automation or a context-free grammar—which is more economical?;Theoretical Computer Science;1982-04
4. Concise description of finite languages;Theoretical Computer Science;1981
5. Predictors of Context-Free Grammars;SIAM Journal on Computing;1980-08