Back to University of Twente portal
On the covering of parsable grammars
Nijholt, Anton (1977) On the covering of parsable grammars. Journal of Computer and System Sciences, 15 (1). pp. 99-110. ISSN 0022-0000
![[img]](http://doc.utwente.nl/style/images/fileicons/application_pdf.png)
| PDF 1686Kb |
| Abstract: | The notion of a parsable grammar is introduced. A definition of cover is provided which is a generalization of a well-known definition of cover. With this new definition of cover we prove that every parsable grammar is covered by an LR(1) grammar or, if the language is prefic-free, by a strict-deterministic grammar. A consequence of this result is that every LR(k) grammar is covered by an LR(1) or a strict deterministic grammar. |
| Item Type: | Article |
| Copyright: | © 1977 Elsevier Science |
| Faculty: | Electrical Engineering, Mathematics and Computer Science (EEMCS) |
| Research Group: | |
| Link to this item: | http://purl.utwente.nl/publications/66924 |
| Official URL: | http://dx.doi.org/10.1016/S0022-0000(77)80027-5 |
| Export this item as: | BibTeX EndNote HTML Citation Reference Manager |
Show download statistics for this publication
Show download statistics for this publicationRepository Staff Only: item control page