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.
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.
