Home

About

Advanced Search

Browse by Discipline

Scientific Societies

E-print Alerts

Add E-prints

E-print Network
FAQHELPSITE MAPCONTACT US


  Advanced Search  

 
IEEE TRANSACTIONS ON EVOLUTIONARY COMPUTATION, VOL. 11, NO. 1, FEBRUARY 2007 77 Christiansen Grammar Evolution: Grammatical
 

Summary: IEEE TRANSACTIONS ON EVOLUTIONARY COMPUTATION, VOL. 11, NO. 1, FEBRUARY 2007 77
Christiansen Grammar Evolution: Grammatical
Evolution With Semantics
Alfonso Ortega, Marina de la Cruz, and Manuel Alfonseca, Member, IEEE
Abstract--This paper describes Christiansen grammar evo-
lution (CGE), a new evolutionary automatic programming
algorithm that extends standard grammar evolution (GE) by
replacing context-free grammars by Christiansen grammars. GE
only takes into account syntactic restrictions to generate valid
individuals. CGE adds semantics to ensure that both semantically
and syntactically valid individuals are generated. It is empirically
shown that our approach improves GE performance and even
allows the solution of some problems are difficult to tackle by GE.
Index Terms--Automatic programming, formal languages, ge-
netic algorithms (GAs), languages.
I. INTRODUCTION
THE DESIGN OF programming languages, compilers,
and interpreters is one of the main topics in Theoretical
Computer Science. Chomsky grammars [1] provide a powerful
tool that allows the development of systematic algorithmic

  

Source: Alfonseca, Manuel - Escuela Politécnica Superior, Universidad Autonoma de Madrid

 

Collections: Computer Technologies and Information Sciences; Engineering