Controlled Bidirectional Grammars

Jan Anne Hogendorp

    Research output: Book/ReportReportOther research output

    19 Downloads (Pure)

    Abstract

    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 pages25
    Publication statusPublished - 1988

    Publication series

    NameMemoranda Informatica
    PublisherUniversity of Twente, Department of Computer Science
    No.INF-88-10
    ISSN (Print)0923-1714

    Keywords

    • HMI-SLT: Speech and Language Technology
    • IR-64289
    • EWI-10887

    Cite this

    Hogendorp, J. A. (1988). Controlled Bidirectional Grammars. (Memoranda Informatica; No. INF-88-10). Enschede: University of Twente, Department of Computer Science.
    Hogendorp, Jan Anne. / Controlled Bidirectional Grammars. Enschede : University of Twente, Department of Computer Science, 1988. 25 p. (Memoranda Informatica; INF-88-10).
    @book{16ed8164a41c44ba83f3b54c0f115f7f,
    title = "Controlled Bidirectional Grammars",
    abstract = "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.",
    keywords = "HMI-SLT: Speech and Language Technology, IR-64289, EWI-10887",
    author = "Hogendorp, {Jan Anne}",
    note = "The number of pages refers to the original paper version; the recently produced PDF-file is more compact.",
    year = "1988",
    language = "Undefined",
    series = "Memoranda Informatica",
    publisher = "University of Twente, Department of Computer Science",
    number = "INF-88-10",

    }

    Hogendorp, JA 1988, Controlled Bidirectional Grammars. Memoranda Informatica, no. INF-88-10, University of Twente, Department of Computer Science, Enschede.

    Controlled Bidirectional Grammars. / Hogendorp, Jan Anne.

    Enschede : University of Twente, Department of Computer Science, 1988. 25 p. (Memoranda Informatica; No. INF-88-10).

    Research output: Book/ReportReportOther research output

    TY - BOOK

    T1 - Controlled Bidirectional Grammars

    AU - Hogendorp, Jan Anne

    N1 - The number of pages refers to the original paper version; the recently produced PDF-file is more compact.

    PY - 1988

    Y1 - 1988

    N2 - 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.

    AB - 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.

    KW - HMI-SLT: Speech and Language Technology

    KW - IR-64289

    KW - EWI-10887

    M3 - Report

    T3 - Memoranda Informatica

    BT - Controlled Bidirectional Grammars

    PB - University of Twente, Department of Computer Science

    CY - Enschede

    ER -

    Hogendorp JA. Controlled Bidirectional Grammars. Enschede: University of Twente, Department of Computer Science, 1988. 25 p. (Memoranda Informatica; INF-88-10).