Displaying 1 result from an estimated 1 matches for "cyk".
Did you mean:
clk
2006 Nov 01
2
[LLVMdev] LLVM / C--
...s region
of the input. In general, by using the GLR algorithm, Elkhound avoids the
difficulty of trying to make a language grammar fit the LALR(1) restrictions.
http://en.wikipedia.org/wiki/GLR_parser
Advantages
When implemented carefully, the GLR algorithm has the same time complexity as
the CYK algorithm and Earley algorithm -- O(n3). However, GLR carries two
additional important advantages:
The time required to run the algorithm is proportional to the degree of
nondeterminism in the grammar -- on deterministic grammars the GLR algorithm
runs in O(n) time (this is not true of the Earle...