On Predicting the Grammar of a Normal-Form

Alan Bundy; Predrag Janicic; Alan Smaill

On Predicting the Grammar of a Normal-Form

Alan Bundy, Predrag Janicic, Alan Smaill

School of Informatics

Research output: Chapter in Book/Report/Conference proceeding › Conference contribution

Abstract

We introduce the problem of predicting the formal grammar of the normal-form that is generated from a class of expressions by ex- haustive application of a set of rewrite rules. We describe and implement a sound but incomplete procedure for solving this problem and report on its theoretical and experimental properties.

Original language	English
Title of host publication	PCC - Proof, Computation, Complexity International workshop 2004
Number of pages	22
Publication status	Published - 2005

Access to Document

BNFsTPAccepted author manuscript, 237 KB

Cite this

@inproceedings{08ae2ad6ea4642b3b817ecd24261ef56,

title = "On Predicting the Grammar of a Normal-Form",

abstract = "We introduce the problem of predicting the formal grammar of the normal-form that is generated from a class of expressions by ex- haustive application of a set of rewrite rules. We describe and implement a sound but incomplete procedure for solving this problem and report on its theoretical and experimental properties.",

author = "Alan Bundy and Predrag Janicic and Alan Smaill",

year = "2005",

language = "English",

booktitle = "PCC - Proof, Computation, Complexity International workshop 2004",

}

TY - GEN

T1 - On Predicting the Grammar of a Normal-Form

AU - Bundy, Alan

AU - Janicic, Predrag

AU - Smaill, Alan

PY - 2005

Y1 - 2005

N2 - We introduce the problem of predicting the formal grammar of the normal-form that is generated from a class of expressions by ex- haustive application of a set of rewrite rules. We describe and implement a sound but incomplete procedure for solving this problem and report on its theoretical and experimental properties.

AB - We introduce the problem of predicting the formal grammar of the normal-form that is generated from a class of expressions by ex- haustive application of a set of rewrite rules. We describe and implement a sound but incomplete procedure for solving this problem and report on its theoretical and experimental properties.

M3 - Conference contribution

BT - PCC - Proof, Computation, Complexity International workshop 2004

ER -

On Predicting the Grammar of a Normal-Form

Abstract

Access to Document

Fingerprint

Cite this