Controlled Bidirectional Grammars

Jan Anne Hogendorp

Controlled Bidirectional Grammars

Jan Anne Hogendorp

Research output: Book/Report › Report › Other research output

66 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 language	English
Place of Publication	Enschede
Publisher	University of Twente
Number of pages	25
Publication status	Published - 1988

Publication series

Name	Memoranda Informatica
Publisher	University of Twente, Department of Computer Science
No.	INF-88-10
ISSN (Print)	0923-1714

Keywords

HMI-SLT: Speech and Language Technology

Access to Document

ReportFinal published version, 92.7 KB

Controlled bidirectional grammars
Hogendorp, J. A., 31 Aug 1990, Enschede: University of Twente. 166 p.
Research output: Thesis › PhD Thesis - Research external, graduation UT

Open Access
File

2 Link opens in a new tab Citations (Scopus)

262 Downloads (Pure)

Cite this

@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",

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 = "English",

series = "Memoranda Informatica",

publisher = "University of Twente",

number = "INF-88-10",

address = "Netherlands",

}

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

M3 - Report

T3 - Memoranda Informatica

BT - Controlled Bidirectional Grammars

PB - University of Twente

CY - Enschede

ER -

Controlled Bidirectional Grammars

Abstract

Publication series

Keywords

Access to Document

Fingerprint

Research output

Controlled bidirectional grammars

Cite this