|Pointer to Ref on Operator-Evaluation-Machine email@example.com (1992-11-09)|
|From:||firstname.lastname@example.org (Buehlmann Thomas)|
|Organization:||Swiss Federal Institute of Technology (ETH), Zurich, CH|
|Date:||Mon, 9 Nov 1992 14:22:10 GMT|
|Keywords:||design, prolog, comment|
I am lookin for a pointer to any text, report or similar about the following
If we build a recursive descent-parser it's very awkward to have to design
the grammar in such a way that it reflects the operators priority, arity,
associativity and the direction of evaluation. I remember that there are
some quite general evaluation schemes to evaluate such expressions without
having to adjust the grammar dramatically. Who remembers where such an
evaluation-machine is described.
Note that such techniques must be applied in Prolog for it allows for
the definition of operators in order to extend the already existing operators.
Please do reply by mail to
and I will post a summary of answers.
[The Ritchie C compiler used RD for most of the parser, but a simple operator
precedence scheme for expressions. Try that. -John]
Return to the
Search the comp.compilers archives again.