Controlled Rewriting Using Productions and Reductions.

Jan Anne Hogendorp

    Research output: Contribution to conferencePaper

    17 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
    Number of pages16
    Publication statusPublished - 1988
    EventComputing Science in The Netherlands, CSN '88 - Utrecht, The Netherlands
    Duration: 3 Nov 19884 Nov 1988


    ConferenceComputing Science in The Netherlands, CSN '88
    OtherNovember 3-4, 1988


    • IR-64309
    • EWI-10938
    • HMI-SLT: Speech and Language Technology

    Cite this