User loginNavigation |
archivesPathological Problems in ParsingHello LtU! I have composed an algorithm for a garbage-collected LL-derived parser for extracting parse forests in a dynamic-syntax language. I'm not really sure how to go about calculating the time complexity though, I have no formal training. So far all my tests seem to indicate that the algorithm is O(n^2) in the length of the input in the worst-case and linear in the best case. Since it has been stated that GLR can take O(n^3) in the worst case i find my result surprising. I have been unable to locate any examples that trigger the O(n^3) behaviour in the GLR though. So my question is, does do readers of LtU have any examples of really pathological grammars? |
Browse archivesActive forum topics |
Recent comments
15 weeks 1 day ago
15 weeks 1 day ago
15 weeks 1 day ago
37 weeks 2 days ago
41 weeks 4 days ago
43 weeks 1 day ago
43 weeks 1 day ago
45 weeks 6 days ago
50 weeks 3 days ago
50 weeks 4 days ago