Re: Q: Operator Precedence Parser

djello@well.com (Darius Bacon)
12 Mar 1998 23:20:29 -0500

          From comp.compilers
Related articles
Q: Operator Precedence Parser shahn@galjas.cs.vu.nl (Sander Hahn) (1998-03-07)
Re: Q: Operator Precedence Parser fs29@rummelplatz.uni-mannheim.de (1998-03-12)
Re: Q: Operator Precedence Parser adrian@dcs.rhbnc.ac.uk (1998-03-12)
Re: Q: Operator Precedence Parser djello@well.com (1998-03-12)
Re: Q: Operator Precedence Parser jhallen@world.std.com (1998-03-15)
Re: Q: Operator Precedence Parser mikeq@primenet.com (1998-03-15)
| List of all articles for this month |
From: djello@well.com (Darius Bacon)
Newsgroups: comp.compilers
Date: 12 Mar 1998 23:20:29 -0500
Organization: Whole Earth Networks News
References: 98-03-062
Keywords: parse

Sander Hahn <shahn@galjas.cs.vu.nl> writes:
>i want to learn more about operator precedence parsers. The operators
>should be dynamically overloadable, like in Prolog. Where can i find
>more information about this subject? (preferably online)


My table-driven expression parser at
http://www.well.com/~djello/expr.tar.gz is one easy-to-follow source;
you'll have to replace the static table with a dynamic one, but the
algorithm itself doesn't change. I think David R. Hanson wrote it up
in a Software Practice and Experience paper.


A Prolog system would be another obvious place to look.


--
Darius Bacon
http://www.well.com/~djello
--

Post a followup to this message

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