/* PBXA64 handbook-style C text example: word_counter.
 * count lexical words through an explicit delimiter state machine. This source deliberately keeps every transformation visible
 * instead of hiding it behind library calls, making it useful for tracing.
 */
int main(void) {
    char s[] = "one, two  three"; int i = 0, words = 0, inside = 0; for (i = 0; s[i] != 0; ++i) { int alpha = (s[i] >= 'a' && s[i] <= 'z'); if (alpha && !inside) { ++words; inside = 1; } if (!alpha) inside = 0; } return words == 3 ? 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. */
