Skip Navigation

The Computer Journal 1981 24(2):156-161; doi:10.1093/comjnl/24.2.156
© 1981 by British Computer Society
This Article
Right arrow Full Text (PDF)
Right arrow Alert me when this article is cited
Right arrow Alert me if a correction is posted
Services
Right arrow Email this article to a friend
Right arrow Similar articles in this journal
Right arrow Similar articles in ISI Web of Science
Right arrow Alert me to new issues of the journal
Right arrow Add to My Personal Archive
Right arrow Download to citation manager
Right arrow Search for citing articles in:
ISI Web of Science (3)
Right arrowRequest Permissions
Google Scholar
Right arrow Articles by Harrison, M. A.
Right arrow Articles by Yehudai, A.
Right arrow Search for Related Content
Social Bookmarking
Add to CiteULike   Add to Connotea   Add to Del.icio.us  
What's this?

Eliminating null rules in linear time*

M. A. Harrison1 § and A. Yehudai2 ¶

1 Computer Science Division, University of California at Berkeley, Berkeley, USA, 2 Division of Computer Science, Tel-Aviv University, Ramat-Aviv, Tel-Aviv, Israel

We present a linear time algorithm for eliminating null rules in context free grammars. Until recently all algorithms given in the literature for this problem required exponential time.

Received December 1978. revised January 1980.

* Research supported by National Science Foundation Grants GJ-43332 and MCS74-07636-A01.

§ Computer Science Division, University of California at Berkeley

Division of Computer Science, Tel-Aviv University, Ramat-Aviv, Tel-Aviv, Israel.


Add to CiteULike CiteULike   Add to Connotea Connotea   Add to Del.icio.us Del.icio.us    What's this?




Disclaimer:
Please note that abstracts for content published before 1996 were created through digital scanning and may therefore not exactly replicate the text of the original print issues. All efforts have been made to ensure accuracy, but the Publisher will not be held responsible for any remaining inaccuracies. If you require any further clarification, please contact our Customer Services Department.