Re: Syntax extension of infix languages

[Doug Orleans <address@hidden>]

Tim Hickey wrote:
 > Prolog uses an extensible infix grammar based on an extension of
 > operator grammars. A program can introduce new infix operators with
 > specified associativity, precedence, and fixity (infix, prefix, postfix).
 > The parser always translates the expressions into operator syntax
 > trees in a fairly simple manner.

For what it's worth, Cecil can do this too.
http://www.cs.washington.edu/research/projects/cecil/www/Release/doc-cecil-lang/cecil-spec-37.html

I guess that's not what Eric's looking for, but maybe someone else is.

--dougo@ccs.neu.edu