NON-recursive descent expression parsing

Doug Merritt (doug@netcom.com) recently posted a expression parser that
has just two core functions. Dave Hanson describes this same scheme in
"Compact Recursive-descent Parsing of Expressions", Software - Practice
and Experience, December 1985. The article includes the algorithm
written in C. BTW, this technique is used in lcc.


I remember reading another article, in response to Dave Hanson's
article, that described a technique for parsing expressions and
building an AST without using recursive descent. As I recall, it
rotated nodes in the tree, but I cannot find this article. Does anyone
have a reference?
--
| Marlin Prowell
| mbp@nyssa.wa7ipx.ampr.org
--

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