Using antlr for parsing boolean expressions.
0 posts in topic
Flat View  Flat View
TOPIC ACTIONS:
 

Posted By:   Zara_Sheil
Posted On:   Thursday, October 27, 2005 09:49 AM

Hi,
Im trying to build a parser that will allow me to compare two different boolean expressions and determine if they are equal.
I thought I would need a parse tree but after looking at the examples using ASTs I wonder would this be a better option?
Would the coding of this be similar to the Q&As already posted on the mathematical calaulator?


Thanks!

About | Sitemap | Contact