On the complexity of LR(k) testing

Full Text: PDFPDF Buy this ArticleBuy this Article
Authors: Harry B. Hunt, III Harvard Univ., Cambridge, MA
Thomas G. Szymanski Princeton Univ., Princeton, NJ
Jeffrey D. Ullman Princeton Univ., Princeton, NJ
Published in:
Cover Image
 
· Magazine
Communications of the ACM CACM Homepage archive
Volume 18 Issue 12, Dec. 1975
Pages 707-716
ACM New York, NY, USA
table of contents doi>10.1145/361227.361232
On the complexity of LR(k) testing Published by ACM 1975 Article
Bibliometrics Data  Bibliometrics
· Downloads (6 Weeks): 1
· Downloads (12 Months): 11
· Downloads (cumulative): 295
· Citation Count: 9


Tools and Resources

Share:

|
feedback Feedback | Switch to single page view (no tabs)

Powered by The ACM Guide to Computing Literature


The ACM Digital Library is published by the Association for Computing Machinery. Copyright © 2013 ACM, Inc.
Terms of Usage   Privacy Policy   Code of Ethics   Contact Us

Useful downloads: Adobe Acrobat    QuickTime    Windows Media Player    Real Player
The ACM Guide to Computing Literature
All Tags
Export Formats
 
 
Save to Binder