GLR parser (CFG Parsing CFG Problems)

From Algorithm Wiki
Revision as of 10:53, 15 February 2023 by Admin (talk | contribs) (Created page with "== Time Complexity == $O(n^{3})$ == Space Complexity == $O(n^{3})$ words (https://link-springer-com.ezproxy.canberra.edu.au/content/pdf/10.1007/978-3-662-21545-6.pdf) == 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")
(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/content/pdf/10.1007/978-3-662-21545-6.pdf)

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=44885"