Context derivation sets and context-free normal forms

Authors:
Charlotte Miller
Affiliations:
Department of Computer Science, The University of Western Ontario, London, Ontario, Canada
Venue:
Journal of Automata, Languages and Combinatorics - Special issue: Selected papers of the fourth international workshop on descriptional complexity of formal systems
Year:
2004

Citing 6
Cited 0

Families generated by grammars and L systems

Handbook of formal languages, vol. 1
A Supernormal-Form Theorem for Context-Free Grammars

Journal of the ACM (JACM)
Grammar and L Formas: An Introduction

Grammar and L Formas: An Introduction
Introduction To Automata Theory, Languages, And Computation

Introduction To Automata Theory, Languages, And Computation
Towards a Meta-Normal Form Algorithm for Context-Free Grammars

WIA '97 Revised Papers from the Second International Workshop on Implementing Automata
Context equivalence and context-free normal forms

Context equivalence and context-free normal forms

Quantified Score

Hi-index	0.00

Visualization

Abstract

A set of transformations is presented that will convert an arbitrary context-tree grammar to six of the normal forms for which the right hand side of any production has at most two occurrences of nonterminal symbols. These transformations form the basis of a meta-normal form algorithm for context-free grammars. The algorithm takes as input an arbitrary context-free grammar and a target normal form, expressed as an extended two-symbol grammar form, and converts the grammar to that normal form. The number of nonterminals and productions in the output grammars of each of the base transformations is minimal.