News for hackers. Stuff that matters.
Re:I'm graduating with a CS degree but I don't feel like I k... by stcredzero on Friday February 04, 2011 @10:32AM (#2179716)
I'm going to play devil's advocate here, and point out that you can actually construct the proper automaton where the transition conditions are decided by regular expressions.

It might work like this: some programmer working on the project realizes something can't be parsed in a finite state machine, and 'cleverly' separates out one batch of regular expressions into a loop/recursive call

In this case, you've created an "Augmented Transition Network" which is equivalent in power to a stack machine or a Context Free Grammar. Is this really playing devil's advocate? That would imply setting up something that isn't a straw man whose solution isn't basic automata theory.

This also gives you an idea of how broken the project was, since my understanding is that they'd fix "that particular bug" and keep writing more regular expressions.

Re:I'm graduating with a CS degree but I don't feel like I k... by cynicalkane on Friday February 04, 2011 @11:59AM (#2180092)
The implication was that the project couldn't succeed because the management didn't understand basic automata theory, and insisted the programmers use only regular expressions. Presumably the regular expressions were being invoked by a Turing-complete programming language. Unless management decided that Turing-complete programming languages were not allowed, as well.
Re:I'm graduating with a CS degree but I don't feel like I k... by stcredzero on Friday February 04, 2011 @12:13PM (#2180168)
Amazing how often Turing-complete programming languages aren't utilized to their full potential. (And for the record, no I wasn't on that project. I have a CS degree and I remember automata.)