Program this!, Programming thread Options

[mipadi]

I'm of the understand that there are a few Technology forum aficionados that are programmers, or are at least interested in programming, so I thought I'd start a thread -- a sort of game. The game was inspired by this thread. It's pretty simple: just implement the following program in whatever language you desire. If someone's already posted a program in your favorite language, see if you can do better! You get bragging rights if you implement the program in a weird/unusual/rare language.

Here are the guidelines for the program:

1. Write a method named matchesPattern1() that accepts a String as input. This method determines whether or not the input String has the following property:
   
   The string has a number of c's equal to the total number of a's and b's.
   
   In other words, every word in this language is of the form:
   
   anbmc(n + m), where n ≥ 0 and m ≥ 0.
   
   n and m may be equal, but this is not required.
   
   Thus, bc, abccac, aabbcccc and abbbbccccc are all valid words in this language.
   
   Your method should return a boolean value: true if the input string satisfies these requirements, and false if it does not.
   
   For example, given a String such as aabbcc, your method should return false.
2. Write a method named matchesPattern2() that accepts a String as input. This method determines whether or not the input String has the following properties:
   
   The string has a number of c's equal to the total number of a's and b's.
   All a's come before any b's, and all b's come before any c's. (HINT: Can you test for this using one or more boolean variable "flags"?)
   
   In other words, every word in this language is of the form:
   
   anbmc(n + m), where n ≥ 0 and m ≥ 0.
   
   n and m may be equal, but this is not required.
   
   Thus, aabbcccc and abbbbccccc are valid words in this language, but abaccc and abc are not.
   
   Your method should return a boolean value: true if the input string satisfies these requirements, and false if it does not.
   
   For example, given a String such as aabbcc, your method should return false.
   
   This pattern is identical to the one above, except it imposes a specific ordering requirement on the input string.
3. Write a method named matchesPattern3() that accepts a String as input. This method determines whether or not the input String has the following properties:
   
   The string has an equal (nonzero) number of a's and c's, and any number of (zero or more) b's.
   All a's come before any b's, and all b's come before any c's.
   
   In other words, every word in this language is of the form:
   
   anb*cn, where n > 0.
   
   Thus, aabbcc and ac are valid words in this language, but abaccc and aabc are not.
   
   Your method should return a boolean value: true if the input string satisfies these requirements, and false if it does not.
   
   For example, given a String such as aabbaa, your method should return false.

[mipadi]

Objective-C

This one isn't dramatically different from the C version...but for such a low-level task, that's to be expected, I guess.

CODE

/* Compile:
*   $ gcc -std=c99 -o matcher-objc -framework Foundation matcher.m
*   # ./matcher-objc
*/

#import <Foundation/Foundation.h>


#define foreach(s)     for (unsigned int i = 0; i < [s length]; i++)


static BOOL matchesPattern1(NSString *s)
{
    struct { unsigned int a; unsigned int b; unsigned int c; } sums = {0,0,0};
    
    foreach(s) {
        switch ([s characterAtIndex:i]) {
            case 'a': sums.a++; break;
            case 'b': sums.b++; break;
            case 'c': sums.c++; break;
        }
    }
    
    return sums.a + sums.b == sums.c;
}


static BOOL matchesPattern2(NSString *s)
{
    struct { unsigned int a; unsigned int b; unsigned int c; } sums = {0,0,0};
    struct { BOOL a; BOOL b; BOOL c; } saw = {NO,NO,NO};
    
    foreach(s) {
        switch ([s characterAtIndex:i]) {
            case 'a':
                if (saw.a || saw.b) return NO;
                saw.a = YES;
                sums.a++;
                break;
            case 'b':
                if (saw.c) return NO;
                saw.b = YES;
                sums.b++;
                break;
            case 'c':
                saw.c = YES;
                sums.c++;
                break;
        }
    }
    
    return sums.a + sums.b == sums.c;
}


static BOOL matchesPattern3(NSString *s)
{
    struct { unsigned int a; unsigned int c; } sums = {0,0};
    struct { BOOL a; BOOL b; BOOL c; } saw = {NO,NO,NO};
    
    foreach(s) {
        switch ([s characterAtIndex:i]) {
            case 'a':
                if (saw.b || saw.c) return NO;
                saw.a = YES;
                sums.a++;
                break;
            case 'b':
                if (saw.c) return NO;
                saw.b = YES;
                break;
            case 'c':
                saw.c = YES;
                sums.c++;
                break;
        }
    }
    
    return sums.a == sums.c && sums.a > 0;
}


int main(int argc, char **argv)
{
    NSAutoreleasePool *pool = [[NSAutoreleasePool alloc] init];
    char buf[81];
    
    while (fscanf(stdin, "%s\n", buf) != EOF) {
        NSString *s = [[NSString alloc] initWithCString:buf];
        printf("%s\n", [s UTF8String]);
        printf("  matches pattern 1? %s\n", (matchesPattern1(s) ? "true" : "false"));
        printf("  matches pattern 2? %s\n", (matchesPattern2(s) ? "true" : "false"));
        printf("  matches pattern 3? %s\n", (matchesPattern3(s) ? "true" : "false"));
        [s release];
    }
    
    [pool release];
    return 0;
}

Source: matcher.m