Controlled Rewriting Using Productions and Reductions.

Jan Anne Hogendorp

    Research output: Book/ReportReportOther research output

    22 Downloads (Pure)


    We investigate context-free grammars the rules of which can be used in a productive and in a reductive fashion, while the application of these rules is controlled by a regular language. We distinguish several modes of derivation for this kind of grammar. The resulting language families (properly) extend the family of context-free languages. We establish some closure properties of these language families and some grammatical transformations which yield a few normal forms for this type of grammar. Finally, we consider some special cases (viz. the context-free grammar is linear or left-linear), and generalizations, in particular, the use of arbitrary rather than regular control languages.
    Original languageUndefined
    Place of PublicationEnschede
    PublisherUniversity of Twente, Department of Computer Science
    Number of pages16
    Publication statusPublished - 1988

    Publication series

    NameMemoranda Informatica
    PublisherUniversity of Twente, Department of Computer Science
    ISSN (Print)0923-1714


    • IR-64290
    • HMI-SLT: Speech and Language Technology
    • EWI-10888

    Cite this