YSharp

(Updated my answer, which wasn't taking all of your question's assumptions into account)

(Just posted an answer)

@vzn : Lambda the Ultimate (aka LtU) is a programming language weblog, for discussions about programming language design, theory, practice, etc. It isn't mine, I'm just one of the posters over there. Cheers.

( So, just in case: lambda-the-ultimate.org/node/5414#comment-94026 )

Cheers/

If we'd end up finding an incompleteness proof, that's ok, too. I just want to know and need a little help with that.

Hi, are there formal language experts who'd be looking for something new to investigate wrt. context free grammars and parsing? I can code and I have some empirical results for one to look at, but I'd need help with finding a completeness proof, assuming it exists. Let me know. Thank you.

@ShaneKm yes, as originally posted in your SE question, the code is not thread-safe; FWIW, since I found the problem interesting, I gave a shot at it in my answer today, at your post. 'HTH,