GLR parser (CFG Parsing CFG Problems)

From Algorithm Wiki

Revision as of 08:46, 10 April 2023 by Admin (talk | contribs)

(diff) ← Older revision | Latest revision (diff) | Newer revision → (diff)

Jump to navigation Jump to search

Time Complexity

$O(n^{3})$

Space Complexity

$O(n^{3})$ words

(https://link-springer-com.ezproxy.canberra.edu.au/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.ezproxy.canberra.edu.au/chapter/10.1007%2F978-3-662-21545-6_18

Retrieved from "https://algorithm-wiki-csail-mit-edu.ezproxy.canberra.edu.au/w/index.php?title=GLR_parser_(CFG_Parsing_CFG_Problems)&oldid=47456"