Quiz time for Bonzo

In comp.os.linux.advocacy, JeffRelf wrote on 02 Apr 2005 02:56:03 GMT

I can't say.

Dunno, don't really care. I saw it, no problem.

No doubt what you're seeing is a cron artifact. I synchronize my newsserver (leafnode) with NTP and it posts to my (Earthlink's) upstream server at exactly 12:00.

Ghostnews, every hour, on the hour. :-)

You don't do finite state machines, do you?

There's at least two parse methods one can use here:

1 Predictive parsing. This basically looks at the next token or nonterminal and decides which substatement to walk down.

2 LALR parsing. This pushes tokens on a stack; when a match is made the tokens are popped off the stack and the nonterminal pushed back on. As parsing proceeds the state of the parser reflects the possibilities one might encounter next; each token is buttociated with a next state, and either a shift or a reduce.

The two will result in different parsetrees and different operation ordering. I'd frankly have to work it out; suffice it to say that the compiler has some options here, and that things like

int a10; int i;

if(ai++ == ai++)

might result in very unexpected behavior.

It drove us buggy too, for awhile. Good catch.

Good identification, poor repair. The best repair I can think of is to do something along the lines of

char * generateString(char * buf, int bufl) { snprintf(bufl, "Name%d", rand()); return buf; }

and even then one gets into naming collisions. In Java the best fix would be to use 'synchronized' but that's not an option available in C++ unless one has a thread library with a mutex handy. (In Windows one might use EnterCriticalSection().)

In C++-STL one can return a std::string, but pbutting that into printf() is problematic. Of course, in C++ printf() is a bit of an anachronism anyway.

So does C++, if it's a static local.

-- It's still legal to go .sigless.