Strict deterministic grammars and Greibach normal form

    Research output: Contribution to journalArticleAcademicpeer-review

    34 Downloads (Pure)


    A new method is presented to transform non-left-recursive grammars to grammars in Greibach normal form. It is shown that if the transformation is applied to a strict deterministic grammar, the newly obtained grammar in Greibach normal form is also strict deterministic.
    Original languageUndefined
    Pages (from-to)395-401
    Number of pages7
    JournalElektronische Informationsverarbeitung und Kybernetik
    Issue number8/9
    Publication statusPublished - Aug 1979


    • EWI-9217
    • IR-66926
    • HMI-SLT: Speech and Language Technology

    Cite this