Re: User definable operators again

Norman Ramsey <nr@labrador.cs.virginia.edu>
10 Jul 1998 20:54:19 -0400

          From comp.compilers
Related articles
User definable operators again rz1@stud.mw.tu-muenchen.de (Robert Zierer) (1998-07-08)
Re: User definable operators again nr@labrador.cs.virginia.edu (Norman Ramsey) (1998-07-10)
| List of all articles for this month |
From: Norman Ramsey <nr@labrador.cs.virginia.edu>
Newsgroups: comp.compilers
Date: 10 Jul 1998 20:54:19 -0400
Organization: University of Virginia Computer Science
References: 98-07-065
Keywords: syntax, parse

Robert Zierer <rz1@stud.mw.tu-muenchen.de> wrote:
>Does anyone have information (implementations, algorithms) on how to
>scann, parse and transform to AST an (mathematical,...) expression
>(e.g. 'a+b*-c++ - d+e') where the operators (all forms: prefix, postfix,
>binary infix, brackets AND ternary) can be defined (with name,
>precedence and associativity) at compiletime.


My paper ``Unparsing Expressions with Prefix and Postfix Operators''
shows how to do this in an appendix. You can see a preprint at
http://www.cs.virginia.edu/~nr/pubs/unparse-abstract.html; it's
supposed to be published in Software---Practice and Experience, but I
don't know when.


Norman
--

Post a followup to this message

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