|Q: Operator Precedence Parser firstname.lastname@example.org (Sander Hahn) (1998-03-07)|
|Re: Q: Operator Precedence Parser email@example.com (1998-03-12)|
|Re: Q: Operator Precedence Parser firstname.lastname@example.org (1998-03-12)|
|Re: Q: Operator Precedence Parser email@example.com (1998-03-12)|
|Re: Q: Operator Precedence Parser firstname.lastname@example.org (1998-03-15)|
|Re: Q: Operator Precedence Parser email@example.com (1998-03-15)|
|From:||firstname.lastname@example.org (Darius Bacon)|
|Date:||12 Mar 1998 23:20:29 -0500|
|Organization:||Whole Earth Networks News|
Sander Hahn <email@example.com> 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.
Return to the
Search the comp.compilers archives again.