Grammatical Evolution (GE) Designed to evolve programs in any language, that can be described by a context free grammar Backus Naur Form (BNF)  production rules P  terminals T – non-expandable items  non-terminals N – can be expand into one or more items  N  T N = {S, Rule, Cond} T = {cl, cf, att, lt} S – starting symbol P: (1)S ::= Rule Rule [0] (2)Rule ::= Cond cl cf [0] | Rule Rule [1] (3)Cond ::= att lt [0] | Cond Cond [1]
{}