Re: Q: Operator Precedence Parser

Sander Hahn (shahn@galjas.cs.vu.nl) wrote:
: Hello,
:
: 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)


When implementing my T2 compiler, I was looking for a way to speed up
expression parsing (it used recursive procedure calls at that time).
Finally, I have managed to do almost the entire expression parsing
in a single procedure driven by a table containing integers to
represent the operator precedences. Because of the table-driven
approach, it should be easy to add, remove, and modify operators.


The T3 compiler (including C and T3 source code) which uses the described
method it available at my homepage:


http://webrum.uni-mannheim.de/sowi/fs29/w3/index.html


Bye,
nmh.


--
/* Nils M. Holm <fs29@rumms.uni-mannheim.de> */
--

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