ANN: Infix expression parsers included into simple components v1.4

http://www.dmitry-kazakov.de/ada/components.htm


Parsers can be used for syntax analysis of infix expressions, i.e. ones
containing infix (dyadic), prefix and postfix operators, brackets, function
calls, array indices etc. The approach presented does not require any
grammar put down to generate scanner and analyzer. Nor any code generation
steps are required. An object-oriented approach is used instead. The
lexical procedures are dispatching, so that implementations may be provided
through overriding them. Parsers can be used both for immediate one-pass
code interpretation and for parsing tree building. Parser automatically
detects the expression end allowing its easy integration. Operator
precedence is expressed in a native way by setting priorities controlling
association with the operands. Associations with the left and right side
operands are controlled independently. Commutative operators and their
inverses can be optimized when necessary. Especial attention is paid to
error handling allowing generating very precise error messages and source
code references. Samples from a small console calculator to a complete
parsing tree generator for Ada 95 expressions illustrate examples of use.


--
Regards,
Dmitry A. Kazakov
www.dmitry-kazakov.de

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