GLR parser (CFG Parsing CFG Problems)
Jump to navigation
Jump to search
Time Complexity
$O(n^{3})$
Space Complexity
$O(n^{3})$ words
(https://link.springer.com/chapter/10.1007%2F978-3-662-21545-6_18)
Description
Approximate?
Exact
Randomized?
No, deterministic
Model of Computation
Word RAM? (implemented on ALGOL)
Year
1974
Reference
https://link.springer.com/chapter/10.1007%2F978-3-662-21545-6_18