Get 20M+ Full-Text Papers For Less Than $1.50/day. Start a 14-Day Trial for You or Your Team.

Learn More →

Efficient algorithms for automatic construction and compactification of parsing

Efficient algorithms for automatic construction and compactification of parsing Several computational problems about grammars are studied. Efficient algorithms are presented for the problems of (1) determining, for a given semantic grammar, if there exists a related parsing grammar in some specified grammar class, and (2) finding such a related parsing grammar when one exists. The two grammars are to be related by mergers of nonterminals and/or terminals. Efficient algorithms are presented for most of the grammar classes used in compilers. We also study the problem of (3) determining which terminals of a grammar are good candidates for merger into common lexical tokens of the corresponding parsing grammar. http://www.deepdyve.com/assets/images/DeepDyve-Logo-lg.png ACM Transactions on Programming Languages and Systems (TOPLAS) Association for Computing Machinery

Efficient algorithms for automatic construction and compactification of parsing

Loading next page...
 
/lp/association-for-computing-machinery/efficient-algorithms-for-automatic-construction-and-compactification-sDaLWcpI0J

References

References for this paper are not available at this time. We will be adding them shortly, thank you for your patience.

Publisher
Association for Computing Machinery
Copyright
The ACM Portal is published by the Association for Computing Machinery. Copyright © 2010 ACM, Inc.
Subject
Decision problems
ISSN
0164-0925
DOI
10.1145/29873.29876
Publisher site
See Article on Publisher Site

Abstract

Several computational problems about grammars are studied. Efficient algorithms are presented for the problems of (1) determining, for a given semantic grammar, if there exists a related parsing grammar in some specified grammar class, and (2) finding such a related parsing grammar when one exists. The two grammars are to be related by mergers of nonterminals and/or terminals. Efficient algorithms are presented for most of the grammar classes used in compilers. We also study the problem of (3) determining which terminals of a grammar are good candidates for merger into common lexical tokens of the corresponding parsing grammar.

Journal

ACM Transactions on Programming Languages and Systems (TOPLAS)Association for Computing Machinery

Published: Oct 1, 1987

There are no references for this article.