4 ms·
Writing an expression parser is probably the compiler "equivalent": http://www.strchr.com/expression_evaluator http://www.strchr.com/expression_evaluator
by bronxbomber92 13y ago
Writing an expression parser is probably the compiler "equivalent": http://www.strchr.com/expression_evaluator http://www.strchr.com/expression_evaluator
- anaphor 13y agoMore like an expression parser that doesn't handle precedence or unary operators FYI, I recommend using the precedence climbing algorithm if you do need to do expression parsing: http://eli.thegreenplace.net/2012/08/02/parsing-expressions-by-precedence-climbing/ http://eli.thegreenplace.net/2012/08/02/parsing-expressions-... It fits very well into a full recursive descent parser and is much more efficient and flexible than hardcoding in productions for handling the operators (and you can dynamically add new ones easily).