search

ku-progsys / rbsyn

Program synthesis for Ruby
BSD 3-Clause "New" or "Revised" License
94 stars 4 forks source link

efficient branching #30

Open ngsankha opened 4 years ago

ngsankha commented 4 years ago
  1. start off with one hole and fill that with the assumption that it will pass all tests.
  2. if one candidate passes n tests and fails m tests, keep the program corresponding to n tests together (along with branch condition) and recursively apply this procedure.
  3. Then apply the merge procedure as in the paper.

This method will eliminate individual cost for generating candidates for each test.