A longshot I know but...
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? (I can parse an operator and get its
application function and precedence level but applying them in the correct
order is the problem.)
Background: In my spare time I'm writing a small interpreter for a
language with operators with, at the moment, 7 precedence levels. The
parser isn't the interesting bit for me, and my first two `quick & dirty'
methods didn't actually work correctly.
Many thanks for any help, any pointers to recent information, etc.
cheers, dave
-------------------------------------------------------------------------
email reply: [EMAIL PROTECTED] "tail recursion: to extend your
www.cs.bris.ac.uk/~tweed/pi.htm understanding, see tail recursion."
work tel: (0117) 9545104 -- The New Hacker's Dictionary
