Return to the
comp.compilers page.
Search the
comp.compilers archives again.
| Related articles |
|---|
| Parsing with infinite lookahead Matt_Timmermans@msl.isis.org (Matt Timmermans/MSL) (1994-02-22) |
| Re: Parsing with infinite lookahead jos@and.nl (1994-02-24) |
| Parsing with infinite lookahead bevan@cs.man.ac.uk (Stephen J Bevan) (1994-02-24) |
| Re: Parsing with infinite lookahead dwohlfor@cs.uoregon.edu (1994-02-24) |
| Re: Parsing with infinite lookahead parrt@s1.arc.umn.edu (Terence Parr) (1994-02-25) |
| Re: Parsing with infinite lookahead corbett@lupa.Eng.Sun.COM (1994-02-26) |
| Re: Parsing with infinite lookahead nandu@cs.clemson.edu (1994-02-27) |
| Re: Parsing with infinite lookahead hbaker@netcom.com (1994-02-28) |
| Re: Parsing with infinite lookahead hbaker@netcom.com (1994-03-01) |
| Re: Parsing with infinite lookahead bromage@mundil.cs.mu.OZ.AU (1994-03-02) |
| [1 later articles] |
| Newsgroups: | comp.compilers |
| From: | dwohlfor@cs.uoregon.edu (Clai'omh Dorcha) |
| Keywords: | parse, theory |
| Organization: | University of Oregon Computer and Information Sciences Dept. |
| References: | 94-02-174 |
| Date: | Thu, 24 Feb 1994 22:49:36 GMT |
The CYK algorithm (as seen in Hopcroft & Ullman) is capable of parsing
_any_ context free grammar. The bummer is that it is O(n^3) where n is
the length of the input string. Most folks aren't too keen on using it
when a linear parser exists for most CFG's. But it is the only general
purpose parsing algorithm.
David Wohlford
University of Oregon, Computer Science
--
Return to the
comp.compilers page.
Search the
comp.compilers archives again.