/* PBXA64 handbook-style C text example: levenshtein_row.
 * compute one dynamic-programming edit-distance row. This source deliberately keeps every transformation visible
 * instead of hiding it behind library calls, making it useful for tracing.
 */
int main(void) {
    int previous[4] = { 0, 1, 2, 3 }; int current[4]; char a[] = "cat"; char b = 'c'; int j = 0; current[0] = 1; for (j = 1; j < 4; ++j) { int cost = a[j - 1] == b ? 0 : 1; int left = current[j - 1] + 1; int up = previous[j] + 1; int diagonal = previous[j - 1] + cost; current[j] = left < up ? (left < diagonal ? left : diagonal) : (up < diagonal ? up : diagonal); } return current[1] == 0 ? 0 : 1;
}

/* Discussion: inspect the loop bounds, byte classification, and final return
 * value. The bounded-C frontend currently records CIR0200 for all C source;
 * this example remains a real handbook program for the public C surface once
 * that frontend gate is restored. */
