Looking for context-free parsers theorems evaluation conference

mefrill@yandex.ru (Vladimir)
3 Jul 2003 23:31:24 -0400

          From comp.compilers
Related articles
Looking for context-free parsers theorems evaluation conference mefrill@yandex.ru (2003-07-03)
| List of all articles for this month |
From: mefrill@yandex.ru (Vladimir)
Newsgroups: comp.compilers
Date: 3 Jul 2003 23:31:24 -0400
Organization: http://groups.google.com/
Keywords: parse, question
Posted-Date: 03 Jul 2003 23:31:24 EDT

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.

Post a followup to this message

Return to the comp.compilers page.
Search the comp.compilers archives again.