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.
Original language | English |
---|---|
Pages (from-to) | 99-110 |
Number of pages | 12 |
Journal | Journal of computer and system sciences |
Volume | 15 |
Issue number | 1 |
DOIs | |
Publication status | Published - Aug 1977 |
Keywords
- HMI-SLT: Speech and Language Technology