 Overview of technical progress  Grammar-based implementation

 Reviewed methods of parsing grammars in C++  Open source frameworks  Stream parsing  Etc.

 Preferred Flex and Bison  Flex for interpreting the incoming grammar  Bison for generating tokens  Both are open-source and have available Windows ports  Both are standalone executables that can be built into Visual Studio’s custom build rules

 Began primitive implementation within OpenBEAGLE  Continually had issues with run-time errors in customizing examples ▪ Simple conversion of Even Parity example from Boolean to String

 Looked back to EpochX for inspiration in designing a set of primitives for a grammar  Rolled back to version  Custom grammar rules implemented completely differently ▪ Most of all, it “works” ▪ Nodal evaluation easily triggered

 To continue to make progress, I moved ahead with the EpochX implementation  Customized C BNF grammar  Composition strategies  High-level role assignments to sub-trees

 Sample output  CODE_INJECTION( CHAR 0 () bubbleSort LPARAN RPARAN) ▪ Inject the following code: ▪ char bubbleSort();  BUFFER( FUNCTION_POINTER( CHAR(bubbleSort), numbers, int*)) ▪ Create a function pointer under the ‘Buffer’ role: ▪ char (*sort)(int*) = bubbleSort; ▪ Buffer = sort(numbers);

public static final String GRAMMAR_FRAGMENT = " ::= \n" + " ::= | | \n“ + " ::= BUFFER ( )\n + " ::= WRAPPER(,, ) " + "| FUNCTION_POINTER(,, )" + "| CODE_INJECTION( )\n" + " ::= INT( ) | DOUBLE( ) " + "| FLOAT( ) | CHAR( )\n" + " ::= INT0() | DOUBLE0() | FLOAT0() | CHAR0()\n" + " ::= \n" + " ::= LPARAN RPARAN\n" + " ::= ";

public static final String GRAMMAR_FRAGMENT = " ::= \n" + " ::= | | \n“ + " ::= BUFFER ( )\n + " ::= WRAPPER(,, ) " + "| FUNCTION_POINTER(,, )" + "| CODE_INJECTION( )\n" + " ::= INT( ) | DOUBLE( ) " + "| FLOAT( ) | CHAR( )\n" + " ::= INT0() | DOUBLE0() | FLOAT0() | CHAR0()\n" + " ::= \n" + " ::= LPARAN RPARAN\n" + " ::= "; High level roles

public static final String GRAMMAR_FRAGMENT = " ::= \n" + " ::= | | \n“ + " ::= BUFFER ( )\n + " ::= WRAPPER(,, ) " + "| FUNCTION_POINTER(,, )" + "| CODE_INJECTION( )\n" + " ::= INT( ) | DOUBLE( ) " + "| FLOAT( ) | CHAR( )\n" + " ::= INT0() | DOUBLE0() | FLOAT0() | CHAR0()\n" + " ::= \n" + " ::= LPARAN RPARAN\n" + " ::= "; Strategy definitions

public static final String GRAMMAR_FRAGMENT = " ::= \n" + " ::= | | \n“ + " ::= BUFFER ( )\n + " ::= WRAPPER(,, ) " + "| FUNCTION_POINTER(,, )" + "| CODE_INJECTION( )\n" + " ::= INT( ) | DOUBLE( ) " + "| FLOAT( ) | CHAR( )\n" + " ::= INT0() | DOUBLE0() | FLOAT0() | CHAR0()\n" + " ::= \n" + " ::= LPARAN RPARAN\n" + " ::= "; C types (with and without subtree)

public static final String GRAMMAR_FRAGMENT = " ::= \n" + " ::= | | \n“ + " ::= BUFFER ( )\n + " ::= WRAPPER(,, ) " + "| FUNCTION_POINTER(,, )" + "| CODE_INJECTION( )\n" + " ::= INT( ) | DOUBLE( ) " + "| FLOAT( ) | CHAR( )\n" + " ::= INT0() | DOUBLE0() | FLOAT0() | CHAR0()\n" + " ::= \n" + " ::= LPARAN RPARAN\n" + " ::= "; Start of C BNF grammar

public static final String GRAMMAR_FRAGMENT = " ::= \n" + " ::= | | \n“ + " ::= BUFFER ( )\n + " ::= WRAPPER(,, ) " + "| FUNCTION_POINTER(,, )" + "| CODE_INJECTION( )\n" + " ::= INT( ) | DOUBLE( ) " + "| FLOAT( ) | CHAR( )\n" + " ::= INT0() | DOUBLE0() | FLOAT0() | CHAR0()\n" + " ::= \n" + " ::= LPARAN RPARAN\n" + " ::= "; Terminal nodes (target method, parameters, etc.)

 Implementation  Java classes provided for each non-terminal node that requires evaluation ▪ Strategies ▪ Types ▪ Etc.  Tree shape determined by grammar constraints  Fitness to be determined by SW-engineering metrics ▪ (e.g. Lines of code, complexity, number of transformations, etc.)

 Continue grammar implementation  C BNF, identify ‘canned transformations’ ▪ Int.toString() could be represented by a known set of C statements  Define fitness function  Impact of code  Fan-in / fan-out  Others…