Print

Please login or register.
1 Hour 1 Day 1 Week 1 Month Forever
Login with username, password and session length

[MrC]

Question: How is MC doing its expression parsing for the expression language?

Is there formal grammar, or stack based state machine, or ...?

[Matt]

I'm not certain what you're asking, but the expression parser is stack based.

This allows it to nicely handle nested expressions and parenthesis.

Evaluation of expressions runs the stack in an interpretive manner.  In other words, the stack is not compiled to machine code.

[MrC]

I was wondering if you had a formal grammar defined, and then used software to build your lexer/parser.

But it sounds like you've built your own.

I've been mucking about with an expression parser that would do essentially something like this:

http://ewbi.blogs.com/develops/2004/12/excel_formula_p.html  [enable javascript to use]

But I also thought about writing a formal grammar and using one of the many lexer/parser builders available.

Once an expression gets beyond a couple of nested IF statements, it becomes too cumbersome.  Finding a missing paren, or comma, can be very challenging:

http://yabb.jriver.com/interact/index.php?topic=65519.new;topicseen#new

It would be ideal if MC could do some basic structured presentation of an expression for both entry and viewing (but I know you folks are busy).