|LR(0) vs. LALR, and the Great Parsing War firstname.lastname@example.org (1992-08-30)|
|Re: LR(0) vs. LALR, and the Great Parsing War email@example.com (1992-08-31)|
|Re: LR(0) vs. LALR, and the Great Parsing War firstname.lastname@example.org (1992-09-02)|
|Re: LR(0) vs. LALR, and the Great Parsing War email@example.com (1992-09-05)|
|From:||firstname.lastname@example.org (Richard L. Goerwitz)|
|Organization:||University of Chicago Computing Organizations|
|Date:||Wed, 2 Sep 1992 00:47:47 GMT|
|Keywords:||parse, LALR, comment|
Richard L. Goerwitz writes:
>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.
Exponential time factor, I mean. Not "cubic"!
-Richard L. Goerwitz email@example.com
[Oops, shoulda caught that. -John]
Return to the
Search the comp.compilers archives again.