Dave Tweed wrote:
> Has anyone out there extended the parser combinators in Hutton & Meijers
> paper on Monadic Parser Combinators to deal with a large set of operators
> with lots of precedence levels?
Have a look at
Steve Hill: Combinators for parsing expressions, J. Functional Programming
6(3):445-463, May 1996.
Steve Hill defines combinators for expressions with precedences and
associativities. He doesn't use monadic parser combinators but the ones
described by Graham Hutton earlier. However, rewriting should not be difficult.
For more references to papers on parser combinators see the bottom of page
http://www-i2.informatik.rwth-aachen.de/~chitil/DiplArb/parser.html
Olaf
--
OLAF CHITIL, Lehrstuhl fuer Informatik II, RWTH Aachen, 52056 Aachen, Germany
Tel: (+49/0)241/80-21212; Fax: (+49/0)241/8888-217
URL: http://www-i2.informatik.rwth-aachen.de/~chitil/
