On the covering of parsable grammars

    Research output: Contribution to journalArticleAcademicpeer-review

    6 Citations (Scopus)
    39 Downloads (Pure)

    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 languageEnglish
    Pages (from-to)99-110
    Number of pages12
    JournalJournal of computer and system sciences
    Volume15
    Issue number1
    DOIs
    Publication statusPublished - Aug 1977

    Keywords

    • HMI-SLT: Speech and Language Technology

    Fingerprint Dive into the research topics of 'On the covering of parsable grammars'. Together they form a unique fingerprint.

  • Cite this