Hi, I am working now for investigation of three well-known algorithms of context-free languages parsing: Earley, CYK and Tomita. I am investigating the time bound with the language grammar bulk, so that the quantity of rules in the grammar. Now I've got results and need to check the correctness of these ones. Does anybody knows a conference where I could do such the checking? Thanks, Vladimir.