Related articles |
---|
Transparent recursive descent doug@netcom.com (1993-11-01) |
NON-recursive descent expression parsing mbp@nyssa.wa7ipx.ampr.org (Marlin Prowell) (1993-11-04) |
Re: NON-recursive descent expression parsing grunwald@foobar.cs.colorado.edu (1993-11-13) |
Newsgroups: | comp.compilers |
From: | grunwald@foobar.cs.colorado.edu (Dirk Grunwald) |
Keywords: | parse |
Organization: | University of Colorado at Boulder |
References: | 93-11-012 93-11-035 |
Date: | Sat, 13 Nov 1993 18:06:30 GMT |
There are a variety of techniques called precedence parsing which work
for a small set of grammars (typically expressions). They're described
in the Aho/Ullman/? series on parsing published in the 70's? 80's?
--
Return to the
comp.compilers page.
Search the
comp.compilers archives again.