O(n) Good Enough

"Quinn Tyler Jackson" <qjackson@wave.home.com>
15 Jan 1999 01:11:57 -0500

          From comp.compilers

Related articles
O(n) Good Enough qjackson@wave.home.com (Quinn Tyler Jackson) (1999-01-15)
Re: O(n) Good Enough J.Scheerder@cwi.nl (1999-01-17)
Re: O(n) Good Enough jejones@microware.com (James Jones) (1999-01-17)
Re: O(n) Good Enough gaustin@dallas.beasys.com (Glen Austin) (1999-01-17)
Re: O(n) Good Enough dmr@bell-labs.com (Dennis Ritchie) (1999-01-19)
Re: O(n) Good Enough dtribble@technologist.com (David R Tribble) (1999-01-22)
Re: O(n) Good Enough dmr@bell-labs.com (Dennis Ritchie) (1999-01-23)
| List of all articles for this month |

From: "Quinn Tyler Jackson" <qjackson@wave.home.com>
Newsgroups: comp.compilers
Date: 15 Jan 1999 01:11:57 -0500
Organization: Compilers Central
Keywords: parse, performance

Two simple questions:

Is a O(n) parser good enough?

Although there is plenty of literature discussing the efficiency of
low level (read character based) pattern matching algorithms, I
haven't found much O(x) [where x is anything from n log m to n^r] type
literature on the efficiency of parsers. Any pointers to literature
in this area?

Thanks in advance,

Quinn Tyler Jackson

email: qjackson@wave.home.com
url: http://www.qtj.net/~quinn/
ftp: qtj.net

Post a followup to this message

Return to the comp.compilers page.
Search the comp.compilers archives again.