|LR(0) vs. LALR, and the Great Parsing War email@example.com (1992-08-30)|
|Re: LR(0) vs. LALR, and the Great Parsing War firstname.lastname@example.org (1992-08-31)|
|Re: LR(0) vs. LALR, and the Great Parsing War email@example.com (1992-09-02)|
|Re: LR(0) vs. LALR, and the Great Parsing War firstname.lastname@example.org (1992-09-05)|
|From:||email@example.com (Richard L. Goerwitz)|
|Organization:||University of Chicago Computing Organizations|
|Date:||Mon, 31 Aug 1992 17:20:54 GMT|
Jonathan Eifrig writes:
> This seems quite surprising to me, given that Tomita's algorithm
>basically has to spin off on the fly new parsing automatons to follow each
>possible path in a derivation.
Yes and no. If this were true, then Tomita's algorithm would have a cubic
worst-case time factor. He uses a graph-structured parse forest, though,
and claims polynomial time.
-Richard L. Goerwitz firstname.lastname@example.org
Return to the
Search the comp.compilers archives again.