Tomita parsing

"David Fisher" <nospam@nospam.nospam.nospam>
13 Dec 2003 21:03:05 -0500

          From comp.compilers
Related articles
Tomita parsing nospam@nospam.nospam.nospam (David Fisher) (2003-12-13)
Re: Tomita parsing cfc@world.std.com (Chris F Clark) (2003-12-14)
| List of all articles for this month |
From: "David Fisher" <nospam@nospam.nospam.nospam>
Newsgroups: comp.compilers
Date: 13 Dec 2003 21:03:05 -0500
Organization: Pacific Internet (Australia)
Keywords: parse
Posted-Date: 13 Dec 2003 21:03:05 EST

I read a comment somewhere about Tomita parsing being ineffective
(ie. slow) for large languages, but Andi Kleen mentioned in passing
(in message "Re: Precedence based parsing") that new versions of Bison
use this algorithm ... can someone please clarify this ?


Thanks,
David F


["Slow" and "big" meant something different 15 years ago than they do
today. -John]


Post a followup to this message

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